./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/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 3381374679dc4a7458d725215e8a6e295cc6e6a1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:41:43,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:41:43,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:41:43,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:41:43,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:41:43,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:41:43,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:41:43,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:41:43,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:41:43,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:41:43,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:41:43,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:41:43,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:41:43,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:41:43,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:41:43,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:41:43,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:41:43,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:41:43,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:41:43,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:41:43,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:41:43,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:41:43,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:41:43,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:41:43,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:41:43,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:41:43,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:41:43,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:41:43,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:41:43,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:41:43,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:41:43,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:41:43,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:41:43,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:41:43,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:41:43,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:41:43,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:41:43,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:41:43,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:41:43,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:41:43,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:41:43,495 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:41:43,509 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:41:43,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:41:43,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:41:43,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:41:43,511 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:41:43,511 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:41:43,511 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:41:43,511 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:41:43,512 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:41:43,512 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:41:43,512 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:41:43,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:41:43,513 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:41:43,513 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:41:43,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:41:43,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:41:43,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:41:43,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:41:43,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:41:43,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:41:43,514 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:41:43,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:41:43,515 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:41:43,515 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:41:43,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:41:43,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:41:43,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:41:43,516 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:41:43,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:41:43,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:41:43,517 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:41:43,518 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:41:43,518 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_68cdf8d7-89d6-426d-890a-0d1ce06b9399/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 -> 3381374679dc4a7458d725215e8a6e295cc6e6a1 [2019-11-15 23:41:43,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:41:43,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:41:43,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:41:43,556 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:41:43,556 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:41:43,557 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-11-15 23:41:43,605 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/bin/uautomizer/data/bbcf1a378/b73c79832e864e6c93a54bb799f1e2ad/FLAG1e4e7b593 [2019-11-15 23:41:44,049 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:41:44,049 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-11-15 23:41:44,062 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/bin/uautomizer/data/bbcf1a378/b73c79832e864e6c93a54bb799f1e2ad/FLAG1e4e7b593 [2019-11-15 23:41:44,398 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/bin/uautomizer/data/bbcf1a378/b73c79832e864e6c93a54bb799f1e2ad [2019-11-15 23:41:44,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:41:44,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:41:44,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:41:44,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:41:44,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:41:44,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:41:44" (1/1) ... [2019-11-15 23:41:44,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ed864e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44, skipping insertion in model container [2019-11-15 23:41:44,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:41:44" (1/1) ... [2019-11-15 23:41:44,415 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:41:44,458 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:41:44,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:41:44,728 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:41:44,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:41:44,835 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:41:44,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44 WrapperNode [2019-11-15 23:41:44,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:41:44,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:41:44,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:41:44,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:41:44,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44" (1/1) ... [2019-11-15 23:41:44,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44" (1/1) ... [2019-11-15 23:41:44,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:41:44,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:41:44,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:41:44,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:41:44,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44" (1/1) ... [2019-11-15 23:41:44,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44" (1/1) ... [2019-11-15 23:41:44,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44" (1/1) ... [2019-11-15 23:41:44,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44" (1/1) ... [2019-11-15 23:41:44,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44" (1/1) ... [2019-11-15 23:41:44,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44" (1/1) ... [2019-11-15 23:41:44,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44" (1/1) ... [2019-11-15 23:41:44,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:41:44,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:41:44,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:41:44,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:41:44,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/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 23:41:45,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:41:45,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:41:45,775 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:41:45,776 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-15 23:41:45,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:41:45 BoogieIcfgContainer [2019-11-15 23:41:45,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:41:45,777 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:41:45,778 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:41:45,781 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:41:45,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:41:45,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:41:44" (1/3) ... [2019-11-15 23:41:45,782 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a69ab24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:41:45, skipping insertion in model container [2019-11-15 23:41:45,783 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:41:45,783 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:44" (2/3) ... [2019-11-15 23:41:45,783 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a69ab24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:41:45, skipping insertion in model container [2019-11-15 23:41:45,784 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:41:45,784 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:41:45" (3/3) ... [2019-11-15 23:41:45,786 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-11-15 23:41:45,825 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:41:45,825 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:41:45,825 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:41:45,825 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:41:45,825 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:41:45,826 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:41:45,826 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:41:45,826 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:41:45,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states. [2019-11-15 23:41:45,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2019-11-15 23:41:45,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:41:45,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:41:45,876 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:45,876 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:45,876 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:41:45,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states. [2019-11-15 23:41:45,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2019-11-15 23:41:45,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:41:45,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:41:45,885 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:45,885 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:45,891 INFO L791 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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;~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]; 12#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 9#L274true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 116#L277-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 50#L287true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 40#L290-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 88#L300true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 77#L303-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 105#L313true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 103#L316-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 29#L326true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 15#L329-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 53#L339true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 49#L342-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 93#L352true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 96#L352-1true init_#res := init_~tmp___5~0; 113#L437true main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 84#L545-2true [2019-11-15 23:41:45,892 INFO L793 eck$LassoCheckResult]: Loop: 84#L545-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 17#L120true assume !(0 != ~mode1~0 % 256); 108#L145true assume !(~r1~0 < 2); 106#L145-1true ~mode1~0 := 1; 16#L120-2true havoc node2_#t~ite2, node2_#t~ite3; 56#L163true assume !(0 != ~mode2~0 % 256); 36#L188true assume !(~r2~0 < 2); 34#L188-1true ~mode2~0 := 1; 55#L163-2true havoc node3_#t~ite4, node3_#t~ite5; 104#L206true assume !(0 != ~mode3~0 % 256); 83#L231true assume !(~r3~0 < 2); 82#L231-1true ~mode3~0 := 1; 101#L206-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 119#L445true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 121#L445-1true check_#res := check_~tmp~1; 60#L493true main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 97#L575true assume !(0 == assert_~arg % 256); 78#L570true main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 84#L545-2true [2019-11-15 23:41:45,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:45,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2018347568, now seen corresponding path program 1 times [2019-11-15 23:41:45,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:45,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941536522] [2019-11-15 23:41:45,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:45,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:45,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:46,110 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 23:41:46,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941536522] [2019-11-15 23:41:46,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:46,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:41:46,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223677666] [2019-11-15 23:41:46,116 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:41:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:46,116 INFO L82 PathProgramCache]: Analyzing trace with hash 980302415, now seen corresponding path program 1 times [2019-11-15 23:41:46,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:46,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525716288] [2019-11-15 23:41:46,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:46,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:46,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:46,245 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 23:41:46,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525716288] [2019-11-15 23:41:46,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:46,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:41:46,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127494652] [2019-11-15 23:41:46,247 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:41:46,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:46,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:46,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:46,264 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 4 states. [2019-11-15 23:41:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:46,339 INFO L93 Difference]: Finished difference Result 124 states and 210 transitions. [2019-11-15 23:41:46,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:46,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 210 transitions. [2019-11-15 23:41:46,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-11-15 23:41:46,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 117 states and 183 transitions. [2019-11-15 23:41:46,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2019-11-15 23:41:46,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2019-11-15 23:41:46,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 183 transitions. [2019-11-15 23:41:46,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:41:46,355 INFO L688 BuchiCegarLoop]: Abstraction has 117 states and 183 transitions. [2019-11-15 23:41:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 183 transitions. [2019-11-15 23:41:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-11-15 23:41:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 23:41:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2019-11-15 23:41:46,391 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 183 transitions. [2019-11-15 23:41:46,391 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 183 transitions. [2019-11-15 23:41:46,391 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:41:46,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 183 transitions. [2019-11-15 23:41:46,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-11-15 23:41:46,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:41:46,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:41:46,395 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] [2019-11-15 23:41:46,395 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:46,396 INFO L791 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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;~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]; 279#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 274#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 275#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 340#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 327#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 328#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 310#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 366#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 345#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 308#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 282#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 284#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 273#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 339#L352 assume ~id1~0 != ~id2~0; 337#L353 assume ~id1~0 != ~id3~0; 270#L354 assume ~id2~0 != ~id3~0; 271#L355 assume ~id1~0 >= 0; 311#L356 assume ~id2~0 >= 0; 312#L357 assume ~id3~0 >= 0; 365#L358 assume 0 == ~r1~0; 306#L359 assume 0 == ~r2~0; 307#L360 assume 0 == ~r3~0; 343#L361 assume ~max1~0 == ~id1~0; 299#L362 assume ~max2~0 == ~id2~0; 300#L363 assume ~max3~0 == ~id3~0; 336#L364 assume 0 == ~st1~0; 268#L365 assume 0 == ~st2~0; 269#L366 assume 0 == ~st3~0; 333#L367 assume 0 == ~nl1~0; 334#L368 assume 0 == ~nl2~0; 364#L369 assume 0 == ~nl3~0; 304#L370 assume 0 == ~mode1~0 % 256; 305#L371 assume 0 == ~mode2~0 % 256; 341#L372 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 342#L352-1 init_#res := init_~tmp___5~0; 373#L437 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 368#L545-2 [2019-11-15 23:41:46,396 INFO L793 eck$LassoCheckResult]: Loop: 368#L545-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 287#L120 assume !(0 != ~mode1~0 % 256); 288#L145 assume !(~r1~0 < 2); 278#L145-1 ~mode1~0 := 1; 285#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 286#L163 assume !(0 != ~mode2~0 % 256); 318#L188 assume !(~r2~0 < 2); 313#L188-1 ~mode2~0 := 1; 314#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 346#L206 assume !(0 != ~mode3~0 % 256); 370#L231 assume !(~r3~0 < 2); 317#L231-1 ~mode3~0 := 1; 369#L206-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 374#L445 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 325#L445-1 check_#res := check_~tmp~1; 350#L493 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 351#L575 assume !(0 == assert_~arg % 256); 367#L570 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 368#L545-2 [2019-11-15 23:41:46,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:46,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1347795084, now seen corresponding path program 1 times [2019-11-15 23:41:46,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:46,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516704913] [2019-11-15 23:41:46,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:46,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:46,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:41:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:41:46,537 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:41:46,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:46,539 INFO L82 PathProgramCache]: Analyzing trace with hash 980302415, now seen corresponding path program 2 times [2019-11-15 23:41:46,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:46,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371044664] [2019-11-15 23:41:46,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:46,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:46,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:46,645 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 23:41:46,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371044664] [2019-11-15 23:41:46,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:46,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:41:46,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683550205] [2019-11-15 23:41:46,646 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:41:46,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:46,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:41:46,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:41:46,647 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. cyclomatic complexity: 67 Second operand 5 states. [2019-11-15 23:41:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:46,739 INFO L93 Difference]: Finished difference Result 120 states and 185 transitions. [2019-11-15 23:41:46,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:41:46,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 185 transitions. [2019-11-15 23:41:46,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-11-15 23:41:46,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 117 states and 175 transitions. [2019-11-15 23:41:46,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2019-11-15 23:41:46,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2019-11-15 23:41:46,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 175 transitions. [2019-11-15 23:41:46,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:41:46,745 INFO L688 BuchiCegarLoop]: Abstraction has 117 states and 175 transitions. [2019-11-15 23:41:46,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 175 transitions. [2019-11-15 23:41:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-11-15 23:41:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 23:41:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2019-11-15 23:41:46,761 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 175 transitions. [2019-11-15 23:41:46,761 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 175 transitions. [2019-11-15 23:41:46,761 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:41:46,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 175 transitions. [2019-11-15 23:41:46,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-11-15 23:41:46,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:41:46,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:41:46,766 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] [2019-11-15 23:41:46,767 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:46,767 INFO L791 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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;~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]; 528#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 523#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 524#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 588#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 575#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 576#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 559#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 615#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 593#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 557#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 531#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 533#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 522#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 587#L352 assume ~id1~0 != ~id2~0; 585#L353 assume ~id1~0 != ~id3~0; 519#L354 assume ~id2~0 != ~id3~0; 520#L355 assume ~id1~0 >= 0; 560#L356 assume ~id2~0 >= 0; 561#L357 assume ~id3~0 >= 0; 614#L358 assume 0 == ~r1~0; 555#L359 assume 0 == ~r2~0; 556#L360 assume 0 == ~r3~0; 591#L361 assume ~max1~0 == ~id1~0; 548#L362 assume ~max2~0 == ~id2~0; 549#L363 assume ~max3~0 == ~id3~0; 584#L364 assume 0 == ~st1~0; 517#L365 assume 0 == ~st2~0; 518#L366 assume 0 == ~st3~0; 581#L367 assume 0 == ~nl1~0; 582#L368 assume 0 == ~nl2~0; 613#L369 assume 0 == ~nl3~0; 553#L370 assume 0 == ~mode1~0 % 256; 554#L371 assume 0 == ~mode2~0 % 256; 589#L372 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 590#L352-1 init_#res := init_~tmp___5~0; 622#L437 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 617#L545-2 [2019-11-15 23:41:46,767 INFO L793 eck$LassoCheckResult]: Loop: 617#L545-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 536#L120 assume !(0 != ~mode1~0 % 256); 537#L145 assume !(~r1~0 < 2); 527#L145-1 ~mode1~0 := 1; 534#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 535#L163 assume !(0 != ~mode2~0 % 256); 567#L188 assume !(~r2~0 < 2); 562#L188-1 ~mode2~0 := 1; 563#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 594#L206 assume !(0 != ~mode3~0 % 256); 619#L231 assume !(~r3~0 < 2); 566#L231-1 ~mode3~0 := 1; 618#L206-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 623#L445 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 609#L446 assume ~st1~0 + ~nl1~0 <= 1; 573#L447 assume ~st2~0 + ~nl2~0 <= 1; 574#L448 assume ~st3~0 + ~nl3~0 <= 1; 604#L449 assume ~r1~0 >= 2; 539#L453 assume ~r1~0 < 2; 540#L458 assume ~r1~0 >= 2; 571#L463 assume ~r1~0 < 2;check_~tmp~1 := 1; 596#L445-1 check_#res := check_~tmp~1; 599#L493 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 600#L575 assume !(0 == assert_~arg % 256); 616#L570 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 617#L545-2 [2019-11-15 23:41:46,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:46,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1347795084, now seen corresponding path program 2 times [2019-11-15 23:41:46,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:46,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720142223] [2019-11-15 23:41:46,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:46,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:46,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:41:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:41:46,863 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:41:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:46,864 INFO L82 PathProgramCache]: Analyzing trace with hash 14333785, now seen corresponding path program 1 times [2019-11-15 23:41:46,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:46,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928943922] [2019-11-15 23:41:46,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:46,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:46,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:46,887 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 23:41:46,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928943922] [2019-11-15 23:41:46,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:46,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:41:46,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516374963] [2019-11-15 23:41:46,888 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:41:46,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:46,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:41:46,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:41:46,888 INFO L87 Difference]: Start difference. First operand 117 states and 175 transitions. cyclomatic complexity: 59 Second operand 3 states. [2019-11-15 23:41:46,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:46,934 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-11-15 23:41:46,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:41:46,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 252 transitions. [2019-11-15 23:41:46,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2019-11-15 23:41:46,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 169 states and 252 transitions. [2019-11-15 23:41:46,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2019-11-15 23:41:46,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2019-11-15 23:41:46,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 252 transitions. [2019-11-15 23:41:46,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:41:46,940 INFO L688 BuchiCegarLoop]: Abstraction has 169 states and 252 transitions. [2019-11-15 23:41:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 252 transitions. [2019-11-15 23:41:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-11-15 23:41:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 23:41:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2019-11-15 23:41:46,959 INFO L711 BuchiCegarLoop]: Abstraction has 169 states and 252 transitions. [2019-11-15 23:41:46,959 INFO L591 BuchiCegarLoop]: Abstraction has 169 states and 252 transitions. [2019-11-15 23:41:46,961 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:41:46,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 252 transitions. [2019-11-15 23:41:46,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2019-11-15 23:41:46,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:41:46,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:41:46,970 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] [2019-11-15 23:41:46,970 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:46,970 INFO L791 eck$LassoCheckResult]: Stem: 912#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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;~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]; 821#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 816#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 817#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 881#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 867#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 868#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 851#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 907#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 886#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 849#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 824#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 826#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 815#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 880#L352 assume ~id1~0 != ~id2~0; 878#L353 assume ~id1~0 != ~id3~0; 812#L354 assume ~id2~0 != ~id3~0; 813#L355 assume ~id1~0 >= 0; 852#L356 assume ~id2~0 >= 0; 853#L357 assume ~id3~0 >= 0; 906#L358 assume 0 == ~r1~0; 847#L359 assume 0 == ~r2~0; 848#L360 assume 0 == ~r3~0; 884#L361 assume ~max1~0 == ~id1~0; 840#L362 assume ~max2~0 == ~id2~0; 841#L363 assume ~max3~0 == ~id3~0; 877#L364 assume 0 == ~st1~0; 810#L365 assume 0 == ~st2~0; 811#L366 assume 0 == ~st3~0; 873#L367 assume 0 == ~nl1~0; 874#L368 assume 0 == ~nl2~0; 905#L369 assume 0 == ~nl3~0; 845#L370 assume 0 == ~mode1~0 % 256; 846#L371 assume 0 == ~mode2~0 % 256; 882#L372 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 883#L352-1 init_#res := init_~tmp___5~0; 917#L437 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 923#L545-2 [2019-11-15 23:41:46,971 INFO L793 eck$LassoCheckResult]: Loop: 923#L545-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 965#L120 assume !(0 != ~mode1~0 % 256); 964#L145 assume ~r1~0 < 2; 896#L146 assume !(0 != ~ep12~0 % 256); 835#L146-2 assume !(0 != ~ep13~0 % 256); 820#L145-1 ~mode1~0 := 1; 827#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 828#L163 assume !(0 != ~mode2~0 % 256); 859#L188 assume !(~r2~0 < 2); 854#L188-1 ~mode2~0 := 1; 855#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 887#L206 assume !(0 != ~mode3~0 % 256); 920#L231 assume !(~r3~0 < 2); 936#L231-1 ~mode3~0 := 1; 934#L206-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 932#L445 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 931#L446 assume ~st1~0 + ~nl1~0 <= 1; 930#L447 assume ~st2~0 + ~nl2~0 <= 1; 929#L448 assume ~st3~0 + ~nl3~0 <= 1; 928#L449 assume !(~r1~0 >= 2); 875#L452 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 876#L453 assume ~r1~0 < 2; 933#L458 assume !(~r1~0 >= 2); 913#L462 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 914#L463 assume ~r1~0 < 2;check_~tmp~1 := 1; 969#L445-1 check_#res := check_~tmp~1; 968#L493 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 967#L575 assume !(0 == assert_~arg % 256); 966#L570 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 923#L545-2 [2019-11-15 23:41:46,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:46,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1347795084, now seen corresponding path program 3 times [2019-11-15 23:41:46,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:46,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129571736] [2019-11-15 23:41:46,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:46,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:46,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:41:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:41:47,028 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:41:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:47,028 INFO L82 PathProgramCache]: Analyzing trace with hash -67119798, now seen corresponding path program 1 times [2019-11-15 23:41:47,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:47,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200374288] [2019-11-15 23:41:47,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:47,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:47,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:41:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:41:47,063 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:41:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:47,066 INFO L82 PathProgramCache]: Analyzing trace with hash -708835657, now seen corresponding path program 1 times [2019-11-15 23:41:47,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:47,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327446168] [2019-11-15 23:41:47,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:47,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:47,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:47,160 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 23:41:47,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327446168] [2019-11-15 23:41:47,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:47,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:41:47,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075080022] [2019-11-15 23:41:47,487 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 100 [2019-11-15 23:41:47,659 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-15 23:41:47,670 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:41:47,670 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:41:47,670 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:41:47,671 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:41:47,671 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:41:47,671 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:41:47,671 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:41:47,671 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:41:47,672 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2019-11-15 23:41:47,672 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:41:47,672 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:41:47,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 23:41:47,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 23:41:47,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:41:47,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 23:41:47,737 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 23:41:47,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 23:41:47,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:41:47,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 23:41:47,770 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 23:41:47,779 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 23:41:47,783 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 23:41:47,785 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 23:41:47,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:41:47,790 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 23:41:47,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:41:47,798 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 23:41:47,804 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 23:41:47,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 23:41:47,835 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 23:41:47,837 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 23:41:47,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:41:47,842 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 23:41:47,843 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 23:41:47,846 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 23:41:47,849 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 23:41:47,862 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 23:41:48,446 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:41:48,450 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/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 23:41:48,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:41:48,470 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:41:48,485 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:41:48,486 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=-256} Honda state: {~ep12~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:41:48,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:41:48,493 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68cdf8d7-89d6-426d-890a-0d1ce06b9399/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:41:48,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:41:48,564 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:41:48,725 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:41:48,727 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:41:48,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:41:48,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:41:48,727 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:41:48,727 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:41:48,727 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:41:48,727 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:41:48,727 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:41:48,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2019-11-15 23:41:48,728 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:41:48,728 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:41:48,731 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 23:41:48,740 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 23:41:48,745 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 23:41:48,748 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 23:41:48,759 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 23:41:48,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 23:41:48,762 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 23:41:48,764 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 23:41:48,767 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 23:41:48,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 23:41:48,775 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 23:41:48,777 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 23:41:48,779 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 23:41:48,781 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 23:41:48,784 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 23:41:48,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:41:48,793 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 23:41:48,796 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 23:41:48,798 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 23:41:48,799 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 23:41:48,805 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 23:41:48,814 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 23:41:48,816 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 23:41:48,817 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 23:41:48,819 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 23:41:48,842 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 23:41:49,388 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:41:49,399 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:41:49,401 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 23:41:49,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,403 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,404 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,408 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 23:41:49,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,409 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,409 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,409 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,411 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,411 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,413 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 23:41:49,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,420 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:41:49,420 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:41:49,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,423 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 23:41:49,424 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,424 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,425 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,426 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,427 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,428 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 23:41:49,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,429 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,431 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,432 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,432 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 23:41:49,433 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,433 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,433 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,434 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,434 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,435 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 23:41:49,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,436 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,436 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,437 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,437 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,437 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,441 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 23:41:49,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,443 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,443 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,448 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:41:49,449 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:41:49,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,451 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 23:41:49,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,452 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,452 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,453 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,453 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,455 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 23:41:49,456 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,456 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,456 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,456 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,456 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,456 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,457 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,458 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 23:41:49,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,459 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,459 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,460 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,460 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,462 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 23:41:49,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,463 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,464 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,465 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,465 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 23:41:49,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,466 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,467 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,467 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,468 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 23:41:49,469 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,469 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,471 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:41:49,471 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:41:49,474 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,474 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 23:41:49,475 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,475 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,475 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,475 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,475 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,476 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,476 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:41:49,480 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 23:41:49,480 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:41:49,481 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:41:49,481 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:41:49,481 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:41:49,481 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:41:49,481 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:41:49,482 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:41:49,484 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:41:49,486 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:41:49,486 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:41:49,488 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:41:49,488 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:41:49,488 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:41:49,489 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2019-11-15 23:41:49,491 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:41:49,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:49,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:41:49,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:49,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:41:49,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:49,629 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 23:41:49,636 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 23:41:49,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 169 states and 252 transitions. cyclomatic complexity: 84 Second operand 3 states. [2019-11-15 23:41:49,706 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 169 states and 252 transitions. cyclomatic complexity: 84. Second operand 3 states. Result 288 states and 437 transitions. Complement of second has 4 states. [2019-11-15 23:41:49,707 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 23:41:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:41:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2019-11-15 23:41:49,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 175 transitions. Stem has 37 letters. Loop has 29 letters. [2019-11-15 23:41:49,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:41:49,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 175 transitions. Stem has 66 letters. Loop has 29 letters. [2019-11-15 23:41:49,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:41:49,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 175 transitions. Stem has 37 letters. Loop has 58 letters. [2019-11-15 23:41:49,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:41:49,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 288 states and 437 transitions. [2019-11-15 23:41:49,724 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:41:49,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 288 states to 0 states and 0 transitions. [2019-11-15 23:41:49,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:41:49,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:41:49,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:41:49,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:41:49,726 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:41:49,726 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:41:49,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:49,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:41:49,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:41:49,727 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-15 23:41:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:49,727 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 23:41:49,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:41:49,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 23:41:49,728 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:41:49,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:41:49,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:41:49,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:41:49,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:41:49,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:41:49,729 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:41:49,730 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:41:49,730 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:41:49,730 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:41:49,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:41:49,730 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:41:49,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:41:49,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:41:49 BoogieIcfgContainer [2019-11-15 23:41:49,737 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:41:49,737 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:41:49,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:41:49,738 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:41:49,738 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:41:45" (3/4) ... [2019-11-15 23:41:49,741 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:41:49,742 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:41:49,743 INFO L168 Benchmark]: Toolchain (without parser) took 5341.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.4 MB in the beginning and 867.5 MB in the end (delta: 78.9 MB). Peak memory consumption was 222.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:49,744 INFO L168 Benchmark]: CDTParser took 0.22 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 23:41:49,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:49,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.00 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 23:41:49,746 INFO L168 Benchmark]: Boogie Preprocessor took 36.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:41:49,750 INFO L168 Benchmark]: RCFGBuilder took 851.83 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:49,751 INFO L168 Benchmark]: BuchiAutomizer took 3959.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 867.5 MB in the end (delta: 209.0 MB). Peak memory consumption was 209.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:49,751 INFO L168 Benchmark]: Witness Printer took 4.16 ms. Allocated memory is still 1.2 GB. Free memory is still 867.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:41:49,757 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.22 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 433.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.00 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 36.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 851.83 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3959.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 867.5 MB in the end (delta: 209.0 MB). Peak memory consumption was 209.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.16 ms. Allocated memory is still 1.2 GB. Free memory is still 867.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 169 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 736 SDtfs, 347 SDslu, 1183 SDs, 0 SdLazy, 39 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax125 hnf105 lsp20 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...