./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/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 73fdf555f3f5e47d818d7f4214b9add97d75e1b5 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:11,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:11,909 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:11,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:11,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:11,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:11,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:11,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:11,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:11,925 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:11,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:11,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:11,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:11,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:11,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:11,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:11,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:11,938 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:11,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:11,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:11,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:11,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:11,947 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:11,948 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:11,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:11,949 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:11,950 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:11,950 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:11,951 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:11,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:11,952 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:11,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:11,952 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:11,952 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:11,953 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:11,953 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:11,954 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:06:11,968 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:11,968 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:11,969 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:11,969 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:11,969 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:11,969 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:11,969 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:11,969 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:11,970 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:11,970 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:11,970 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:11,970 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:11,970 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:06:11,970 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:11,970 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:11,970 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:06:11,971 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:11,972 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:11,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:11,972 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:11,973 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:06:11,973 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:11,973 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:11,973 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:11,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:11,973 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:11,973 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:11,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:11,974 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:11,974 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:11,975 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:11,975 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/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 -> 73fdf555f3f5e47d818d7f4214b9add97d75e1b5 [2018-10-27 06:06:12,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:12,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:12,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:12,013 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:12,013 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:12,014 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-10-27 06:06:12,059 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/uautomizer/data/0a90888b2/def989193ace48f0821af1869505505a/FLAG4898f71f8 [2018-10-27 06:06:12,484 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:12,484 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-10-27 06:06:12,497 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/uautomizer/data/0a90888b2/def989193ace48f0821af1869505505a/FLAG4898f71f8 [2018-10-27 06:06:12,510 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/uautomizer/data/0a90888b2/def989193ace48f0821af1869505505a [2018-10-27 06:06:12,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:12,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:12,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:12,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:12,518 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:12,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:12,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebf8acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12, skipping insertion in model container [2018-10-27 06:06:12,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:12,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:12,592 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:12,870 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:12,877 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:12,939 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:12,957 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:12,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12 WrapperNode [2018-10-27 06:06:12,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:12,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:12,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:12,959 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:12,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:13,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:13,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:13,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:13,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:13,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:13,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:13,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:13,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:13,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:13,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:13,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:13,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... [2018-10-27 06:06:13,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:13,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:13,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:13,199 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:13,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/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 [2018-10-27 06:06:13,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:13,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:15,291 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:15,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:15 BoogieIcfgContainer [2018-10-27 06:06:15,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:15,292 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:15,292 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:15,295 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:15,296 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:15,296 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:12" (1/3) ... [2018-10-27 06:06:15,297 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18afbcdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:15, skipping insertion in model container [2018-10-27 06:06:15,297 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:15,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:12" (2/3) ... [2018-10-27 06:06:15,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18afbcdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:15, skipping insertion in model container [2018-10-27 06:06:15,298 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:15,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:15" (3/3) ... [2018-10-27 06:06:15,301 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-10-27 06:06:15,357 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:15,358 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:15,358 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:15,358 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:15,358 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:15,360 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:15,360 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:15,360 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:15,360 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:15,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 310 states. [2018-10-27 06:06:15,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 [2018-10-27 06:06:15,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:15,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:15,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:15,446 INFO L867 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] [2018-10-27 06:06:15,446 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:15,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 310 states. [2018-10-27 06:06:15,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 [2018-10-27 06:06:15,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:15,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:15,473 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:15,473 INFO L867 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] [2018-10-27 06:06:15,484 INFO L793 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 119#L484true assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 131#L495true init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 21#L505true assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 19#L516true init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 237#L526true assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 236#L537true init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 295#L547true assume init_~r211~0 % 256 != 0;init_~tmp___2~0 := 1; 294#L558true init_~r212~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 202#L568true assume init_~r231~0 % 256 != 0;init_~tmp___3~0 := 1; 201#L579true init_~r232~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 100#L589true assume init_~r241~0 % 256 != 0;init_~tmp___4~0 := 1; 99#L600true init_~r242~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 8#L610true assume init_~r311~0 % 256 != 0;init_~tmp___5~0 := 1; 6#L621true init_~r312~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 61#L631true assume init_~r321~0 % 256 != 0;init_~tmp___6~0 := 1; 60#L642true init_~r322~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 280#L652true assume init_~r341~0 % 256 != 0;init_~tmp___7~0 := 1; 279#L663true init_~r342~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 180#L673true assume init_~r411~0 % 256 != 0;init_~tmp___8~0 := 1; 178#L684true init_~r412~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 78#L694true assume init_~r421~0 % 256 != 0;init_~tmp___9~0 := 1; 77#L705true init_~r422~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 139#L715true assume init_~r431~0 % 256 != 0;init_~tmp___10~0 := 1; 138#L726true init_~r432~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 44#L736true assume init_~r122~0 % 256 != 0;init_~tmp___11~0 := 1; 43#L747true init_~r123~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 262#L757true assume init_~r132~0 % 256 != 0;init_~tmp___12~0 := 1; 261#L768true init_~r133~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 168#L778true assume init_~r142~0 % 256 != 0;init_~tmp___13~0 := 1; 167#L789true init_~r143~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 228#L799true assume init_~r212~0 % 256 != 0;init_~tmp___14~0 := 1; 226#L810true init_~r213~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 112#L820true assume init_~r232~0 % 256 != 0;init_~tmp___15~0 := 1; 127#L831true init_~r233~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 15#L841true assume init_~r242~0 % 256 != 0;init_~tmp___16~0 := 1; 14#L852true init_~r243~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 66#L862true assume init_~r312~0 % 256 != 0;init_~tmp___17~0 := 1; 64#L873true init_~r313~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 285#L883true assume init_~r322~0 % 256 != 0;init_~tmp___18~0 := 1; 284#L894true init_~r323~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 186#L904true assume init_~r342~0 % 256 != 0;init_~tmp___19~0 := 1; 185#L915true init_~r343~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 84#L925true assume init_~r412~0 % 256 != 0;init_~tmp___20~0 := 1; 83#L936true init_~r413~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 150#L946true assume init_~r422~0 % 256 != 0;init_~tmp___21~0 := 1; 148#L957true init_~r423~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 53#L967true assume init_~r432~0 % 256 != 0;init_~tmp___22~0 := 1; 51#L978true init_~r433~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 272#L988true assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 274#L988-1true init_#res := init_~tmp___23~0; 310#L1125true main_#t~ret56 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 117#L1266-3true [2018-10-27 06:06:15,496 INFO L795 eck$LassoCheckResult]: Loop: 117#L1266-3true assume true; 115#L1266-1true assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 299#L156true assume !(~mode1~0 % 256 != 0); 146#L192true assume !(~r1~0 < 3); 141#L192-1true ~mode1~0 := 1; 293#L156-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 104#L220true assume !(~mode2~0 % 256 != 0); 265#L256true assume !(~r2~0 < 3); 264#L256-1true ~mode2~0 := 1; 94#L220-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 62#L284true assume !(~mode3~0 % 256 != 0); 225#L320true assume !(~r3~0 < 3); 229#L320-1true ~mode3~0 := 1; 57#L284-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 193#L348true assume !(~mode4~0 % 256 != 0); 28#L384true assume !(~r4~0 < 3); 32#L384-1true ~mode4~0 := 1; 199#L348-2true assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 5#L1133true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 12#L1133-1true check_#res := check_~tmp~1; 179#L1185true main_#t~ret57 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 17#L1309true assume !(assert_~arg % 256 == 0); 136#L1304true assume { :end_inline_assert } true;main_#t~post58 := main_~i2~0;main_~i2~0 := main_#t~post58 + 1;havoc main_#t~post58; 117#L1266-3true [2018-10-27 06:06:15,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:15,507 INFO L82 PathProgramCache]: Analyzing trace with hash 15484180, now seen corresponding path program 1 times [2018-10-27 06:06:15,509 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:15,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:15,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:15,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:15,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:15,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:06:15,835 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:15,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:15,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1130401464, now seen corresponding path program 1 times [2018-10-27 06:06:15,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:15,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:15,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:15,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:15,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:15,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:06:15,954 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:15,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:06:15,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:06:15,969 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 5 states. [2018-10-27 06:06:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:16,249 INFO L93 Difference]: Finished difference Result 314 states and 556 transitions. [2018-10-27 06:06:16,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:06:16,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 314 states and 556 transitions. [2018-10-27 06:06:16,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2018-10-27 06:06:16,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 314 states to 305 states and 539 transitions. [2018-10-27 06:06:16,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 305 [2018-10-27 06:06:16,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 305 [2018-10-27 06:06:16,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 305 states and 539 transitions. [2018-10-27 06:06:16,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:16,278 INFO L705 BuchiCegarLoop]: Abstraction has 305 states and 539 transitions. [2018-10-27 06:06:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states and 539 transitions. [2018-10-27 06:06:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-10-27 06:06:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-27 06:06:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 539 transitions. [2018-10-27 06:06:16,319 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 539 transitions. [2018-10-27 06:06:16,319 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 539 transitions. [2018-10-27 06:06:16,319 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:16,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 539 transitions. [2018-10-27 06:06:16,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2018-10-27 06:06:16,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:16,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:16,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:16,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:16,325 INFO L793 eck$LassoCheckResult]: Stem: 841#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 663#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 664#L484 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 688#L495 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 682#L505 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 680#L516 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 681#L526 assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 716#L537 init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 933#L547 assume init_~r211~0 % 256 != 0;init_~tmp___2~0 := 1; 916#L558 init_~r212~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 914#L568 assume init_~r231~0 % 256 != 0;init_~tmp___3~0 := 1; 822#L579 init_~r232~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 820#L589 assume init_~r241~0 % 256 != 0;init_~tmp___4~0 := 1; 656#L600 init_~r242~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 653#L610 assume init_~r311~0 % 256 != 0;init_~tmp___5~0 := 1; 651#L621 init_~r312~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 652#L631 assume init_~r321~0 % 256 != 0;init_~tmp___6~0 := 1; 645#L642 init_~r322~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 760#L652 assume init_~r341~0 % 256 != 0;init_~tmp___7~0 := 1; 759#L663 init_~r342~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 905#L673 assume init_~r411~0 % 256 != 0;init_~tmp___8~0 := 1; 791#L684 init_~r412~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 789#L694 assume init_~r421~0 % 256 != 0;init_~tmp___9~0 := 1; 675#L705 init_~r422~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 788#L715 assume init_~r431~0 % 256 != 0;init_~tmp___10~0 := 1; 734#L726 init_~r432~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 730#L736 assume init_~r122~0 % 256 != 0;init_~tmp___11~0 := 1; 728#L747 init_~r123~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 729#L757 assume init_~r132~0 % 256 != 0;init_~tmp___12~0 := 1; 727#L768 init_~r133~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 892#L778 assume init_~r142~0 % 256 != 0;init_~tmp___13~0 := 1; 783#L789 init_~r143~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 891#L799 assume init_~r212~0 % 256 != 0;init_~tmp___14~0 := 1; 839#L810 init_~r213~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 837#L820 assume init_~r232~0 % 256 != 0;init_~tmp___15~0 := 1; 671#L831 init_~r233~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 667#L841 assume init_~r242~0 % 256 != 0;init_~tmp___16~0 := 1; 665#L852 init_~r243~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 666#L862 assume init_~r312~0 % 256 != 0;init_~tmp___17~0 := 1; 706#L873 init_~r313~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 769#L883 assume init_~r322~0 % 256 != 0;init_~tmp___18~0 := 1; 911#L894 init_~r323~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 908#L904 assume init_~r342~0 % 256 != 0;init_~tmp___19~0 := 1; 801#L915 init_~r343~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 798#L925 assume init_~r412~0 % 256 != 0;init_~tmp___20~0 := 1; 692#L936 init_~r413~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 797#L946 assume init_~r422~0 % 256 != 0;init_~tmp___21~0 := 1; 753#L957 init_~r423~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 750#L967 assume init_~r432~0 % 256 != 0;init_~tmp___22~0 := 1; 745#L978 init_~r433~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 746#L988 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 678#L988-1 init_#res := init_~tmp___23~0; 941#L1125 main_#t~ret56 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 844#L1266-3 [2018-10-27 06:06:16,326 INFO L795 eck$LassoCheckResult]: Loop: 844#L1266-3 assume true; 842#L1266-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 843#L156 assume !(~mode1~0 % 256 != 0); 869#L192 assume !(~r1~0 < 3); 810#L192-1 ~mode1~0 := 1; 867#L156-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 824#L220 assume !(~mode2~0 % 256 != 0); 826#L256 assume !(~r2~0 < 3); 748#L256-1 ~mode2~0 := 1; 816#L220-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 761#L284 assume !(~mode3~0 % 256 != 0); 763#L320 assume !(~r3~0 < 3); 886#L320-1 ~mode3~0 := 1; 755#L284-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 756#L348 assume !(~mode4~0 % 256 != 0); 700#L384 assume !(~r4~0 < 3); 702#L384-1 ~mode4~0 := 1; 707#L348-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 646#L1133 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 647#L1134 assume ~st1~0 + ~nl1~0 <= 1; 818#L1135 assume ~st2~0 + ~nl2~0 <= 1; 925#L1136 assume ~st3~0 + ~nl3~0 <= 1; 938#L1137 assume ~st4~0 + ~nl4~0 <= 1; 708#L1138 assume ~r1~0 >= 3; 709#L1142 assume ~r1~0 < 3; 929#L1147 assume ~r1~0 >= 3; 793#L1152 assume ~r1~0 < 3;check_~tmp~1 := 1; 661#L1133-1 check_#res := check_~tmp~1; 662#L1185 main_#t~ret57 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 672#L1309 assume !(assert_~arg % 256 == 0); 673#L1304 assume { :end_inline_assert } true;main_#t~post58 := main_~i2~0;main_~i2~0 := main_#t~post58 + 1;havoc main_#t~post58; 844#L1266-3 [2018-10-27 06:06:16,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash 15484180, now seen corresponding path program 2 times [2018-10-27 06:06:16,326 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:16,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:16,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:16,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:16,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:16,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:06:16,460 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:16,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1711804551, now seen corresponding path program 1 times [2018-10-27 06:06:16,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:16,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:16,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:16,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:06:16,543 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:16,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:06:16,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:06:16,544 INFO L87 Difference]: Start difference. First operand 305 states and 539 transitions. cyclomatic complexity: 235 Second operand 3 states. [2018-10-27 06:06:16,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:16,878 INFO L93 Difference]: Finished difference Result 403 states and 695 transitions. [2018-10-27 06:06:16,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:06:16,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 403 states and 695 transitions. [2018-10-27 06:06:16,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-10-27 06:06:16,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 403 states to 403 states and 695 transitions. [2018-10-27 06:06:16,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 403 [2018-10-27 06:06:16,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 403 [2018-10-27 06:06:16,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 403 states and 695 transitions. [2018-10-27 06:06:16,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:16,895 INFO L705 BuchiCegarLoop]: Abstraction has 403 states and 695 transitions. [2018-10-27 06:06:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states and 695 transitions. [2018-10-27 06:06:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-27 06:06:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-27 06:06:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 695 transitions. [2018-10-27 06:06:16,914 INFO L728 BuchiCegarLoop]: Abstraction has 403 states and 695 transitions. [2018-10-27 06:06:16,914 INFO L608 BuchiCegarLoop]: Abstraction has 403 states and 695 transitions. [2018-10-27 06:06:16,914 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:06:16,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 403 states and 695 transitions. [2018-10-27 06:06:16,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-10-27 06:06:16,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:16,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:16,920 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:16,920 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:16,921 INFO L793 eck$LassoCheckResult]: Stem: 1556#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 1381#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 1382#L484 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 1404#L495 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 1398#L505 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 1396#L516 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 1397#L526 assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 1431#L537 init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 1655#L547 assume init_~r211~0 % 256 != 0;init_~tmp___2~0 := 1; 1637#L558 init_~r212~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 1634#L568 assume init_~r231~0 % 256 != 0;init_~tmp___3~0 := 1; 1537#L579 init_~r232~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 1535#L589 assume init_~r241~0 % 256 != 0;init_~tmp___4~0 := 1; 1372#L600 init_~r242~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 1369#L610 assume init_~r311~0 % 256 != 0;init_~tmp___5~0 := 1; 1367#L621 init_~r312~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 1368#L631 assume init_~r321~0 % 256 != 0;init_~tmp___6~0 := 1; 1361#L642 init_~r322~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 1475#L652 assume init_~r341~0 % 256 != 0;init_~tmp___7~0 := 1; 1474#L663 init_~r342~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 1621#L673 assume init_~r411~0 % 256 != 0;init_~tmp___8~0 := 1; 1506#L684 init_~r412~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 1504#L694 assume init_~r421~0 % 256 != 0;init_~tmp___9~0 := 1; 1391#L705 init_~r422~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 1503#L715 assume init_~r431~0 % 256 != 0;init_~tmp___10~0 := 1; 1449#L726 init_~r432~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 1445#L736 assume init_~r122~0 % 256 != 0;init_~tmp___11~0 := 1; 1443#L747 init_~r123~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 1444#L757 assume init_~r132~0 % 256 != 0;init_~tmp___12~0 := 1; 1441#L768 init_~r133~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 1608#L778 assume init_~r142~0 % 256 != 0;init_~tmp___13~0 := 1; 1498#L789 init_~r143~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 1607#L799 assume init_~r212~0 % 256 != 0;init_~tmp___14~0 := 1; 1554#L810 init_~r213~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 1552#L820 assume init_~r232~0 % 256 != 0;init_~tmp___15~0 := 1; 1387#L831 init_~r233~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 1383#L841 assume init_~r242~0 % 256 != 0;init_~tmp___16~0 := 1; 1379#L852 init_~r243~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 1380#L862 assume init_~r312~0 % 256 != 0;init_~tmp___17~0 := 1; 1422#L873 init_~r313~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 1482#L883 assume init_~r322~0 % 256 != 0;init_~tmp___18~0 := 1; 1629#L894 init_~r323~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 1625#L904 assume init_~r342~0 % 256 != 0;init_~tmp___19~0 := 1; 1515#L915 init_~r343~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 1513#L925 assume init_~r412~0 % 256 != 0;init_~tmp___20~0 := 1; 1408#L936 init_~r413~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 1512#L946 assume init_~r422~0 % 256 != 0;init_~tmp___21~0 := 1; 1468#L957 init_~r423~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 1462#L967 assume init_~r432~0 % 256 != 0;init_~tmp___22~0 := 1; 1458#L978 init_~r433~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 1459#L988 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 1394#L988-1 init_#res := init_~tmp___23~0; 1663#L1125 main_#t~ret56 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 1668#L1266-3 [2018-10-27 06:06:16,921 INFO L795 eck$LassoCheckResult]: Loop: 1668#L1266-3 assume true; 1672#L1266-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 1671#L156 assume !(~mode1~0 % 256 != 0); 1670#L192 assume ~r1~0 < 3; 1517#L193 assume !(~ep12~0 % 256 != 0); 1509#L193-1 assume !(~ep13~0 % 256 != 0); 1510#L198 assume !(~ep14~0 % 256 != 0); 1522#L192-1 ~mode1~0 := 1; 1728#L156-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 1722#L220 assume !(~mode2~0 % 256 != 0); 1720#L256 assume !(~r2~0 < 3); 1715#L256-1 ~mode2~0 := 1; 1713#L220-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 1711#L284 assume !(~mode3~0 % 256 != 0); 1712#L320 assume !(~r3~0 < 3); 1701#L320-1 ~mode3~0 := 1; 1696#L284-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 1690#L348 assume !(~mode4~0 % 256 != 0); 1688#L384 assume !(~r4~0 < 3); 1684#L384-1 ~mode4~0 := 1; 1683#L348-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1682#L1133 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1681#L1134 assume ~st1~0 + ~nl1~0 <= 1; 1680#L1135 assume ~st2~0 + ~nl2~0 <= 1; 1679#L1136 assume ~st3~0 + ~nl3~0 <= 1; 1678#L1137 assume ~st4~0 + ~nl4~0 <= 1; 1677#L1138 assume !(~r1~0 >= 3); 1622#L1141 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 == 0; 1623#L1142 assume ~r1~0 < 3; 1669#L1147 assume !(~r1~0 >= 3); 1507#L1151 assume ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0 == 0; 1508#L1152 assume ~r1~0 < 3;check_~tmp~1 := 1; 1676#L1133-1 check_#res := check_~tmp~1; 1675#L1185 main_#t~ret57 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1674#L1309 assume !(assert_~arg % 256 == 0); 1673#L1304 assume { :end_inline_assert } true;main_#t~post58 := main_~i2~0;main_~i2~0 := main_#t~post58 + 1;havoc main_#t~post58; 1668#L1266-3 [2018-10-27 06:06:16,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:16,922 INFO L82 PathProgramCache]: Analyzing trace with hash 15484180, now seen corresponding path program 3 times [2018-10-27 06:06:16,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:16,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:16,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:16,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:17,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:17,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:06:17,107 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:06:17,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:17,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2070386060, now seen corresponding path program 1 times [2018-10-27 06:06:17,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:17,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:17,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:17,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:17,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:17,831 WARN L179 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 152 [2018-10-27 06:06:18,067 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2018-10-27 06:06:18,095 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:18,097 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:18,097 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:18,097 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:18,097 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:06:18,097 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:18,097 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:18,097 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:18,098 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-10-27 06:06:18,098 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:18,098 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:18,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:18,846 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:18,847 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:18,857 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:18,858 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:18,863 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:18,863 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node4_~newmax~3=0} Honda state: {ULTIMATE.start_node4_~newmax~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/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 [2018-10-27 06:06:18,880 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:18,881 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ea6a3f4-aaaf-40f9-aa97-c45d35128c7b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:18,900 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:06:18,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:19,102 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:06:19,104 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:19,104 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:19,104 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:19,104 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:19,104 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:19,104 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:19,104 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:19,104 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:19,104 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-10-27 06:06:19,104 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:19,105 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:19,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:19,772 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-27 06:06:19,893 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-10-27 06:06:20,292 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-10-27 06:06:20,351 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:20,355 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:20,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:20,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:20,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,390 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:20,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:20,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:20,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:20,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:20,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:20,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,479 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:20,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:20,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:20,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:20,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:20,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:20,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:20,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:20,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:20,482 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:20,490 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:06:20,490 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:06:20,492 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:20,492 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:06:20,492 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:20,492 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2018-10-27 06:06:20,493 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:06:20,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:20,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:20,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:20,709 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 [2018-10-27 06:06:20,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 695 transitions. cyclomatic complexity: 293 Second operand 4 states. [2018-10-27 06:06:20,827 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 403 states and 695 transitions. cyclomatic complexity: 293. Second operand 4 states. Result 623 states and 1054 transitions. Complement of second has 6 states. [2018-10-27 06:06:20,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:06:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2018-10-27 06:06:20,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 539 transitions. Stem has 53 letters. Loop has 36 letters. [2018-10-27 06:06:20,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:20,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 539 transitions. Stem has 89 letters. Loop has 36 letters. [2018-10-27 06:06:20,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:20,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 539 transitions. Stem has 53 letters. Loop has 72 letters. [2018-10-27 06:06:20,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:20,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 623 states and 1054 transitions. [2018-10-27 06:06:20,840 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:20,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 623 states to 0 states and 0 transitions. [2018-10-27 06:06:20,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:06:20,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:06:20,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:06:20,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:20,841 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:20,841 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:20,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:06:20,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:06:20,841 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-10-27 06:06:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:20,842 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-10-27 06:06:20,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:06:20,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-10-27 06:06:20,842 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:20,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:06:20,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:06:20,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:06:20,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:06:20,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:20,843 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:20,843 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:20,843 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:20,843 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:06:20,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:06:20,843 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:20,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:06:20,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:06:20 BoogieIcfgContainer [2018-10-27 06:06:20,857 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:06:20,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:06:20,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:06:20,857 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:06:20,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:15" (3/4) ... [2018-10-27 06:06:20,862 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:06:20,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:06:20,863 INFO L168 Benchmark]: Toolchain (without parser) took 8350.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -249.0 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:20,864 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:20,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 924.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:20,865 INFO L168 Benchmark]: Boogie Procedure Inliner took 163.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 924.9 MB in the beginning and 1.1 GB in the end (delta: -206.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:20,866 INFO L168 Benchmark]: Boogie Preprocessor took 75.89 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:20,867 INFO L168 Benchmark]: RCFGBuilder took 2092.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.8 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:20,867 INFO L168 Benchmark]: BuchiAutomizer took 5564.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -181.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:20,868 INFO L168 Benchmark]: Witness Printer took 5.50 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:20,871 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 442.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 924.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 163.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 924.9 MB in the beginning and 1.1 GB in the end (delta: -206.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.89 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2092.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.8 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5564.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -181.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.50 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.4s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 403 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1626 SDtfs, 680 SDslu, 2359 SDs, 0 SdLazy, 35 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital210 mio100 ax122 hnf105 lsp27 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...