./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer --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-cad4683 [2019-10-22 08:55:49,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:49,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:49,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:49,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:49,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:49,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:49,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:49,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:49,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:49,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:49,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:49,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:49,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:49,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:49,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:49,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:49,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:49,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:49,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:49,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:49,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:49,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:49,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:49,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:49,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:49,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:49,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:49,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:49,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:49,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:49,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:49,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:49,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:49,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:49,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:49,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:49,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:49,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:49,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:49,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:49,618 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:55:49,631 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:49,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:49,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:49,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:49,632 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:49,633 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:49,633 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:49,633 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:49,633 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:49,633 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:49,633 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:49,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:49,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:49,637 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:49,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:49,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:49,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:49,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:49,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:49,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:49,638 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:49,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:49,639 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:49,639 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:49,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:49,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:49,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:49,639 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:49,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:49,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:49,640 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:49,641 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:49,641 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer 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-10-22 08:55:49,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:49,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:49,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:49,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:49,678 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:49,679 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-10-22 08:55:49,719 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/data/08462fb90/67137c02d2d44217ad55edb7505ec316/FLAG1aad16299 [2019-10-22 08:55:50,129 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:50,130 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-10-22 08:55:50,141 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/data/08462fb90/67137c02d2d44217ad55edb7505ec316/FLAG1aad16299 [2019-10-22 08:55:50,513 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/data/08462fb90/67137c02d2d44217ad55edb7505ec316 [2019-10-22 08:55:50,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:50,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:50,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:50,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:50,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:50,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:50" (1/1) ... [2019-10-22 08:55:50,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b10412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50, skipping insertion in model container [2019-10-22 08:55:50,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:50" (1/1) ... [2019-10-22 08:55:50,533 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:50,572 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:50,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:50,838 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:50,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:50,928 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:50,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50 WrapperNode [2019-10-22 08:55:50,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:50,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:50,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:50,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:50,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50" (1/1) ... [2019-10-22 08:55:50,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50" (1/1) ... [2019-10-22 08:55:50,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:50,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:50,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:50,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:50,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50" (1/1) ... [2019-10-22 08:55:50,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50" (1/1) ... [2019-10-22 08:55:50,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50" (1/1) ... [2019-10-22 08:55:50,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50" (1/1) ... [2019-10-22 08:55:50,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50" (1/1) ... [2019-10-22 08:55:51,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50" (1/1) ... [2019-10-22 08:55:51,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50" (1/1) ... [2019-10-22 08:55:51,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:51,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:51,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:51,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:51,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/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-10-22 08:55:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:51,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:51,789 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:51,789 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-10-22 08:55:51,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:51 BoogieIcfgContainer [2019-10-22 08:55:51,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:51,791 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:51,791 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:51,793 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:51,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:51,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:50" (1/3) ... [2019-10-22 08:55:51,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29b69f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:51, skipping insertion in model container [2019-10-22 08:55:51,794 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:51,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:50" (2/3) ... [2019-10-22 08:55:51,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29b69f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:51, skipping insertion in model container [2019-10-22 08:55:51,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:51,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:51" (3/3) ... [2019-10-22 08:55:51,796 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-10-22 08:55:51,832 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:51,832 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:51,832 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:51,833 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:51,833 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:51,833 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:51,833 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:51,833 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:51,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states. [2019-10-22 08:55:51,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-10-22 08:55:51,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:51,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:51,883 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:51,883 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:51,884 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:51,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states. [2019-10-22 08:55:51,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-10-22 08:55:51,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:51,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:51,891 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:51,892 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:51,899 INFO L791 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-10-22 08:55:51,902 INFO L793 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-10-22 08:55:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:51,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2018329694, now seen corresponding path program 1 times [2019-10-22 08:55:51,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:51,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498704066] [2019-10-22 08:55:51,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:51,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:51,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:52,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498704066] [2019-10-22 08:55:52,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:52,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:52,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548994908] [2019-10-22 08:55:52,173 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1456859310, now seen corresponding path program 1 times [2019-10-22 08:55:52,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333636889] [2019-10-22 08:55:52,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:52,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333636889] [2019-10-22 08:55:52,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:52,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:52,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680592328] [2019-10-22 08:55:52,297 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:52,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:52,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:52,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:52,313 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 4 states. [2019-10-22 08:55:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:52,379 INFO L93 Difference]: Finished difference Result 136 states and 231 transitions. [2019-10-22 08:55:52,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:52,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 231 transitions. [2019-10-22 08:55:52,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-10-22 08:55:52,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 129 states and 201 transitions. [2019-10-22 08:55:52,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-10-22 08:55:52,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-10-22 08:55:52,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 201 transitions. [2019-10-22 08:55:52,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:52,394 INFO L688 BuchiCegarLoop]: Abstraction has 129 states and 201 transitions. [2019-10-22 08:55:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 201 transitions. [2019-10-22 08:55:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-10-22 08:55:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-22 08:55:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 201 transitions. [2019-10-22 08:55:52,424 INFO L711 BuchiCegarLoop]: Abstraction has 129 states and 201 transitions. [2019-10-22 08:55:52,425 INFO L591 BuchiCegarLoop]: Abstraction has 129 states and 201 transitions. [2019-10-22 08:55:52,425 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:52,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 201 transitions. [2019-10-22 08:55:52,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-10-22 08:55:52,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:52,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:52,433 INFO L849 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-10-22 08:55:52,433 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:52,434 INFO L791 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-10-22 08:55:52,434 INFO L793 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-10-22 08:55:52,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1427963683, now seen corresponding path program 1 times [2019-10-22 08:55:52,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908831805] [2019-10-22 08:55:52,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,574 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:52,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1456859310, now seen corresponding path program 2 times [2019-10-22 08:55:52,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913743014] [2019-10-22 08:55:52,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:52,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913743014] [2019-10-22 08:55:52,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:52,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:52,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155681668] [2019-10-22 08:55:52,648 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:52,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:52,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:52,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:52,648 INFO L87 Difference]: Start difference. First operand 129 states and 201 transitions. cyclomatic complexity: 73 Second operand 5 states. [2019-10-22 08:55:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:52,709 INFO L93 Difference]: Finished difference Result 132 states and 203 transitions. [2019-10-22 08:55:52,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:52,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 203 transitions. [2019-10-22 08:55:52,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-10-22 08:55:52,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 129 states and 193 transitions. [2019-10-22 08:55:52,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-10-22 08:55:52,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-10-22 08:55:52,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 193 transitions. [2019-10-22 08:55:52,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:52,720 INFO L688 BuchiCegarLoop]: Abstraction has 129 states and 193 transitions. [2019-10-22 08:55:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 193 transitions. [2019-10-22 08:55:52,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-10-22 08:55:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-22 08:55:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 193 transitions. [2019-10-22 08:55:52,725 INFO L711 BuchiCegarLoop]: Abstraction has 129 states and 193 transitions. [2019-10-22 08:55:52,725 INFO L591 BuchiCegarLoop]: Abstraction has 129 states and 193 transitions. [2019-10-22 08:55:52,726 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:52,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 193 transitions. [2019-10-22 08:55:52,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-10-22 08:55:52,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:52,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:52,728 INFO L849 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-10-22 08:55:52,728 INFO L850 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-10-22 08:55:52,729 INFO L791 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-10-22 08:55:52,729 INFO L793 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-10-22 08:55:52,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1427963683, now seen corresponding path program 2 times [2019-10-22 08:55:52,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306454816] [2019-10-22 08:55:52,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,791 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:52,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1625632719, now seen corresponding path program 1 times [2019-10-22 08:55:52,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566476362] [2019-10-22 08:55:52,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:52,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566476362] [2019-10-22 08:55:52,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:52,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:52,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663586360] [2019-10-22 08:55:52,818 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:52,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:52,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:52,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:52,819 INFO L87 Difference]: Start difference. First operand 129 states and 193 transitions. cyclomatic complexity: 65 Second operand 3 states. [2019-10-22 08:55:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:52,876 INFO L93 Difference]: Finished difference Result 187 states and 280 transitions. [2019-10-22 08:55:52,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:52,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 280 transitions. [2019-10-22 08:55:52,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2019-10-22 08:55:52,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 187 states and 280 transitions. [2019-10-22 08:55:52,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2019-10-22 08:55:52,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2019-10-22 08:55:52,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 280 transitions. [2019-10-22 08:55:52,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:52,881 INFO L688 BuchiCegarLoop]: Abstraction has 187 states and 280 transitions. [2019-10-22 08:55:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 280 transitions. [2019-10-22 08:55:52,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-10-22 08:55:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-22 08:55:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 280 transitions. [2019-10-22 08:55:52,889 INFO L711 BuchiCegarLoop]: Abstraction has 187 states and 280 transitions. [2019-10-22 08:55:52,889 INFO L591 BuchiCegarLoop]: Abstraction has 187 states and 280 transitions. [2019-10-22 08:55:52,889 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:55:52,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 280 transitions. [2019-10-22 08:55:52,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2019-10-22 08:55:52,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:52,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:52,892 INFO L849 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-10-22 08:55:52,892 INFO L850 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-10-22 08:55:52,892 INFO L791 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-10-22 08:55:52,892 INFO L793 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-10-22 08:55:52,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1427963683, now seen corresponding path program 3 times [2019-10-22 08:55:52,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192893524] [2019-10-22 08:55:52,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,942 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1898401798, now seen corresponding path program 1 times [2019-10-22 08:55:52,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627473110] [2019-10-22 08:55:52,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,961 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:52,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,962 INFO L82 PathProgramCache]: Analyzing trace with hash 891214872, now seen corresponding path program 1 times [2019-10-22 08:55:52,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375869839] [2019-10-22 08:55:52,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:53,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375869839] [2019-10-22 08:55:53,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:53,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:53,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494703932] [2019-10-22 08:55:53,300 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2019-10-22 08:55:53,443 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-10-22 08:55:53,457 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:53,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:53,458 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:53,458 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:53,458 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:55:53,458 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:53,458 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:53,459 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:53,461 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2019-10-22 08:55:53,462 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:53,462 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:53,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,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-10-22 08:55:53,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,102 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:54,103 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:54,111 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:54,111 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:54,126 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:55:54,127 INFO L440 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 /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/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-10-22 08:55:54,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:55:54,139 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba35c511-4cb2-4569-a964-04446578b25e/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:55:54,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:55:54,161 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:54,306 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:55:54,308 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:54,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:54,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:54,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:54,308 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:54,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:54,309 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:54,309 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:54,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2019-10-22 08:55:54,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:54,309 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:54,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,837 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:54,846 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:54,848 INFO L120 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-10-22 08:55:54,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,852 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,854 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,856 INFO L120 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-10-22 08:55:54,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,859 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,859 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,859 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,859 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,860 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,860 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,862 INFO L120 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-10-22 08:55:54,866 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,868 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:54,868 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:54,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,871 INFO L120 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-10-22 08:55:54,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,872 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,873 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,880 INFO L120 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-10-22 08:55:54,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,881 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,882 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,883 INFO L120 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-10-22 08:55:54,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,883 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,883 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,884 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:54,884 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:54,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,886 INFO L120 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-10-22 08:55:54,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,886 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,887 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,887 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,887 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,889 INFO L120 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-10-22 08:55:54,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,890 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,890 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,890 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,891 INFO L120 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-10-22 08:55:54,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,892 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,892 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,892 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,893 INFO L120 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-10-22 08:55:54,894 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,894 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,894 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,894 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,894 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,894 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,894 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,895 INFO L120 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-10-22 08:55:54,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,896 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,896 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,897 INFO L120 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-10-22 08:55:54,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,897 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,898 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,898 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,899 INFO L120 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-10-22 08:55:54,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,899 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,900 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,900 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,901 INFO L120 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-10-22 08:55:54,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,901 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,902 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,902 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,903 INFO L120 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-10-22 08:55:54,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,904 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:54,904 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:54,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,906 INFO L120 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-10-22 08:55:54,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,906 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,907 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,907 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:54,909 INFO L120 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-10-22 08:55:54,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:54,909 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:54,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:54,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:54,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:54,910 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:54,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:54,911 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:54,912 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:54,912 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:55:54,914 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:54,914 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:55:54,914 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:54,915 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2019-10-22 08:55:54,916 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:55:54,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:55,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:55,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:55,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:55,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:55,059 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-10-22 08:55:55,060 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 280 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-10-22 08:55:55,135 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-10-22 08:55:55,136 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-10-22 08:55:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2019-10-22 08:55:55,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 193 transitions. Stem has 40 letters. Loop has 29 letters. [2019-10-22 08:55:55,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:55,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 193 transitions. Stem has 69 letters. Loop has 29 letters. [2019-10-22 08:55:55,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:55,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 193 transitions. Stem has 40 letters. Loop has 58 letters. [2019-10-22 08:55:55,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:55,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 321 states and 490 transitions. [2019-10-22 08:55:55,149 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:55,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 321 states to 0 states and 0 transitions. [2019-10-22 08:55:55,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:55,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:55,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:55,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:55,154 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:55,154 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:55,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:55,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:55,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:55,155 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-10-22 08:55:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:55,155 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-10-22 08:55:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:55:55,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-10-22 08:55:55,156 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:55,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:55:55,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:55,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:55,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:55,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:55,156 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:55,156 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:55,156 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:55,156 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:55:55,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:55,157 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:55,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:55:55,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:55 BoogieIcfgContainer [2019-10-22 08:55:55,166 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:55,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:55,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:55,166 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:55,167 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:51" (3/4) ... [2019-10-22 08:55:55,170 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:55,170 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:55,172 INFO L168 Benchmark]: Toolchain (without parser) took 4652.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 947.1 MB in the beginning and 1.2 GB in the end (delta: -223.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:55,173 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:55,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:55,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:55,176 INFO L168 Benchmark]: Boogie Preprocessor took 33.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:55,177 INFO L168 Benchmark]: RCFGBuilder took 782.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:55,177 INFO L168 Benchmark]: BuchiAutomizer took 3375.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:55,179 INFO L168 Benchmark]: Witness Printer took 4.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:55,182 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -203.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 782.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3375.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. 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 3.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital148 mio100 ax124 hnf104 lsp19 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...