./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64424a1c8c8e4b1dfa6f86e97492679716532609 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:47:57,338 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:47:57,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:47:57,351 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:47:57,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:47:57,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:47:57,354 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:47:57,356 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:47:57,358 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:47:57,359 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:47:57,360 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:47:57,360 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:47:57,361 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:47:57,362 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:47:57,363 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:47:57,364 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:47:57,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:47:57,367 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:47:57,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:47:57,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:47:57,372 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:47:57,373 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:47:57,376 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:47:57,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:47:57,377 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:47:57,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:47:57,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:47:57,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:47:57,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:47:57,382 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:47:57,382 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:47:57,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:47:57,383 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:47:57,383 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:47:57,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:47:57,386 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:47:57,386 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:47:57,403 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:47:57,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:47:57,404 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:47:57,404 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:47:57,405 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:47:57,405 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:47:57,405 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:47:57,406 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:47:57,406 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:47:57,406 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:47:57,406 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:47:57,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:47:57,407 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:47:57,407 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:47:57,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:47:57,407 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:47:57,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:47:57,407 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:47:57,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:47:57,409 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:47:57,409 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:47:57,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:47:57,410 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:47:57,410 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:47:57,410 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:47:57,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:47:57,411 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:47:57,411 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:47:57,412 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:47:57,412 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:47:57,412 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:47:57,413 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:47:57,414 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64424a1c8c8e4b1dfa6f86e97492679716532609 [2019-01-14 04:47:57,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:47:57,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:47:57,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:47:57,465 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:47:57,465 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:47:57,466 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2019-01-14 04:47:57,528 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77f40336/f8ca079e50c04bf2a57594c99fd0bf7b/FLAGff5e22114 [2019-01-14 04:47:58,020 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:47:58,021 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2019-01-14 04:47:58,036 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77f40336/f8ca079e50c04bf2a57594c99fd0bf7b/FLAGff5e22114 [2019-01-14 04:47:58,358 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77f40336/f8ca079e50c04bf2a57594c99fd0bf7b [2019-01-14 04:47:58,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:47:58,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:47:58,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:47:58,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:47:58,370 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:47:58,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:47:58" (1/1) ... [2019-01-14 04:47:58,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20575267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58, skipping insertion in model container [2019-01-14 04:47:58,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:47:58" (1/1) ... [2019-01-14 04:47:58,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:47:58,427 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:47:58,707 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:47:58,724 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:47:58,784 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:47:58,804 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:47:58,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58 WrapperNode [2019-01-14 04:47:58,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:47:58,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:47:58,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:47:58,806 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:47:58,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58" (1/1) ... [2019-01-14 04:47:58,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58" (1/1) ... [2019-01-14 04:47:58,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:47:58,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:47:58,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:47:58,959 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:47:58,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58" (1/1) ... [2019-01-14 04:47:58,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58" (1/1) ... [2019-01-14 04:47:58,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58" (1/1) ... [2019-01-14 04:47:58,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58" (1/1) ... [2019-01-14 04:47:58,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58" (1/1) ... [2019-01-14 04:47:58,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58" (1/1) ... [2019-01-14 04:47:59,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58" (1/1) ... [2019-01-14 04:47:59,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:47:59,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:47:59,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:47:59,010 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:47:59,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:47:59,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:47:59,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:48:00,319 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:48:00,320 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-14 04:48:00,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:48:00 BoogieIcfgContainer [2019-01-14 04:48:00,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:48:00,322 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:48:00,322 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:48:00,325 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:48:00,326 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:48:00,326 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:47:58" (1/3) ... [2019-01-14 04:48:00,328 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1193281d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:48:00, skipping insertion in model container [2019-01-14 04:48:00,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:48:00,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:58" (2/3) ... [2019-01-14 04:48:00,328 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1193281d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:48:00, skipping insertion in model container [2019-01-14 04:48:00,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:48:00,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:48:00" (3/3) ... [2019-01-14 04:48:00,331 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2019-01-14 04:48:00,383 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:48:00,383 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:48:00,383 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:48:00,384 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:48:00,384 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:48:00,384 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:48:00,384 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:48:00,385 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:48:00,385 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:48:00,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states. [2019-01-14 04:48:00,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-01-14 04:48:00,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:48:00,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:48:00,454 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:00,455 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:00,455 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:48:00,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states. [2019-01-14 04:48:00,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-01-14 04:48:00,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:48:00,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:48:00,466 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:00,467 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:00,476 INFO L794 eck$LassoCheckResult]: Stem: 95#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 9#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 49#L301true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 28#L304-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 85#L314true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 61#L317-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 115#L327true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 93#L330-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 10#L340true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 8#L343-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 56#L353true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 31#L356-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 89#L366true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 83#L369-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 134#L379true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 136#L379-1true init_#res := init_~tmp___5~0; 98#L476true main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 44#L587-2true [2019-01-14 04:48:00,479 INFO L796 eck$LassoCheckResult]: Loop: 44#L587-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 69#L124true assume !(0 != ~mode1~0 % 256); 63#L152true assume !(~r1~0 < 2); 62#L152-1true ~mode1~0 := 1; 68#L124-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 3#L175true assume !(0 != ~mode2~0 % 256); 130#L203true assume !(~r2~0 < 2); 129#L203-1true ~mode2~0 := 1; 14#L175-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 82#L226true assume !(0 != ~mode3~0 % 256); 41#L254true assume !(~r3~0 < 2); 38#L254-1true ~mode3~0 := 1; 74#L226-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 102#L484true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 104#L484-1true check_#res := check_~tmp~1; 43#L532true main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 59#L617true assume !(0 == assert_~arg % 256); 30#L612true main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 44#L587-2true [2019-01-14 04:48:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2018329694, now seen corresponding path program 1 times [2019-01-14 04:48:00,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:00,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:00,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:00,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:48:00,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:48:00,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:48:00,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:48:00,792 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:48:00,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:00,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1456859310, now seen corresponding path program 1 times [2019-01-14 04:48:00,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:00,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:00,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:00,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:48:00,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:48:00,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:48:00,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:48:00,924 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:48:00,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:48:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:48:00,943 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 4 states. [2019-01-14 04:48:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:48:01,336 INFO L93 Difference]: Finished difference Result 136 states and 231 transitions. [2019-01-14 04:48:01,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:48:01,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 231 transitions. [2019-01-14 04:48:01,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-01-14 04:48:01,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 129 states and 201 transitions. [2019-01-14 04:48:01,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-01-14 04:48:01,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-01-14 04:48:01,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 201 transitions. [2019-01-14 04:48:01,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:48:01,360 INFO L706 BuchiCegarLoop]: Abstraction has 129 states and 201 transitions. [2019-01-14 04:48:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 201 transitions. [2019-01-14 04:48:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-14 04:48:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 04:48:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 201 transitions. [2019-01-14 04:48:01,401 INFO L729 BuchiCegarLoop]: Abstraction has 129 states and 201 transitions. [2019-01-14 04:48:01,401 INFO L609 BuchiCegarLoop]: Abstraction has 129 states and 201 transitions. [2019-01-14 04:48:01,401 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:48:01,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 201 transitions. [2019-01-14 04:48:01,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-01-14 04:48:01,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:48:01,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:48:01,407 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:01,408 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:01,409 INFO L794 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 296#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 297#L301 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 336#L304-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 338#L314 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 303#L317-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 380#L327 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 377#L330-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 298#L340 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 294#L343-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 295#L353 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 343#L356-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 344#L366 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 328#L369-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 397#L379 assume ~id1~0 != ~id2~0; 394#L380 assume ~id1~0 != ~id3~0; 325#L381 assume ~id2~0 != ~id3~0; 326#L382 assume ~id1~0 >= 0; 387#L383 assume ~id2~0 >= 0; 319#L384 assume ~id3~0 >= 0; 320#L385 assume 0 == ~r1~0; 375#L386 assume 0 == ~r2~0; 290#L387 assume 0 == ~r3~0; 291#L388 assume ~max1~0 == ~id1~0; 370#L389 assume ~max2~0 == ~id2~0; 371#L390 assume ~max3~0 == ~id3~0; 392#L391 assume 0 == ~st1~0; 323#L392 assume 0 == ~st2~0; 324#L393 assume 0 == ~st3~0; 386#L394 assume 0 == ~nl1~0; 317#L395 assume 0 == ~nl2~0; 318#L396 assume 0 == ~nl3~0; 374#L397 assume 0 == ~mode1~0 % 256; 288#L398 assume 0 == ~mode2~0 % 256; 289#L399 assume 0 == ~mode3~0 % 256; 368#L400 assume 0 != ~newmax1~0 % 256; 369#L401 assume 0 != ~newmax2~0 % 256; 390#L402 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 391#L379-1 init_#res := init_~tmp___5~0; 403#L476 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 340#L587-2 [2019-01-14 04:48:01,409 INFO L796 eck$LassoCheckResult]: Loop: 340#L587-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 363#L124 assume !(0 != ~mode1~0 % 256); 382#L152 assume !(~r1~0 < 2); 313#L152-1 ~mode1~0 := 1; 381#L124-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 285#L175 assume !(0 != ~mode2~0 % 256); 286#L203 assume !(~r2~0 < 2); 352#L203-1 ~mode2~0 := 1; 310#L175-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 311#L226 assume !(0 != ~mode3~0 % 256); 359#L254 assume !(~r3~0 < 2); 355#L254-1 ~mode3~0 := 1; 356#L226-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 388#L484 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 309#L484-1 check_#res := check_~tmp~1; 361#L532 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 362#L617 assume !(0 == assert_~arg % 256); 339#L612 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 340#L587-2 [2019-01-14 04:48:01,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:01,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1427963683, now seen corresponding path program 1 times [2019-01-14 04:48:01,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:01,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:01,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:01,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:48:01,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:48:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:48:01,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:01,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1456859310, now seen corresponding path program 2 times [2019-01-14 04:48:01,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:01,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:01,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:01,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:48:01,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:48:01,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:48:01,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:48:01,739 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:48:01,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:48:01,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:48:01,740 INFO L87 Difference]: Start difference. First operand 129 states and 201 transitions. cyclomatic complexity: 73 Second operand 5 states. [2019-01-14 04:48:01,911 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:48:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:48:02,140 INFO L93 Difference]: Finished difference Result 132 states and 203 transitions. [2019-01-14 04:48:02,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:48:02,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 203 transitions. [2019-01-14 04:48:02,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-01-14 04:48:02,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 129 states and 193 transitions. [2019-01-14 04:48:02,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-01-14 04:48:02,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-01-14 04:48:02,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 193 transitions. [2019-01-14 04:48:02,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:48:02,159 INFO L706 BuchiCegarLoop]: Abstraction has 129 states and 193 transitions. [2019-01-14 04:48:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 193 transitions. [2019-01-14 04:48:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-14 04:48:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 04:48:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 193 transitions. [2019-01-14 04:48:02,178 INFO L729 BuchiCegarLoop]: Abstraction has 129 states and 193 transitions. [2019-01-14 04:48:02,178 INFO L609 BuchiCegarLoop]: Abstraction has 129 states and 193 transitions. [2019-01-14 04:48:02,178 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:48:02,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 193 transitions. [2019-01-14 04:48:02,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-01-14 04:48:02,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:48:02,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:48:02,183 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:02,184 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:02,184 INFO L794 eck$LassoCheckResult]: Stem: 675#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 572#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 573#L301 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 608#L304-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 610#L314 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 576#L317-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 653#L327 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 650#L330-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 574#L340 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 567#L343-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 568#L353 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 615#L356-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 616#L366 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 601#L369-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 670#L379 assume ~id1~0 != ~id2~0; 667#L380 assume ~id1~0 != ~id3~0; 597#L381 assume ~id2~0 != ~id3~0; 598#L382 assume ~id1~0 >= 0; 660#L383 assume ~id2~0 >= 0; 591#L384 assume ~id3~0 >= 0; 592#L385 assume 0 == ~r1~0; 648#L386 assume 0 == ~r2~0; 563#L387 assume 0 == ~r3~0; 564#L388 assume ~max1~0 == ~id1~0; 643#L389 assume ~max2~0 == ~id2~0; 644#L390 assume ~max3~0 == ~id3~0; 665#L391 assume 0 == ~st1~0; 595#L392 assume 0 == ~st2~0; 596#L393 assume 0 == ~st3~0; 659#L394 assume 0 == ~nl1~0; 589#L395 assume 0 == ~nl2~0; 590#L396 assume 0 == ~nl3~0; 647#L397 assume 0 == ~mode1~0 % 256; 561#L398 assume 0 == ~mode2~0 % 256; 562#L399 assume 0 == ~mode3~0 % 256; 641#L400 assume 0 != ~newmax1~0 % 256; 642#L401 assume 0 != ~newmax2~0 % 256; 663#L402 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 664#L379-1 init_#res := init_~tmp___5~0; 676#L476 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 612#L587-2 [2019-01-14 04:48:02,184 INFO L796 eck$LassoCheckResult]: Loop: 612#L587-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 636#L124 assume !(0 != ~mode1~0 % 256); 655#L152 assume !(~r1~0 < 2); 585#L152-1 ~mode1~0 := 1; 654#L124-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 558#L175 assume !(0 != ~mode2~0 % 256); 559#L203 assume !(~r2~0 < 2); 624#L203-1 ~mode2~0 := 1; 582#L175-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 583#L226 assume !(0 != ~mode3~0 % 256); 632#L254 assume !(~r3~0 < 2); 626#L254-1 ~mode3~0 := 1; 627#L226-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 661#L484 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 657#L485 assume ~st1~0 + ~nl1~0 <= 1; 580#L486 assume ~st2~0 + ~nl2~0 <= 1; 581#L487 assume ~st3~0 + ~nl3~0 <= 1; 637#L488 assume ~r1~0 >= 2; 631#L492 assume ~r1~0 < 2; 577#L497 assume ~r1~0 >= 2; 578#L502 assume ~r1~0 < 2;check_~tmp~1 := 1; 628#L484-1 check_#res := check_~tmp~1; 634#L532 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 635#L617 assume !(0 == assert_~arg % 256); 611#L612 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 612#L587-2 [2019-01-14 04:48:02,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:02,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1427963683, now seen corresponding path program 2 times [2019-01-14 04:48:02,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:02,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:02,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:02,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:48:02,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:48:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:48:02,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1625632719, now seen corresponding path program 1 times [2019-01-14 04:48:02,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:02,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:02,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:48:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:48:02,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:48:02,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:48:02,315 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:48:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:48:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:48:02,316 INFO L87 Difference]: Start difference. First operand 129 states and 193 transitions. cyclomatic complexity: 65 Second operand 3 states. [2019-01-14 04:48:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:48:02,447 INFO L93 Difference]: Finished difference Result 187 states and 280 transitions. [2019-01-14 04:48:02,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:48:02,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 280 transitions. [2019-01-14 04:48:02,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2019-01-14 04:48:02,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 187 states and 280 transitions. [2019-01-14 04:48:02,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2019-01-14 04:48:02,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2019-01-14 04:48:02,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 280 transitions. [2019-01-14 04:48:02,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:48:02,456 INFO L706 BuchiCegarLoop]: Abstraction has 187 states and 280 transitions. [2019-01-14 04:48:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 280 transitions. [2019-01-14 04:48:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-01-14 04:48:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-14 04:48:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 280 transitions. [2019-01-14 04:48:02,472 INFO L729 BuchiCegarLoop]: Abstraction has 187 states and 280 transitions. [2019-01-14 04:48:02,472 INFO L609 BuchiCegarLoop]: Abstraction has 187 states and 280 transitions. [2019-01-14 04:48:02,472 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:48:02,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 280 transitions. [2019-01-14 04:48:02,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2019-01-14 04:48:02,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:48:02,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:48:02,480 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:02,480 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:02,480 INFO L794 eck$LassoCheckResult]: Stem: 1000#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 894#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 895#L301 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 929#L304-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 931#L314 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 898#L317-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 974#L327 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 971#L330-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 896#L340 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 889#L343-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 890#L353 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 936#L356-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 941#L366 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 922#L369-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 992#L379 assume ~id1~0 != ~id2~0; 989#L380 assume ~id1~0 != ~id3~0; 918#L381 assume ~id2~0 != ~id3~0; 919#L382 assume ~id1~0 >= 0; 982#L383 assume ~id2~0 >= 0; 912#L384 assume ~id3~0 >= 0; 913#L385 assume 0 == ~r1~0; 969#L386 assume 0 == ~r2~0; 885#L387 assume 0 == ~r3~0; 886#L388 assume ~max1~0 == ~id1~0; 964#L389 assume ~max2~0 == ~id2~0; 965#L390 assume ~max3~0 == ~id3~0; 988#L391 assume 0 == ~st1~0; 916#L392 assume 0 == ~st2~0; 917#L393 assume 0 == ~st3~0; 981#L394 assume 0 == ~nl1~0; 910#L395 assume 0 == ~nl2~0; 911#L396 assume 0 == ~nl3~0; 968#L397 assume 0 == ~mode1~0 % 256; 883#L398 assume 0 == ~mode2~0 % 256; 884#L399 assume 0 == ~mode3~0 % 256; 962#L400 assume 0 != ~newmax1~0 % 256; 963#L401 assume 0 != ~newmax2~0 % 256; 985#L402 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 986#L379-1 init_#res := init_~tmp___5~0; 1001#L476 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 1002#L587-2 [2019-01-14 04:48:02,480 INFO L796 eck$LassoCheckResult]: Loop: 1002#L587-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 1062#L124 assume !(0 != ~mode1~0 % 256); 1061#L152 assume ~r1~0 < 2; 908#L153 assume !(0 != ~ep12~0 % 256); 905#L153-1 assume !(0 != ~ep13~0 % 256); 906#L152-1 ~mode1~0 := 1; 1051#L124-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 1049#L175 assume !(0 != ~mode2~0 % 256); 1050#L203 assume !(~r2~0 < 2); 1037#L203-1 ~mode2~0 := 1; 1036#L175-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 1035#L226 assume !(0 != ~mode3~0 % 256); 1027#L254 assume !(~r3~0 < 2); 1020#L254-1 ~mode3~0 := 1; 1019#L226-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1018#L484 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1017#L485 assume ~st1~0 + ~nl1~0 <= 1; 1016#L486 assume ~st2~0 + ~nl2~0 <= 1; 1015#L487 assume ~st3~0 + ~nl3~0 <= 1; 1014#L488 assume !(~r1~0 >= 2); 950#L491 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 951#L492 assume ~r1~0 < 2; 1060#L497 assume !(~r1~0 >= 2); 997#L501 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 998#L502 assume ~r1~0 < 2;check_~tmp~1 := 1; 1066#L484-1 check_#res := check_~tmp~1; 1065#L532 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1064#L617 assume !(0 == assert_~arg % 256); 1063#L612 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 1002#L587-2 [2019-01-14 04:48:02,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1427963683, now seen corresponding path program 3 times [2019-01-14 04:48:02,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:02,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:02,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:48:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:48:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:48:02,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1898401798, now seen corresponding path program 1 times [2019-01-14 04:48:02,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:02,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:02,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:02,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:48:02,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:48:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:48:02,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:02,622 INFO L82 PathProgramCache]: Analyzing trace with hash 891214872, now seen corresponding path program 1 times [2019-01-14 04:48:02,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:02,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:02,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:02,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:48:02,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:48:02,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:48:02,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:48:03,286 WARN L181 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2019-01-14 04:48:03,471 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-01-14 04:48:03,482 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:48:03,483 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:48:03,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:48:03,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:48:03,484 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:48:03,484 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:48:03,485 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:48:03,485 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:48:03,485 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2019-01-14 04:48:03,485 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:48:03,485 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:48:03,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:03,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,533 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:48:04,534 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2019-01-14 04:48:04,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:48:04,540 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:48:04,552 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:48:04,552 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=-256} Honda state: {~ep12~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2019-01-14 04:48:04,574 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:48:04,574 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2019-01-14 04:48:04,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:48:04,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:48:04,755 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:48:04,757 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:48:04,757 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:48:04,757 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:48:04,758 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:48:04,758 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:48:04,758 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:48:04,758 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:48:04,758 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:48:04,758 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2019-01-14 04:48:04,758 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:48:04,758 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:48:04,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:04,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:05,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:05,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:05,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:05,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:05,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:05,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:05,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:05,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:05,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:05,385 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-14 04:48:05,999 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-14 04:48:06,418 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:48:06,423 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:48:06,425 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 [2019-01-14 04:48:06,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,436 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 [2019-01-14 04:48:06,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,444 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 [2019-01-14 04:48:06,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:06,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:06,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,453 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 [2019-01-14 04:48:06,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,460 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 [2019-01-14 04:48:06,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,466 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 [2019-01-14 04:48:06,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:06,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:06,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,475 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 [2019-01-14 04:48:06,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,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 [2019-01-14 04:48:06,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,489 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 [2019-01-14 04:48:06,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,498 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 [2019-01-14 04:48:06,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,507 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 [2019-01-14 04:48:06,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,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 [2019-01-14 04:48:06,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,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 [2019-01-14 04:48:06,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,531 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 [2019-01-14 04:48:06,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,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 [2019-01-14 04:48:06,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:06,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:06,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,546 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 [2019-01-14 04:48:06,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:06,557 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 [2019-01-14 04:48:06,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:06,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:06,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:06,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:06,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:06,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:06,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:06,564 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:48:06,566 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:48:06,566 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:48:06,569 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:48:06,569 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:48:06,570 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:48:06,570 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2019-01-14 04:48:06,571 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:48:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:06,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:48:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:06,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:48:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:48:06,825 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:48:06,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 280 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-01-14 04:48:06,956 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 280 transitions. cyclomatic complexity: 94. Second operand 3 states. Result 321 states and 490 transitions. Complement of second has 4 states. [2019-01-14 04:48:06,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:48:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:48:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2019-01-14 04:48:06,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 193 transitions. Stem has 40 letters. Loop has 29 letters. [2019-01-14 04:48:06,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:48:06,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 193 transitions. Stem has 69 letters. Loop has 29 letters. [2019-01-14 04:48:06,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:48:06,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 193 transitions. Stem has 40 letters. Loop has 58 letters. [2019-01-14 04:48:06,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:48:06,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 321 states and 490 transitions. [2019-01-14 04:48:06,981 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:48:06,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 321 states to 0 states and 0 transitions. [2019-01-14 04:48:06,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:48:06,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:48:06,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:48:06,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:48:06,984 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:06,984 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:06,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:48:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:48:06,987 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:48:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:48:06,987 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:48:06,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:48:06,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:48:06,988 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:48:06,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:48:06,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:48:06,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:48:06,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:48:06,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:48:06,989 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:06,989 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:06,994 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:06,994 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:48:06,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:48:06,996 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:48:06,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:48:07,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:48:07 BoogieIcfgContainer [2019-01-14 04:48:07,008 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:48:07,008 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:48:07,008 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:48:07,009 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:48:07,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:48:00" (3/4) ... [2019-01-14 04:48:07,015 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:48:07,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:48:07,019 INFO L168 Benchmark]: Toolchain (without parser) took 8655.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 951.4 MB in the beginning and 978.2 MB in the end (delta: -26.8 MB). Peak memory consumption was 171.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:07,021 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:48:07,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.81 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:07,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 152.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:07,025 INFO L168 Benchmark]: Boogie Preprocessor took 50.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:48:07,027 INFO L168 Benchmark]: RCFGBuilder took 1311.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:07,029 INFO L168 Benchmark]: BuchiAutomizer took 6686.29 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.0 GB in the beginning and 978.2 MB in the end (delta: 71.4 MB). Peak memory consumption was 153.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:07,031 INFO L168 Benchmark]: Witness Printer took 9.33 ms. Allocated memory is still 1.2 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:48:07,037 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 439.81 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 152.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1311.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6686.29 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.0 GB in the beginning and 978.2 MB in the end (delta: 71.4 MB). Peak memory consumption was 153.2 MB. Max. memory is 11.5 GB. * Witness Printer took 9.33 ms. Allocated memory is still 1.2 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 5.0s. Construction of modules took 0.5s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 187 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 811 SDtfs, 268 SDslu, 1309 SDs, 0 SdLazy, 39 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital148 mio100 ax124 hnf104 lsp19 ukn100 mio100 lsp100 div128 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...