./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.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/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/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 188aaf9001adccb91c68b27294cad7318066e2a0 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:27:15,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:27:15,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:27:15,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:27:15,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:27:15,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:27:15,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:27:15,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:27:15,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:27:15,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:27:15,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:27:15,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:27:15,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:27:15,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:27:15,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:27:15,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:27:15,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:27:15,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:27:15,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:27:15,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:27:15,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:27:15,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:27:15,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:27:15,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:27:15,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:27:15,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:27:15,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:27:15,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:27:15,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:27:15,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:27:15,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:27:15,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:27:15,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:27:15,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:27:15,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:27:15,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:27:15,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:27:15,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:27:15,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:27:15,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:27:15,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:27:15,120 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:27:15,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:27:15,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:27:15,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:27:15,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:27:15,137 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:27:15,137 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:27:15,137 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:27:15,137 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:27:15,138 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:27:15,138 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:27:15,138 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:27:15,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:27:15,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:27:15,139 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:27:15,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:27:15,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:27:15,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:27:15,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:27:15,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:27:15,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:27:15,140 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:27:15,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:27:15,140 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:27:15,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:27:15,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:27:15,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:27:15,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:27:15,141 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:27:15,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:27:15,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:27:15,142 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:27:15,142 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:27:15,143 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/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/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 -> 188aaf9001adccb91c68b27294cad7318066e2a0 [2019-11-15 20:27:15,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:27:15,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:27:15,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:27:15,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:27:15,198 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:27:15,199 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2019-11-15 20:27:15,270 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/bin/uautomizer/data/f867daa1e/c0a4f4751fc2481b87da5555c9ad99e1/FLAG1d1a8af54 [2019-11-15 20:27:15,701 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:27:15,702 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2019-11-15 20:27:15,723 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/bin/uautomizer/data/f867daa1e/c0a4f4751fc2481b87da5555c9ad99e1/FLAG1d1a8af54 [2019-11-15 20:27:16,221 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/bin/uautomizer/data/f867daa1e/c0a4f4751fc2481b87da5555c9ad99e1 [2019-11-15 20:27:16,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:27:16,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:27:16,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:27:16,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:27:16,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:27:16,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:27:16" (1/1) ... [2019-11-15 20:27:16,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10497a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16, skipping insertion in model container [2019-11-15 20:27:16,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:27:16" (1/1) ... [2019-11-15 20:27:16,239 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:27:16,285 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:27:16,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:27:16,635 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:27:16,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:27:16,745 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:27:16,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16 WrapperNode [2019-11-15 20:27:16,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:27:16,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:27:16,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:27:16,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:27:16,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16" (1/1) ... [2019-11-15 20:27:16,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16" (1/1) ... [2019-11-15 20:27:16,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:27:16,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:27:16,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:27:16,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:27:16,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16" (1/1) ... [2019-11-15 20:27:16,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16" (1/1) ... [2019-11-15 20:27:16,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16" (1/1) ... [2019-11-15 20:27:16,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16" (1/1) ... [2019-11-15 20:27:16,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16" (1/1) ... [2019-11-15 20:27:16,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16" (1/1) ... [2019-11-15 20:27:16,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16" (1/1) ... [2019-11-15 20:27:16,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:27:16,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:27:16,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:27:16,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:27:16,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/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-11-15 20:27:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:27:17,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:27:18,316 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:27:18,316 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-11-15 20:27:18,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:27:18 BoogieIcfgContainer [2019-11-15 20:27:18,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:27:18,318 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:27:18,318 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:27:18,323 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:27:18,324 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:27:18,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:27:16" (1/3) ... [2019-11-15 20:27:18,325 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f536290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:27:18, skipping insertion in model container [2019-11-15 20:27:18,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:27:18,326 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:16" (2/3) ... [2019-11-15 20:27:18,326 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f536290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:27:18, skipping insertion in model container [2019-11-15 20:27:18,326 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:27:18,326 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:27:18" (3/3) ... [2019-11-15 20:27:18,328 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2019-11-15 20:27:18,381 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:27:18,382 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:27:18,382 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:27:18,383 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:27:18,384 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:27:18,384 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:27:18,384 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:27:18,384 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:27:18,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 289 states. [2019-11-15 20:27:18,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2019-11-15 20:27:18,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:18,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:18,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:18,466 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] [2019-11-15 20:27:18,466 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:27:18,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 289 states. [2019-11-15 20:27:18,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2019-11-15 20:27:18,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:18,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:18,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:18,481 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] [2019-11-15 20:27:18,490 INFO L791 eck$LassoCheckResult]: Stem: 113#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;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~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;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~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;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 10#L-1true havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 174#L436true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 196#L447true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 88#L457true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 87#L468true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 141#L478true assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 139#L489true init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 50#L499true assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 48#L510true init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 248#L520true assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 246#L531true init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 165#L541true assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 164#L552true init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 218#L562true assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 217#L573true init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 131#L583true assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 130#L594true init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 33#L604true assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 32#L615true init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 231#L625true assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 229#L636true init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 290#L646true assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 289#L657true init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 204#L667true assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 203#L678true init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 118#L688true assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 117#L699true init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 18#L709true assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 17#L720true init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 79#L730true assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 77#L741true init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 271#L751true assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 270#L762true init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 170#L772true assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 187#L783true init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 83#L793true assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 82#L804true init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 136#L814true assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 134#L825true init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 41#L835true assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 39#L846true init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 238#L856true assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 237#L867true init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 157#L877true assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 156#L888true init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 211#L898true assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 210#L909true init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 125#L919true assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 124#L930true init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 25#L940true assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 28#L940-1true init_#res := init_~tmp___23~0; 36#L1061true main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;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;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 64#L1198-2true [2019-11-15 20:27:18,491 INFO L793 eck$LassoCheckResult]: Loop: 64#L1198-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 264#L151true assume !(0 != ~mode1~0 % 256); 179#L183true assume !(~r1~0 < 3); 176#L183-1true ~mode1~0 := 1; 261#L151-2true havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 96#L204true assume !(0 != ~mode2~0 % 256); 148#L236true assume !(~r2~0 < 3); 143#L236-1true ~mode2~0 := 1; 89#L204-2true havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 53#L257true assume !(0 != ~mode3~0 % 256); 250#L289true assume !(~r3~0 < 3); 247#L289-1true ~mode3~0 := 1; 47#L257-2true havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 160#L310true assume !(0 != ~mode4~0 % 256); 213#L342true assume !(~r4~0 < 3); 214#L342-1true ~mode4~0 := 1; 285#L310-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_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;~p24_old~0 := ~p24_new~0;~p24_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;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 190#L1069true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 193#L1069-1true check_#res := check_~tmp~1; 63#L1121true main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 256#L1241true assume !(0 == assert_~arg % 256); 226#L1236true main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 64#L1198-2true [2019-11-15 20:27:18,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:18,496 INFO L82 PathProgramCache]: Analyzing trace with hash 15460348, now seen corresponding path program 1 times [2019-11-15 20:27:18,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:18,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134012308] [2019-11-15 20:27:18,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:18,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:18,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:27:18,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134012308] [2019-11-15 20:27:18,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:18,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:27:18,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566593021] [2019-11-15 20:27:18,889 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:27:18,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:18,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1018255023, now seen corresponding path program 1 times [2019-11-15 20:27:18,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:18,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915308007] [2019-11-15 20:27:18,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:18,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:18,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:27:19,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915308007] [2019-11-15 20:27:19,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:19,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:27:19,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43821231] [2019-11-15 20:27:19,008 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:27:19,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:19,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:27:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:27:19,027 INFO L87 Difference]: Start difference. First operand 289 states. Second operand 5 states. [2019-11-15 20:27:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:19,153 INFO L93 Difference]: Finished difference Result 293 states and 519 transitions. [2019-11-15 20:27:19,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:27:19,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 293 states and 519 transitions. [2019-11-15 20:27:19,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-11-15 20:27:19,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 293 states to 284 states and 502 transitions. [2019-11-15 20:27:19,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 284 [2019-11-15 20:27:19,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 284 [2019-11-15 20:27:19,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 502 transitions. [2019-11-15 20:27:19,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:19,172 INFO L688 BuchiCegarLoop]: Abstraction has 284 states and 502 transitions. [2019-11-15 20:27:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 502 transitions. [2019-11-15 20:27:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2019-11-15 20:27:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-15 20:27:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 502 transitions. [2019-11-15 20:27:19,238 INFO L711 BuchiCegarLoop]: Abstraction has 284 states and 502 transitions. [2019-11-15 20:27:19,239 INFO L591 BuchiCegarLoop]: Abstraction has 284 states and 502 transitions. [2019-11-15 20:27:19,239 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:27:19,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 502 transitions. [2019-11-15 20:27:19,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-11-15 20:27:19,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:19,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:19,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:19,249 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, 1] [2019-11-15 20:27:19,249 INFO L791 eck$LassoCheckResult]: Stem: 803#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;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~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;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~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;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 615#L-1 havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 616#L436 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 771#L447 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 765#L457 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 640#L468 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 763#L478 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 708#L489 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 704#L499 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 614#L510 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 697#L520 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 695#L531 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 839#L541 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 798#L552 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 838#L562 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 605#L573 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 820#L583 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 669#L594 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 666#L604 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 664#L615 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 665#L625 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 663#L636 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 878#L646 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 761#L657 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 867#L667 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 810#L678 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 807#L688 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 635#L699 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 632#L709 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 630#L720 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 631#L730 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 626#L741 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 748#L751 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 747#L762 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 846#L772 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 759#L783 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 757#L793 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 620#L804 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 754#L814 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 689#L825 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 682#L835 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 680#L846 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 681#L856 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 677#L867 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 832#L877 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 783#L888 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 831#L898 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 816#L909 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 814#L919 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 653#L930 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 650#L940 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 643#L940-1 init_#res := init_~tmp___23~0; 657#L1061 main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;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;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 673#L1198-2 [2019-11-15 20:27:19,250 INFO L793 eck$LassoCheckResult]: Loop: 673#L1198-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 733#L151 assume !(0 != ~mode1~0 % 256); 853#L183 assume !(~r1~0 < 3); 656#L183-1 ~mode1~0 := 1; 749#L151-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 777#L204 assume !(0 != ~mode2~0 % 256); 779#L236 assume !(~r2~0 < 3); 724#L236-1 ~mode2~0 := 1; 767#L204-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 709#L257 assume !(0 != ~mode3~0 % 256); 711#L289 assume !(~r3~0 < 3); 797#L289-1 ~mode3~0 := 1; 692#L257-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 693#L310 assume !(0 != ~mode4~0 % 256); 836#L342 assume !(~r4~0 < 3); 742#L342-1 ~mode4~0 := 1; 870#L310-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_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;~p24_old~0 := ~p24_new~0;~p24_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;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 859#L1069 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 860#L1070 assume ~st1~0 + ~nl1~0 <= 1; 879#L1071 assume ~st2~0 + ~nl2~0 <= 1; 674#L1072 assume ~st3~0 + ~nl3~0 <= 1; 675#L1073 assume ~st4~0 + ~nl4~0 <= 1; 822#L1074 assume ~r1~0 >= 3; 607#L1078 assume ~r1~0 < 3; 608#L1083 assume ~r1~0 >= 3; 671#L1088 assume ~r1~0 < 3;check_~tmp~1 := 1; 736#L1069-1 check_#res := check_~tmp~1; 731#L1121 main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 732#L1241 assume !(0 == assert_~arg % 256); 876#L1236 main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 673#L1198-2 [2019-11-15 20:27:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:19,251 INFO L82 PathProgramCache]: Analyzing trace with hash 15460348, now seen corresponding path program 2 times [2019-11-15 20:27:19,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:19,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846772645] [2019-11-15 20:27:19,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:19,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:19,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:27:19,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846772645] [2019-11-15 20:27:19,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:19,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:27:19,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497774525] [2019-11-15 20:27:19,398 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:27:19,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash 459161504, now seen corresponding path program 1 times [2019-11-15 20:27:19,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:19,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372103101] [2019-11-15 20:27:19,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:19,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:19,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:27:19,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372103101] [2019-11-15 20:27:19,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:19,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:27:19,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524471911] [2019-11-15 20:27:19,433 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:27:19,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:27:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:27:19,433 INFO L87 Difference]: Start difference. First operand 284 states and 502 transitions. cyclomatic complexity: 219 Second operand 3 states. [2019-11-15 20:27:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:19,497 INFO L93 Difference]: Finished difference Result 369 states and 636 transitions. [2019-11-15 20:27:19,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:27:19,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 369 states and 636 transitions. [2019-11-15 20:27:19,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 191 [2019-11-15 20:27:19,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 369 states to 369 states and 636 transitions. [2019-11-15 20:27:19,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 369 [2019-11-15 20:27:19,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 369 [2019-11-15 20:27:19,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 369 states and 636 transitions. [2019-11-15 20:27:19,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:19,517 INFO L688 BuchiCegarLoop]: Abstraction has 369 states and 636 transitions. [2019-11-15 20:27:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states and 636 transitions. [2019-11-15 20:27:19,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2019-11-15 20:27:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-11-15 20:27:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 636 transitions. [2019-11-15 20:27:19,540 INFO L711 BuchiCegarLoop]: Abstraction has 369 states and 636 transitions. [2019-11-15 20:27:19,540 INFO L591 BuchiCegarLoop]: Abstraction has 369 states and 636 transitions. [2019-11-15 20:27:19,540 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:27:19,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 636 transitions. [2019-11-15 20:27:19,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 191 [2019-11-15 20:27:19,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:19,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:19,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:19,548 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, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:19,549 INFO L791 eck$LassoCheckResult]: Stem: 1467#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;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~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;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~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;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 1275#L-1 havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 1276#L436 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 1433#L447 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 1428#L457 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 1300#L468 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 1425#L478 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 1368#L489 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 1364#L499 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 1274#L510 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 1360#L520 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 1356#L531 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 1506#L541 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 1462#L552 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1505#L562 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 1266#L573 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 1484#L583 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 1329#L594 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 1326#L604 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 1324#L615 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 1325#L625 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 1323#L636 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 1549#L646 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 1423#L657 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 1536#L667 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 1474#L678 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 1471#L688 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 1297#L699 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 1292#L709 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 1290#L720 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 1291#L730 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 1286#L741 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 1411#L751 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 1408#L762 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 1513#L772 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 1421#L783 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 1419#L793 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 1280#L804 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 1416#L814 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 1349#L825 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 1342#L835 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 1340#L846 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 1341#L856 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 1337#L867 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 1497#L877 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 1446#L888 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 1496#L898 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 1480#L909 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 1478#L919 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 1313#L930 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 1310#L940 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 1303#L940-1 init_#res := init_~tmp___23~0; 1317#L1061 main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;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;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 1333#L1198-2 [2019-11-15 20:27:19,549 INFO L793 eck$LassoCheckResult]: Loop: 1333#L1198-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 1394#L151 assume !(0 != ~mode1~0 % 256); 1564#L183 assume ~r1~0 < 3; 1558#L184 assume !(0 != ~ep12~0 % 256); 1404#L184-2 assume !(0 != ~ep13~0 % 256); 1455#L187-1 assume !(0 != ~ep14~0 % 256); 1316#L183-1 ~mode1~0 := 1; 1410#L151-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 1439#L204 assume !(0 != ~mode2~0 % 256); 1441#L236 assume !(~r2~0 < 3); 1385#L236-1 ~mode2~0 := 1; 1426#L204-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 1369#L257 assume !(0 != ~mode3~0 % 256); 1371#L289 assume !(~r3~0 < 3); 1588#L289-1 ~mode3~0 := 1; 1587#L257-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 1583#L310 assume !(0 != ~mode4~0 % 256); 1539#L342 assume !(~r4~0 < 3); 1405#L342-1 ~mode4~0 := 1; 1576#L310-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_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;~p24_old~0 := ~p24_new~0;~p24_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;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1575#L1069 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1574#L1070 assume ~st1~0 + ~nl1~0 <= 1; 1573#L1071 assume ~st2~0 + ~nl2~0 <= 1; 1572#L1072 assume ~st3~0 + ~nl3~0 <= 1; 1571#L1073 assume ~st4~0 + ~nl4~0 <= 1; 1570#L1074 assume !(~r1~0 >= 3); 1396#L1077 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 1397#L1078 assume ~r1~0 < 3; 1566#L1083 assume !(~r1~0 >= 3); 1555#L1087 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 1556#L1088 assume ~r1~0 < 3;check_~tmp~1 := 1; 1530#L1069-1 check_#res := check_~tmp~1; 1392#L1121 main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1393#L1241 assume !(0 == assert_~arg % 256); 1547#L1236 main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 1333#L1198-2 [2019-11-15 20:27:19,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash 15460348, now seen corresponding path program 3 times [2019-11-15 20:27:19,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:19,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076116321] [2019-11-15 20:27:19,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:19,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:19,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:27:19,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076116321] [2019-11-15 20:27:19,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:19,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:27:19,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826228278] [2019-11-15 20:27:19,666 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:27:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:19,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1877171987, now seen corresponding path program 1 times [2019-11-15 20:27:19,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:19,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823700314] [2019-11-15 20:27:19,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:19,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:19,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:19,750 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:20,407 WARN L191 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 144 [2019-11-15 20:27:20,646 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-11-15 20:27:20,659 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:27:20,660 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:27:20,660 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:27:20,660 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:27:20,660 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:27:20,661 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:27:20,661 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:27:20,661 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:27:20,661 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2019-11-15 20:27:20,661 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:27:20,662 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:27:20,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:20,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:21,398 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-15 20:27:21,825 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-15 20:27:21,868 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:27:21,868 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/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-11-15 20:27:21,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:27:21,890 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_67c5cf7d-43f3-4d38-a001-2851b7a21fb8/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) [2019-11-15 20:27:21,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:27:21,905 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:27:22,048 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:27:22,049 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:27:22,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:27:22,050 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:27:22,050 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:27:22,050 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:27:22,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:27:22,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:27:22,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:27:22,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2019-11-15 20:27:22,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:27:22,050 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:27:22,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:22,523 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-15 20:27:22,862 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-15 20:27:22,967 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:27:22,971 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:27:22,973 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-11-15 20:27:22,975 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:22,975 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:22,975 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:22,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:22,976 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:22,978 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:22,978 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:22,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:22,982 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-11-15 20:27:22,982 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:22,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:22,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:22,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:22,985 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:22,985 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:22,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:22,987 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-11-15 20:27:22,988 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:22,988 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:22,988 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:22,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:22,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:22,989 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:22,989 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:22,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:22,990 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-11-15 20:27:22,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:22,991 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:22,991 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:22,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:22,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:22,992 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:22,992 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:22,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:22,993 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-11-15 20:27:22,994 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:22,994 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:22,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:22,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:22,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:22,995 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:22,995 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:22,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:22,996 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-11-15 20:27:22,996 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:22,997 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:22,997 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:22,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:22,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:22,997 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:22,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:22,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:22,999 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-11-15 20:27:22,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:22,999 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:22,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,000 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,000 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:23,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:23,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,002 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-11-15 20:27:23,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,004 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:23,004 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:23,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,007 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-11-15 20:27:23,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,008 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:23,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,009 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:23,009 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:23,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,011 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-11-15 20:27:23,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,012 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,013 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:23,014 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:23,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,019 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-11-15 20:27:23,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:23,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,021 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:23,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:23,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,023 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-11-15 20:27:23,023 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,025 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:23,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,025 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,026 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,026 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:23,026 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:23,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,027 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-11-15 20:27:23,027 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,027 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,027 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,028 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:23,028 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:23,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,031 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-11-15 20:27:23,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,031 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:23,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,031 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,031 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,032 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:23,032 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:23,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,037 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-11-15 20:27:23,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,038 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:23,038 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,038 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,044 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:23,045 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:23,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,050 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-11-15 20:27:23,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:23,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:23,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:23,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,053 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-11-15 20:27:23,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,055 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:23,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,056 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:23,056 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:23,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,058 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-11-15 20:27:23,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,059 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:23,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,060 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:23,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:23,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,062 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-11-15 20:27:23,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,062 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:23,062 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:23,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:23,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,065 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-11-15 20:27:23,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,068 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:23,068 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:23,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,073 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-11-15 20:27:23,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,075 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:23,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,076 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:23,076 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:23,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:23,079 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-11-15 20:27:23,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:23,081 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:23,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:23,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:23,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:23,082 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:23,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:23,088 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:27:23,091 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:27:23,091 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:27:23,093 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:27:23,093 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:27:23,093 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:27:23,094 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2019-11-15 20:27:23,095 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:27:23,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:23,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:27:23,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:23,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:27:23,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:27:23,293 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-11-15 20:27:23,294 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 369 states and 636 transitions. cyclomatic complexity: 268 Second operand 3 states. [2019-11-15 20:27:23,373 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 369 states and 636 transitions. cyclomatic complexity: 268. Second operand 3 states. Result 559 states and 944 transitions. Complement of second has 4 states. [2019-11-15 20:27:23,373 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-11-15 20:27:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:27:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2019-11-15 20:27:23,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 502 transitions. Stem has 53 letters. Loop has 35 letters. [2019-11-15 20:27:23,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:23,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 502 transitions. Stem has 88 letters. Loop has 35 letters. [2019-11-15 20:27:23,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:23,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 502 transitions. Stem has 53 letters. Loop has 70 letters. [2019-11-15 20:27:23,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:23,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 559 states and 944 transitions. [2019-11-15 20:27:23,387 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:27:23,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 559 states to 0 states and 0 transitions. [2019-11-15 20:27:23,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:27:23,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:27:23,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:27:23,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:23,387 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:27:23,388 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:27:23,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:23,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:27:23,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:27:23,389 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-11-15 20:27:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:23,389 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 20:27:23,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:27:23,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 20:27:23,390 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:27:23,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:27:23,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:27:23,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:27:23,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:27:23,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:23,391 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:27:23,391 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:27:23,391 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:27:23,391 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:27:23,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:27:23,392 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:27:23,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:27:23,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:27:23 BoogieIcfgContainer [2019-11-15 20:27:23,398 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:27:23,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:27:23,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:27:23,398 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:27:23,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:27:18" (3/4) ... [2019-11-15 20:27:23,402 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:27:23,402 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:27:23,404 INFO L168 Benchmark]: Toolchain (without parser) took 7179.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 934.3 MB in the beginning and 894.1 MB in the end (delta: 40.3 MB). Peak memory consumption was 237.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:23,404 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:27:23,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 934.3 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:23,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.16 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:23,406 INFO L168 Benchmark]: Boogie Preprocessor took 124.72 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:23,407 INFO L168 Benchmark]: RCFGBuilder took 1366.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:23,408 INFO L168 Benchmark]: BuchiAutomizer took 5079.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.0 GB in the beginning and 894.1 MB in the end (delta: 121.2 MB). Peak memory consumption was 176.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:23,408 INFO L168 Benchmark]: Witness Printer took 4.37 ms. Allocated memory is still 1.2 GB. Free memory is still 894.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:27:23,411 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 520.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 934.3 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.16 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 124.72 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1366.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5079.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.0 GB in the beginning and 894.1 MB in the end (delta: 121.2 MB). Peak memory consumption was 176.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.37 ms. Allocated memory is still 1.2 GB. Free memory is still 894.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 369 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1514 SDtfs, 794 SDslu, 2181 SDs, 0 SdLazy, 35 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital198 mio100 ax124 hnf105 lsp28 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 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...