YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 06:12:54,690 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 06:12:54,692 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 06:12:54,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 06:12:54,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 06:12:54,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 06:12:54,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 06:12:54,708 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 06:12:54,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 06:12:54,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 06:12:54,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 06:12:54,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 06:12:54,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 06:12:54,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 06:12:54,714 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 06:12:54,715 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 06:12:54,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 06:12:54,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 06:12:54,719 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 06:12:54,720 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 06:12:54,721 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 06:12:54,722 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 06:12:54,724 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 06:12:54,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 06:12:54,725 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 06:12:54,726 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 06:12:54,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 06:12:54,727 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 06:12:54,727 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 06:12:54,728 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 06:12:54,728 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 06:12:54,729 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 06:12:54,730 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 06:12:54,730 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 06:12:54,731 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 06:12:54,731 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 06:12:54,731 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 06:12:54,732 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 06:12:54,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 06:12:54,733 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 06:12:54,747 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 06:12:54,748 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 06:12:54,749 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 06:12:54,749 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 06:12:54,749 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 06:12:54,749 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 06:12:54,749 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 06:12:54,750 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 06:12:54,750 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 06:12:54,750 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 06:12:54,750 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 06:12:54,750 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 06:12:54,750 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 06:12:54,750 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 06:12:54,751 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:12:54,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 06:12:54,751 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 06:12:54,751 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 06:12:54,751 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 06:12:54,752 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 06:12:54,752 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 06:12:54,752 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 06:12:54,752 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 06:12:54,752 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 06:12:54,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 06:12:54,753 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 06:12:54,753 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 06:12:54,753 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 06:12:54,754 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 06:12:54,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 06:12:54,792 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 06:12:54,796 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 06:12:54,798 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 06:12:54,798 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 06:12:54,799 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 06:12:54,871 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/77b4a62110d44db8a21a1d59bd9ffe42/FLAG42f146a73 [2020-06-22 06:12:55,224 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 06:12:55,225 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 06:12:55,232 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/77b4a62110d44db8a21a1d59bd9ffe42/FLAG42f146a73 [2020-06-22 06:12:55,627 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/77b4a62110d44db8a21a1d59bd9ffe42 [2020-06-22 06:12:55,642 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 06:12:55,643 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 06:12:55,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 06:12:55,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 06:12:55,649 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 06:12:55,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 06:12:55" (1/1) ... [2020-06-22 06:12:55,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54018437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55, skipping insertion in model container [2020-06-22 06:12:55,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 06:12:55" (1/1) ... [2020-06-22 06:12:55,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 06:12:55,683 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 06:12:55,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 06:12:55,852 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 06:12:55,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 06:12:55,949 INFO L195 MainTranslator]: Completed translation [2020-06-22 06:12:55,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55 WrapperNode [2020-06-22 06:12:55,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 06:12:55,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 06:12:55,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 06:12:55,951 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 06:12:55,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55" (1/1) ... [2020-06-22 06:12:55,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55" (1/1) ... [2020-06-22 06:12:55,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 06:12:55,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 06:12:55,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 06:12:55,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 06:12:56,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55" (1/1) ... [2020-06-22 06:12:56,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55" (1/1) ... [2020-06-22 06:12:56,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55" (1/1) ... [2020-06-22 06:12:56,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55" (1/1) ... [2020-06-22 06:12:56,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55" (1/1) ... [2020-06-22 06:12:56,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55" (1/1) ... [2020-06-22 06:12:56,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55" (1/1) ... [2020-06-22 06:12:56,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 06:12:56,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 06:12:56,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 06:12:56,013 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 06:12:56,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 06:12:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure loop [2020-06-22 06:12:56,118 INFO L138 BoogieDeclarations]: Found implementation of procedure loop [2020-06-22 06:12:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 06:12:56,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 06:12:56,333 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 06:12:56,333 INFO L286 CfgBuilder]: Removed 12 assue(true) statements. [2020-06-22 06:12:56,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:12:56 BoogieIcfgContainer [2020-06-22 06:12:56,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 06:12:56,336 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 06:12:56,336 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 06:12:56,339 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 06:12:56,340 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:12:56" (1/1) ... [2020-06-22 06:12:56,360 INFO L313 BlockEncoder]: Initial Icfg 19 locations, 24 edges [2020-06-22 06:12:56,362 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 06:12:56,362 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 06:12:56,363 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 06:12:56,363 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 06:12:56,366 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 06:12:56,367 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 06:12:56,367 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 06:12:56,389 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 06:12:56,412 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 06:12:56,417 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 06:12:56,420 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 06:12:56,431 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 06:12:56,434 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-06-22 06:12:56,436 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 06:12:56,436 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 06:12:56,436 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 06:12:56,437 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 06:12:56,437 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 22 edges [2020-06-22 06:12:56,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:12:56 BasicIcfg [2020-06-22 06:12:56,438 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 06:12:56,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 06:12:56,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 06:12:56,443 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 06:12:56,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 06:12:55" (1/4) ... [2020-06-22 06:12:56,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a972144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:12:56, skipping insertion in model container [2020-06-22 06:12:56,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55" (2/4) ... [2020-06-22 06:12:56,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a972144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:12:56, skipping insertion in model container [2020-06-22 06:12:56,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:12:56" (3/4) ... [2020-06-22 06:12:56,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a972144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:12:56, skipping insertion in model container [2020-06-22 06:12:56,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:12:56" (4/4) ... [2020-06-22 06:12:56,447 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 06:12:56,459 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 06:12:56,468 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 06:12:56,486 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 06:12:56,520 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 06:12:56,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 06:12:56,521 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 06:12:56,521 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 06:12:56,521 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 06:12:56,521 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 06:12:56,521 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 06:12:56,521 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 06:12:56,522 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 06:12:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-06-22 06:12:56,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 06:12:56,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-06-22 06:12:56,612 INFO L451 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: true [2020-06-22 06:12:56,612 INFO L451 ceAbstractionStarter]: At program point loopENTRY(lines 40 48) the Hoare annotation is: true [2020-06-22 06:12:56,612 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 47) no Hoare annotation was computed. [2020-06-22 06:12:56,613 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 40 48) no Hoare annotation was computed. [2020-06-22 06:12:56,613 INFO L451 ceAbstractionStarter]: At program point L37(lines 32 38) the Hoare annotation is: true [2020-06-22 06:12:56,613 INFO L448 ceAbstractionStarter]: For program point loopEXIT(lines 40 48) no Hoare annotation was computed. [2020-06-22 06:12:56,613 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 37) no Hoare annotation was computed. [2020-06-22 06:12:56,614 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 34 37) no Hoare annotation was computed. [2020-06-22 06:12:56,614 INFO L448 ceAbstractionStarter]: For program point L34-2(lines 34 37) no Hoare annotation was computed. [2020-06-22 06:12:56,614 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 06:12:56,614 INFO L451 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: true [2020-06-22 06:12:56,614 INFO L451 ceAbstractionStarter]: At program point L37(lines 32 38) the Hoare annotation is: true [2020-06-22 06:12:56,614 INFO L451 ceAbstractionStarter]: At program point L37-1(lines 32 38) the Hoare annotation is: true [2020-06-22 06:12:56,615 INFO L451 ceAbstractionStarter]: At program point L37-2(lines 32 38) the Hoare annotation is: true [2020-06-22 06:12:56,615 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 37) no Hoare annotation was computed. [2020-06-22 06:12:56,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:12:56 BasicIcfg [2020-06-22 06:12:56,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 06:12:56,626 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 06:12:56,626 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 06:12:56,629 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 06:12:56,630 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:12:56,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 06:12:55" (1/5) ... [2020-06-22 06:12:56,631 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4de3a061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 06:12:56, skipping insertion in model container [2020-06-22 06:12:56,631 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:12:56,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:12:55" (2/5) ... [2020-06-22 06:12:56,632 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4de3a061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 06:12:56, skipping insertion in model container [2020-06-22 06:12:56,632 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:12:56,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:12:56" (3/5) ... [2020-06-22 06:12:56,633 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4de3a061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:12:56, skipping insertion in model container [2020-06-22 06:12:56,633 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:12:56,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:12:56" (4/5) ... [2020-06-22 06:12:56,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4de3a061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:12:56, skipping insertion in model container [2020-06-22 06:12:56,634 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:12:56,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:12:56" (5/5) ... [2020-06-22 06:12:56,636 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 06:12:56,666 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 06:12:56,666 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 06:12:56,666 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 06:12:56,666 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 06:12:56,666 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 06:12:56,666 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 06:12:56,667 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 06:12:56,667 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 06:12:56,667 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 06:12:56,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-06-22 06:12:56,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 06:12:56,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:12:56,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:12:56,699 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 06:12:56,699 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 06:12:56,699 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 06:12:56,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-06-22 06:12:56,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 06:12:56,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:12:56,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:12:56,703 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 06:12:56,703 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 06:12:56,709 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue [58] ULTIMATE.startENTRY-->L34: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_4|, ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_3, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_4|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_3|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_3|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_random_#res, ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_main_#res, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_#t~ret4] 15#L34true [72] L34-->L37: Formula: (and (>= v_ULTIMATE.start_random_~x~1_6 0) (= |v_ULTIMATE.start_random_#res_6| v_ULTIMATE.start_random_~x~1_6)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 4#L37true [52] L37-->L34-1: Formula: (= |v_ULTIMATE.start_main_#t~ret3_4| |v_ULTIMATE.start_random_#res_8|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_8|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_3|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_4|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_7, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_random_#res] 13#L34-1true [62] L34-1-->L37-1: Formula: (and (= |v_ULTIMATE.start_random_#res_9| (- v_ULTIMATE.start_random_~x~1_9)) (< v_ULTIMATE.start_random_~x~1_9 0)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_9} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_9, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_9|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 17#L37-1true [69] L37-1-->L34-2: Formula: (= |v_ULTIMATE.start_main_#t~ret4_4| |v_ULTIMATE.start_random_#res_12|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_12|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_5|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_11, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_11|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_random_#res, ULTIMATE.start_main_#t~ret4] 11#L34-2true [59] L34-2-->L37-2: Formula: (and (= |v_ULTIMATE.start_random_#res_1| (- v_ULTIMATE.start_random_~x~1_1)) (< v_ULTIMATE.start_random_~x~1_1 0)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 16#L37-2true [68] L37-2-->L28: Formula: (= |v_ULTIMATE.start_main_#t~ret5_1| |v_ULTIMATE.start_random_#res_3|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} OutVars{ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret5] 7#L28true [54] L28-->loopENTRY: Formula: (and (= |v_loop_#in~cInParam_2| |v_ULTIMATE.start_main_#t~ret5_5|) (= |v_loop_#in~aInParam_2| |v_ULTIMATE.start_main_#t~ret3_5|) (= |v_loop_#in~bInParam_2| |v_ULTIMATE.start_main_#t~ret4_5|)) InVars {ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} OutVars{loop_#in~c=|v_loop_#in~cInParam_2|, loop_#in~b=|v_loop_#in~bInParam_2|, loop_#in~a=|v_loop_#in~aInParam_2|} AuxVars[] AssignedVars[loop_#in~c, loop_#in~b, loop_#in~a]< 5#loopENTRYtrue [2020-06-22 06:12:56,710 INFO L796 eck$LassoCheckResult]: Loop: 5#loopENTRYtrue [50] loopENTRY-->L41: Formula: (and (= v_loop_~b_1 |v_loop_#in~b_1|) (= v_loop_~c_1 |v_loop_#in~c_1|) (= v_loop_~a_1 |v_loop_#in~a_1|)) InVars {loop_#in~c=|v_loop_#in~c_1|, loop_#in~b=|v_loop_#in~b_1|, loop_#in~a=|v_loop_#in~a_1|} OutVars{loop_#in~c=|v_loop_#in~c_1|, loop_#in~b=|v_loop_#in~b_1|, loop_#in~a=|v_loop_#in~a_1|, loop_~b=v_loop_~b_1, loop_~c=v_loop_~c_1, loop_~a=v_loop_~a_1} AuxVars[] AssignedVars[loop_~b, loop_~c, loop_~a] 3#L41true [48] L41-->L34: Formula: (and (= v_loop_~c_2 v_loop_~a_2) (<= (+ v_loop_~c_2 1) v_loop_~b_2)) InVars {loop_~b=v_loop_~b_2, loop_~c=v_loop_~c_2, loop_~a=v_loop_~a_2} OutVars{loop_random_~x~1=v_loop_random_~x~1_1, loop_random_#t~nondet6=|v_loop_random_#t~nondet6_1|, loop_random_#res=|v_loop_random_#res_1|, loop_~b=v_loop_~b_2, loop_~c=v_loop_~c_2, loop_~a=v_loop_~a_2} AuxVars[] AssignedVars[loop_random_~x~1, loop_random_#t~nondet6, loop_random_#res] 8#L34true [55] L34-->L37: Formula: (and (< v_loop_random_~x~1_3 0) (= |v_loop_random_#res_2| (- v_loop_random_~x~1_3))) InVars {loop_random_~x~1=v_loop_random_~x~1_3} OutVars{loop_random_~x~1=v_loop_random_~x~1_3, loop_random_#res=|v_loop_random_#res_2|} AuxVars[] AssignedVars[loop_random_#res] 12#L37true [61] L37-->L46: Formula: (and (= v_loop_~a_3 v_loop_~c_3) (= v_loop_~c_3 (+ v_loop_~r~0_1 v_loop_~c_4 1)) (= v_loop_~b_3 10) (= v_loop_~r~0_1 |v_loop_random_#res_4|)) InVars {loop_~c=v_loop_~c_4, loop_random_#res=|v_loop_random_#res_4|} OutVars{loop_~r~0=v_loop_~r~0_1, loop_#t~ret7=|v_loop_#t~ret7_1|, loop_random_#res=|v_loop_random_#res_4|, loop_~b=v_loop_~b_3, loop_~c=v_loop_~c_3, loop_~a=v_loop_~a_3} AuxVars[] AssignedVars[loop_~r~0, loop_#t~ret7, loop_~b, loop_~c, loop_~a] 9#L46true [57] L46-->loopENTRY: Formula: (and (= |v_loop_#in~bInParam_1| v_loop_~b_6) (= |v_loop_#in~cInParam_1| v_loop_~c_7) (= |v_loop_#in~aInParam_1| v_loop_~a_6)) InVars {loop_~b=v_loop_~b_6, loop_~c=v_loop_~c_7, loop_~a=v_loop_~a_6} OutVars{loop_#in~c=|v_loop_#in~cInParam_1|, loop_#in~b=|v_loop_#in~bInParam_1|, loop_#in~a=|v_loop_#in~aInParam_1|} AuxVars[] AssignedVars[loop_#in~c, loop_#in~b, loop_#in~a]< 5#loopENTRYtrue [2020-06-22 06:12:56,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:12:56,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1515141345, now seen corresponding path program 1 times [2020-06-22 06:12:56,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:12:56,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:12:56,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:12:56,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:12:56,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:12:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:12:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:12:56,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:12:56,809 INFO L82 PathProgramCache]: Analyzing trace with hash 76289972, now seen corresponding path program 1 times [2020-06-22 06:12:56,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:12:56,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:12:56,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:12:56,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:12:56,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:12:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:12:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:12:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:12:56,829 INFO L82 PathProgramCache]: Analyzing trace with hash -784504108, now seen corresponding path program 1 times [2020-06-22 06:12:56,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:12:56,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:12:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:12:56,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:12:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:12:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:12:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:12:57,040 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:12:57,042 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:12:57,042 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:12:57,042 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:12:57,042 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:12:57,042 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:12:57,042 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:12:57,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:12:57,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 06:12:57,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:12:57,043 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:12:57,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:12:57,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:12:57,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:12:57,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:12:57,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:12:57,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:12:57,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:12:57,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:12:57,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:12:57,176 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:12:57,177 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:12:57,187 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:12:57,188 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:12:57,197 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:12:57,197 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_random_#t~nondet6=0} Honda state: {loop_random_#t~nondet6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:12:57,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:12:57,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:12:57,239 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:12:57,239 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_#t~ret7=0} Honda state: {loop_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:12:57,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:12:57,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:12:57,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:12:57,273 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_~r~0=0} Honda state: {loop_~r~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:12:57,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:12:57,301 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:12:57,304 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:12:57,304 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_random_~x~1=0} Honda state: {loop_random_~x~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:12:57,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:12:57,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:12:57,338 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:12:57,338 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_~c=0} Honda state: {loop_~c=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:12:57,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:12:57,366 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:12:57,370 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:12:57,370 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_~b=0} Honda state: {loop_~b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:12:57,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:12:57,399 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:12:57,404 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:12:57,404 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_~a=0} Honda state: {loop_~a=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:12:57,431 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:12:57,431 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:12:57,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:12:57,467 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:13:00,299 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:13:00,306 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:13:00,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:13:00,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:13:00,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:13:00,307 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:13:00,307 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:13:00,307 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:13:00,307 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:13:00,308 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 06:13:00,308 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:13:00,308 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:13:00,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:00,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:00,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:00,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:00,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:00,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:00,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:00,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:00,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:00,434 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:13:00,440 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:13:00,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:13:00,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:13:00,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:13:00,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:13:00,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:13:00,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:13:00,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:13:00,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:13:00,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:13:00,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:13:00,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:13:00,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:13:00,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:13:00,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:13:00,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:13:00,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:13:00,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:13:00,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:13:00,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,519 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 06:13:00,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,520 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 06:13:00,521 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 06:13:00,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,524 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 06:13:00,525 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 06:13:00,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,528 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 06:13:00,529 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 06:13:00,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,531 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 06:13:00,532 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 06:13:00,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,536 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 06:13:00,537 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 06:13:00,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,540 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 06:13:00,540 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 06:13:00,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:00,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:00,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:00,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:00,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:00,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:00,543 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 06:13:00,544 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 06:13:00,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:00,558 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:13:00,573 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:13:00,574 INFO L444 ModelExtractionUtils]: 4 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 06:13:00,576 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:13:00,577 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:13:00,577 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:13:00,578 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -1*loop_#in~c + 8 f1 = -1*loop_#in~c + 1*loop_#in~b Supporting invariants [] [2020-06-22 06:13:00,580 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:13:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:13:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:13:00,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:13:00,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:13:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:13:00,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 06:13:00,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:13:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:13:01,256 INFO L98 LoopCannibalizer]: 17 predicates before loop cannibalization 17 predicates after loop cannibalization [2020-06-22 06:13:01,261 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 17 loop predicates [2020-06-22 06:13:01,262 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states. Second operand 6 states. [2020-06-22 06:13:02,432 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states.. Second operand 6 states. Result 164 states and 247 transitions. Complement of second has 69 states. [2020-06-22 06:13:02,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2020-06-22 06:13:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 06:13:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2020-06-22 06:13:02,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 8 letters. Loop has 5 letters. [2020-06-22 06:13:02,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:13:02,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 13 letters. Loop has 5 letters. [2020-06-22 06:13:02,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:13:02,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 8 letters. Loop has 10 letters. [2020-06-22 06:13:02,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:13:02,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 247 transitions. [2020-06-22 06:13:02,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 06:13:02,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 47 states and 55 transitions. [2020-06-22 06:13:02,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-06-22 06:13:02,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2020-06-22 06:13:02,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. [2020-06-22 06:13:02,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:13:02,477 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-06-22 06:13:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. [2020-06-22 06:13:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 21. [2020-06-22 06:13:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 06:13:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2020-06-22 06:13:02,508 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-06-22 06:13:02,508 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-06-22 06:13:02,508 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 06:13:02,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2020-06-22 06:13:02,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 06:13:02,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:13:02,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:13:02,510 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 06:13:02,510 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 06:13:02,511 INFO L794 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY [58] ULTIMATE.startENTRY-->L34: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_4|, ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_3, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_4|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_3|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_3|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_random_#res, ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_main_#res, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_#t~ret4] 369#L34 [72] L34-->L37: Formula: (and (>= v_ULTIMATE.start_random_~x~1_6 0) (= |v_ULTIMATE.start_random_#res_6| v_ULTIMATE.start_random_~x~1_6)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 362#L37 [52] L37-->L34-1: Formula: (= |v_ULTIMATE.start_main_#t~ret3_4| |v_ULTIMATE.start_random_#res_8|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_8|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_3|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_4|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_7, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_random_#res] 363#L34-1 [62] L34-1-->L37-1: Formula: (and (= |v_ULTIMATE.start_random_#res_9| (- v_ULTIMATE.start_random_~x~1_9)) (< v_ULTIMATE.start_random_~x~1_9 0)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_9} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_9, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_9|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 372#L37-1 [69] L37-1-->L34-2: Formula: (= |v_ULTIMATE.start_main_#t~ret4_4| |v_ULTIMATE.start_random_#res_12|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_12|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_5|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_11, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_11|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_random_#res, ULTIMATE.start_main_#t~ret4] 370#L34-2 [59] L34-2-->L37-2: Formula: (and (= |v_ULTIMATE.start_random_#res_1| (- v_ULTIMATE.start_random_~x~1_1)) (< v_ULTIMATE.start_random_~x~1_1 0)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 371#L37-2 [68] L37-2-->L28: Formula: (= |v_ULTIMATE.start_main_#t~ret5_1| |v_ULTIMATE.start_random_#res_3|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} OutVars{ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret5] 358#L28 [54] L28-->loopENTRY: Formula: (and (= |v_loop_#in~cInParam_2| |v_ULTIMATE.start_main_#t~ret5_5|) (= |v_loop_#in~aInParam_2| |v_ULTIMATE.start_main_#t~ret3_5|) (= |v_loop_#in~bInParam_2| |v_ULTIMATE.start_main_#t~ret4_5|)) InVars {ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} OutVars{loop_#in~c=|v_loop_#in~cInParam_2|, loop_#in~b=|v_loop_#in~bInParam_2|, loop_#in~a=|v_loop_#in~aInParam_2|} AuxVars[] AssignedVars[loop_#in~c, loop_#in~b, loop_#in~a]< 364#loopENTRY [50] loopENTRY-->L41: Formula: (and (= v_loop_~b_1 |v_loop_#in~b_1|) (= v_loop_~c_1 |v_loop_#in~c_1|) (= v_loop_~a_1 |v_loop_#in~a_1|)) InVars {loop_#in~c=|v_loop_#in~c_1|, loop_#in~b=|v_loop_#in~b_1|, loop_#in~a=|v_loop_#in~a_1|} OutVars{loop_#in~c=|v_loop_#in~c_1|, loop_#in~b=|v_loop_#in~b_1|, loop_#in~a=|v_loop_#in~a_1|, loop_~b=v_loop_~b_1, loop_~c=v_loop_~c_1, loop_~a=v_loop_~a_1} AuxVars[] AssignedVars[loop_~b, loop_~c, loop_~a] 361#L41 [48] L41-->L34: Formula: (and (= v_loop_~c_2 v_loop_~a_2) (<= (+ v_loop_~c_2 1) v_loop_~b_2)) InVars {loop_~b=v_loop_~b_2, loop_~c=v_loop_~c_2, loop_~a=v_loop_~a_2} OutVars{loop_random_~x~1=v_loop_random_~x~1_1, loop_random_#t~nondet6=|v_loop_random_#t~nondet6_1|, loop_random_#res=|v_loop_random_#res_1|, loop_~b=v_loop_~b_2, loop_~c=v_loop_~c_2, loop_~a=v_loop_~a_2} AuxVars[] AssignedVars[loop_random_~x~1, loop_random_#t~nondet6, loop_random_#res] 365#L34 [76] L34-->L37: Formula: (and (= |v_loop_random_#res_3| v_loop_random_~x~1_4) (>= v_loop_random_~x~1_4 0)) InVars {loop_random_~x~1=v_loop_random_~x~1_4} OutVars{loop_random_~x~1=v_loop_random_~x~1_4, loop_random_#res=|v_loop_random_#res_3|} AuxVars[] AssignedVars[loop_random_#res] 366#L37 [2020-06-22 06:13:02,511 INFO L796 eck$LassoCheckResult]: Loop: 366#L37 [61] L37-->L46: Formula: (and (= v_loop_~a_3 v_loop_~c_3) (= v_loop_~c_3 (+ v_loop_~r~0_1 v_loop_~c_4 1)) (= v_loop_~b_3 10) (= v_loop_~r~0_1 |v_loop_random_#res_4|)) InVars {loop_~c=v_loop_~c_4, loop_random_#res=|v_loop_random_#res_4|} OutVars{loop_~r~0=v_loop_~r~0_1, loop_#t~ret7=|v_loop_#t~ret7_1|, loop_random_#res=|v_loop_random_#res_4|, loop_~b=v_loop_~b_3, loop_~c=v_loop_~c_3, loop_~a=v_loop_~a_3} AuxVars[] AssignedVars[loop_~r~0, loop_#t~ret7, loop_~b, loop_~c, loop_~a] 353#L46 [57] L46-->loopENTRY: Formula: (and (= |v_loop_#in~bInParam_1| v_loop_~b_6) (= |v_loop_#in~cInParam_1| v_loop_~c_7) (= |v_loop_#in~aInParam_1| v_loop_~a_6)) InVars {loop_~b=v_loop_~b_6, loop_~c=v_loop_~c_7, loop_~a=v_loop_~a_6} OutVars{loop_#in~c=|v_loop_#in~cInParam_1|, loop_#in~b=|v_loop_#in~bInParam_1|, loop_#in~a=|v_loop_#in~aInParam_1|} AuxVars[] AssignedVars[loop_#in~c, loop_#in~b, loop_#in~a]< 359#loopENTRY [50] loopENTRY-->L41: Formula: (and (= v_loop_~b_1 |v_loop_#in~b_1|) (= v_loop_~c_1 |v_loop_#in~c_1|) (= v_loop_~a_1 |v_loop_#in~a_1|)) InVars {loop_#in~c=|v_loop_#in~c_1|, loop_#in~b=|v_loop_#in~b_1|, loop_#in~a=|v_loop_#in~a_1|} OutVars{loop_#in~c=|v_loop_#in~c_1|, loop_#in~b=|v_loop_#in~b_1|, loop_#in~a=|v_loop_#in~a_1|, loop_~b=v_loop_~b_1, loop_~c=v_loop_~c_1, loop_~a=v_loop_~a_1} AuxVars[] AssignedVars[loop_~b, loop_~c, loop_~a] 352#L41 [48] L41-->L34: Formula: (and (= v_loop_~c_2 v_loop_~a_2) (<= (+ v_loop_~c_2 1) v_loop_~b_2)) InVars {loop_~b=v_loop_~b_2, loop_~c=v_loop_~c_2, loop_~a=v_loop_~a_2} OutVars{loop_random_~x~1=v_loop_random_~x~1_1, loop_random_#t~nondet6=|v_loop_random_#t~nondet6_1|, loop_random_#res=|v_loop_random_#res_1|, loop_~b=v_loop_~b_2, loop_~c=v_loop_~c_2, loop_~a=v_loop_~a_2} AuxVars[] AssignedVars[loop_random_~x~1, loop_random_#t~nondet6, loop_random_#res] 354#L34 [55] L34-->L37: Formula: (and (< v_loop_random_~x~1_3 0) (= |v_loop_random_#res_2| (- v_loop_random_~x~1_3))) InVars {loop_random_~x~1=v_loop_random_~x~1_3} OutVars{loop_random_~x~1=v_loop_random_~x~1_3, loop_random_#res=|v_loop_random_#res_2|} AuxVars[] AssignedVars[loop_random_#res] 366#L37 [2020-06-22 06:13:02,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:13:02,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1764544845, now seen corresponding path program 1 times [2020-06-22 06:13:02,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:13:02,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:13:02,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:13:02,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:13:02,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:13:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:13:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:13:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:13:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash 86711612, now seen corresponding path program 2 times [2020-06-22 06:13:02,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:13:02,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:13:02,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:13:02,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:13:02,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:13:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:13:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:13:02,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:13:02,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1643562128, now seen corresponding path program 1 times [2020-06-22 06:13:02,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:13:02,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:13:02,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:13:02,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:13:02,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:13:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:13:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:13:02,709 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:13:02,709 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:13:02,709 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:13:02,709 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:13:02,709 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:13:02,710 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:13:02,710 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:13:02,710 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:13:02,710 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 06:13:02,710 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:13:02,710 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:13:02,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:02,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:02,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:02,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:02,831 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:13:02,831 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:13:02,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:13:02,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:13:02,838 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:13:02,838 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_#t~ret7=0} Honda state: {loop_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:13:02,868 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:13:02,868 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:13:02,912 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:13:02,912 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:13:14,979 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-06-22 06:13:14,987 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:13:14,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:13:14,987 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:13:14,987 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:13:14,987 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:13:14,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:13:14,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:13:14,987 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:13:14,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 06:13:14,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:13:14,988 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:13:14,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:14,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:15,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:15,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 06:13:15,130 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:13:15,131 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:13:15,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:15,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:15,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:15,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:15,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:15,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:13:15,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:13:15,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:15,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:13:15,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 06:13:15,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:13:15,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:13:15,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:13:15,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:13:15,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:13:15,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:13:15,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:13:15,149 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:13:15,157 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:13:15,157 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 06:13:15,158 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:13:15,158 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:13:15,158 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:13:15,158 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(loop_random_#res, loop_~c) = -1*loop_random_#res - 1*loop_~c + 9 Supporting invariants [] [2020-06-22 06:13:15,159 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:13:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:13:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:13:15,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:13:15,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:13:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:13:15,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 06:13:15,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:13:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 06:13:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:13:15,330 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:13:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:13:15,343 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:13:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:13:15,355 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 06:13:15,355 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 6 predicates after loop cannibalization [2020-06-22 06:13:15,355 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-06-22 06:13:15,356 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-06-22 06:13:15,565 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 149 states and 195 transitions. Complement of second has 135 states. [2020-06-22 06:13:15,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2020-06-22 06:13:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 06:13:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2020-06-22 06:13:15,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 11 letters. Loop has 5 letters. [2020-06-22 06:13:15,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:13:15,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 16 letters. Loop has 5 letters. [2020-06-22 06:13:15,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:13:15,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 11 letters. Loop has 10 letters. [2020-06-22 06:13:15,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:13:15,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 195 transitions. [2020-06-22 06:13:15,579 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 06:13:15,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 0 states and 0 transitions. [2020-06-22 06:13:15,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 06:13:15,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 06:13:15,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 06:13:15,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:13:15,580 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:13:15,580 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:13:15,580 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:13:15,580 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 06:13:15,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 06:13:15,581 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 06:13:15,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 06:13:15,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:13:15 BasicIcfg [2020-06-22 06:13:15,588 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 06:13:15,589 INFO L168 Benchmark]: Toolchain (without parser) took 19946.43 ms. Allocated memory was 514.9 MB in the beginning and 628.6 MB in the end (delta: 113.8 MB). Free memory was 439.7 MB in the beginning and 463.7 MB in the end (delta: -23.9 MB). Peak memory consumption was 89.8 MB. Max. memory is 50.3 GB. [2020-06-22 06:13:15,591 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 06:13:15,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.47 ms. Allocated memory was 514.9 MB in the beginning and 561.5 MB in the end (delta: 46.7 MB). Free memory was 439.7 MB in the beginning and 531.1 MB in the end (delta: -91.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. [2020-06-22 06:13:15,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.60 ms. Allocated memory is still 561.5 MB. Free memory was 531.1 MB in the beginning and 528.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 06:13:15,592 INFO L168 Benchmark]: Boogie Preprocessor took 21.21 ms. Allocated memory is still 561.5 MB. Free memory was 528.9 MB in the beginning and 527.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 06:13:15,593 INFO L168 Benchmark]: RCFGBuilder took 323.49 ms. Allocated memory is still 561.5 MB. Free memory was 527.6 MB in the beginning and 513.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 50.3 GB. [2020-06-22 06:13:15,595 INFO L168 Benchmark]: BlockEncodingV2 took 101.84 ms. Allocated memory is still 561.5 MB. Free memory was 513.0 MB in the beginning and 507.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 50.3 GB. [2020-06-22 06:13:15,595 INFO L168 Benchmark]: TraceAbstraction took 186.02 ms. Allocated memory is still 561.5 MB. Free memory was 506.9 MB in the beginning and 496.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 06:13:15,596 INFO L168 Benchmark]: BuchiAutomizer took 18962.76 ms. Allocated memory was 561.5 MB in the beginning and 628.6 MB in the end (delta: 67.1 MB). Free memory was 496.1 MB in the beginning and 463.7 MB in the end (delta: 32.4 MB). Peak memory consumption was 99.5 MB. Max. memory is 50.3 GB. [2020-06-22 06:13:15,602 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 19 locations, 24 edges - StatisticsResult: Encoded RCFG 15 locations, 22 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 305.47 ms. Allocated memory was 514.9 MB in the beginning and 561.5 MB in the end (delta: 46.7 MB). Free memory was 439.7 MB in the beginning and 531.1 MB in the end (delta: -91.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.60 ms. Allocated memory is still 561.5 MB. Free memory was 531.1 MB in the beginning and 528.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 21.21 ms. Allocated memory is still 561.5 MB. Free memory was 528.9 MB in the beginning and 527.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 323.49 ms. Allocated memory is still 561.5 MB. Free memory was 527.6 MB in the beginning and 513.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 101.84 ms. Allocated memory is still 561.5 MB. Free memory was 513.0 MB in the beginning and 507.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 186.02 ms. Allocated memory is still 561.5 MB. Free memory was 506.9 MB in the beginning and 496.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 18962.76 ms. Allocated memory was 561.5 MB in the beginning and 628.6 MB in the end (delta: 67.1 MB). Free memory was 496.1 MB in the beginning and 463.7 MB in the end (delta: 32.4 MB). Peak memory consumption was 99.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 7 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has 2-nested ranking function (if -1 * \old(c) + 8 > 0 then 1 else 0), (if -1 * \old(c) + 8 > 0 then -1 * \old(c) + 8 else -1 * \old(c) + \old(b)) and consists of 14 locations. One nondeterministic module has affine ranking function -1 * \result + -1 * c + 9 and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 16.5s. Construction of modules took 0.2s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 26 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 53 SDtfs, 196 SDslu, 96 SDs, 0 SdLazy, 250 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital28 mio100 ax100 hnf101 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf100 smp100 tf104 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 3 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 15.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 06:12:52.329 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 06:13:15.843 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check