./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/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 b3efd85eaecafa9f5850339d4919cc79d62d9539 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:22:37,701 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:22:37,703 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:22:37,708 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:22:37,709 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:22:37,709 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:22:37,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:22:37,711 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:22:37,712 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:22:37,713 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:22:37,713 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:22:37,714 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:22:37,714 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:22:37,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:22:37,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:22:37,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:22:37,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:22:37,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:22:37,718 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:22:37,719 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:22:37,719 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:22:37,720 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:22:37,721 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:22:37,721 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:22:37,721 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:22:37,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:22:37,722 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:22:37,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:22:37,723 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:22:37,724 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:22:37,724 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:22:37,724 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:22:37,724 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:22:37,724 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:22:37,725 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:22:37,725 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:22:37,725 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 13:22:37,736 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:22:37,736 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:22:37,737 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:22:37,737 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:22:37,737 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:22:37,737 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:22:37,738 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:22:37,738 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:22:37,738 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:22:37,738 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:22:37,738 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:22:37,738 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:22:37,738 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:22:37,739 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:22:37,739 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:22:37,739 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:22:37,739 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:22:37,739 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:22:37,739 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:22:37,739 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:22:37,739 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:22:37,740 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:22:37,740 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:22:37,740 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:22:37,740 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:22:37,740 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:22:37,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:22:37,740 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:22:37,740 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:22:37,741 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:22:37,741 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:22:37,741 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:22:37,742 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_b11c9155-85b3-4376-863c-26adb776d57b/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 -> b3efd85eaecafa9f5850339d4919cc79d62d9539 [2018-11-18 13:22:37,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:22:37,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:22:37,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:22:37,777 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:22:37,777 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:22:37,778 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 13:22:37,821 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/bin-2019/uautomizer/data/234e41966/4176e6cd12bb431bb2d5ef13d1b639a7/FLAG0088ffb02 [2018-11-18 13:22:38,224 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:22:38,225 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 13:22:38,230 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/bin-2019/uautomizer/data/234e41966/4176e6cd12bb431bb2d5ef13d1b639a7/FLAG0088ffb02 [2018-11-18 13:22:38,239 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/bin-2019/uautomizer/data/234e41966/4176e6cd12bb431bb2d5ef13d1b639a7 [2018-11-18 13:22:38,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:22:38,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:22:38,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:22:38,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:22:38,245 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:22:38,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:22:38" (1/1) ... [2018-11-18 13:22:38,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb2b19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38, skipping insertion in model container [2018-11-18 13:22:38,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:22:38" (1/1) ... [2018-11-18 13:22:38,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:22:38,281 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:22:38,437 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:22:38,443 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:22:38,517 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:22:38,531 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:22:38,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38 WrapperNode [2018-11-18 13:22:38,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:22:38,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:22:38,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:22:38,532 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:22:38,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38" (1/1) ... [2018-11-18 13:22:38,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38" (1/1) ... [2018-11-18 13:22:38,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:22:38,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:22:38,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:22:38,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:22:38,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38" (1/1) ... [2018-11-18 13:22:38,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38" (1/1) ... [2018-11-18 13:22:38,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38" (1/1) ... [2018-11-18 13:22:38,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38" (1/1) ... [2018-11-18 13:22:38,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38" (1/1) ... [2018-11-18 13:22:38,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38" (1/1) ... [2018-11-18 13:22:38,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38" (1/1) ... [2018-11-18 13:22:38,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:22:38,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:22:38,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:22:38,594 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:22:38,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/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-11-18 13:22:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:22:38,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:22:39,082 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:22:39,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:22:39 BoogieIcfgContainer [2018-11-18 13:22:39,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:22:39,084 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:22:39,084 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:22:39,086 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:22:39,086 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:22:39,086 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:22:38" (1/3) ... [2018-11-18 13:22:39,087 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50f356b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:22:39, skipping insertion in model container [2018-11-18 13:22:39,087 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:22:39,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:22:38" (2/3) ... [2018-11-18 13:22:39,087 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50f356b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:22:39, skipping insertion in model container [2018-11-18 13:22:39,087 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:22:39,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:22:39" (3/3) ... [2018-11-18 13:22:39,088 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 13:22:39,118 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:22:39,118 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:22:39,118 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:22:39,118 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:22:39,119 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:22:39,119 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:22:39,119 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:22:39,119 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:22:39,119 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:22:39,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states. [2018-11-18 13:22:39,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2018-11-18 13:22:39,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:22:39,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:22:39,160 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:22:39,160 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] [2018-11-18 13:22:39,160 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:22:39,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states. [2018-11-18 13:22:39,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2018-11-18 13:22:39,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:22:39,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:22:39,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:22:39,166 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] [2018-11-18 13:22:39,171 INFO L794 eck$LassoCheckResult]: Stem: 89#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;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 11#L274true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 126#L277-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 57#L287true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 46#L290-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 91#L300true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 81#L303-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 112#L313true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 109#L316-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 34#L326true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 16#L329-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 60#L339true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 56#L342-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 99#L352true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 102#L352-1true init_#res := init_~tmp___5~0; 21#L461true main_#t~ret33 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 119#L569-3true [2018-11-18 13:22:39,172 INFO L796 eck$LassoCheckResult]: Loop: 119#L569-3true assume true; 114#L569-1true assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1; 19#L120true assume !(0 != ~mode1~0 % 256); 116#L145true assume !(~r1~0 < 1); 113#L145-1true ~mode1~0 := 1; 17#L120-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3; 63#L163true assume !(0 != ~mode2~0 % 256); 41#L188true assume !(~r2~0 < 2); 39#L188-1true ~mode2~0 := 1; 62#L163-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5; 110#L206true assume !(0 != ~mode3~0 % 256); 87#L231true assume !(~r3~0 < 2); 86#L231-1true ~mode3~0 := 1; 107#L206-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 44#L469true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 29#L469-1true check_#res := check_~tmp~1; 111#L517true main_#t~ret34 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 10#L599true assume !(0 == assert_~arg % 256); 106#L594true assume { :end_inline_assert } true;main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 119#L569-3true [2018-11-18 13:22:39,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:39,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2018311820, now seen corresponding path program 1 times [2018-11-18 13:22:39,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:22:39,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:22:39,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:39,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:22:39,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:22:39,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:22:39,313 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:22:39,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2016493084, now seen corresponding path program 1 times [2018-11-18 13:22:39,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:22:39,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:22:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:22:39,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:22:39,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:22:39,373 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:22:39,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:22:39,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:22:39,388 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2018-11-18 13:22:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:22:39,443 INFO L93 Difference]: Finished difference Result 131 states and 223 transitions. [2018-11-18 13:22:39,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:22:39,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 223 transitions. [2018-11-18 13:22:39,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-18 13:22:39,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 124 states and 190 transitions. [2018-11-18 13:22:39,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2018-11-18 13:22:39,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2018-11-18 13:22:39,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 190 transitions. [2018-11-18 13:22:39,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:22:39,455 INFO L705 BuchiCegarLoop]: Abstraction has 124 states and 190 transitions. [2018-11-18 13:22:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 190 transitions. [2018-11-18 13:22:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-11-18 13:22:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-18 13:22:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 190 transitions. [2018-11-18 13:22:39,482 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 190 transitions. [2018-11-18 13:22:39,482 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 190 transitions. [2018-11-18 13:22:39,482 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:22:39,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 190 transitions. [2018-11-18 13:22:39,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-18 13:22:39,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:22:39,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:22:39,485 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] [2018-11-18 13:22:39,485 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] [2018-11-18 13:22:39,486 INFO L794 eck$LassoCheckResult]: Stem: 392#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;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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]; 297#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 292#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 293#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 368#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 353#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 354#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 335#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 389#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 372#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 333#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 300#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 302#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 291#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 367#L352 assume ~id1~0 != ~id2~0; 365#L353 assume ~id1~0 != ~id3~0; 286#L354 assume ~id2~0 != ~id3~0; 287#L355 assume ~id1~0 >= 0; 336#L356 assume ~id2~0 >= 0; 337#L357 assume ~id3~0 >= 0; 388#L358 assume 0 == ~r1~0; 331#L359 assume 0 == ~r2~0; 332#L360 assume 0 == ~r3~0; 370#L361 assume 0 != init_~r122~0 % 256; 323#L362 assume 0 != init_~r132~0 % 256; 324#L363 assume 0 != init_~r212~0 % 256; 364#L364 assume 0 != init_~r232~0 % 256; 284#L365 assume 0 != init_~r312~0 % 256; 285#L366 assume 0 != init_~r322~0 % 256; 361#L367 assume ~max1~0 == ~id1~0; 362#L368 assume ~max2~0 == ~id2~0; 387#L369 assume ~max3~0 == ~id3~0; 329#L370 assume 0 == ~st1~0; 330#L371 assume 0 == ~st2~0; 369#L372 assume 0 == ~st3~0; 321#L373 assume 0 == ~nl1~0; 322#L374 assume 0 == ~nl2~0; 363#L375 assume 0 == ~nl3~0; 282#L376 assume 0 == ~mode1~0 % 256; 283#L377 assume 0 == ~mode2~0 % 256; 357#L378 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 358#L352-1 init_#res := init_~tmp___5~0; 313#L461 main_#t~ret33 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 314#L569-3 [2018-11-18 13:22:39,486 INFO L796 eck$LassoCheckResult]: Loop: 314#L569-3 assume true; 396#L569-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1; 308#L120 assume !(0 != ~mode1~0 % 256); 310#L145 assume !(~r1~0 < 1); 296#L145-1 ~mode1~0 := 1; 303#L120-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3; 304#L163 assume !(0 != ~mode2~0 % 256); 343#L188 assume !(~r2~0 < 2); 338#L188-1 ~mode2~0 := 1; 339#L163-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5; 373#L206 assume !(0 != ~mode3~0 % 256); 391#L231 assume !(~r3~0 < 2); 342#L231-1 ~mode3~0 := 1; 390#L206-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 348#L469 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 306#L469-1 check_#res := check_~tmp~1; 327#L517 main_#t~ret34 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 288#L599 assume !(0 == assert_~arg % 256); 289#L594 assume { :end_inline_assert } true;main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 314#L569-3 [2018-11-18 13:22:39,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:39,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1251496387, now seen corresponding path program 1 times [2018-11-18 13:22:39,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:22:39,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:22:39,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:39,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:22:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:22:39,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:39,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2016493084, now seen corresponding path program 2 times [2018-11-18 13:22:39,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:22:39,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:22:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:22:39,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:22:39,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:22:39,618 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:22:39,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:22:39,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:22:39,619 INFO L87 Difference]: Start difference. First operand 124 states and 190 transitions. cyclomatic complexity: 67 Second operand 5 states. [2018-11-18 13:22:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:22:39,648 INFO L93 Difference]: Finished difference Result 127 states and 192 transitions. [2018-11-18 13:22:39,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:22:39,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 192 transitions. [2018-11-18 13:22:39,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-18 13:22:39,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 124 states and 182 transitions. [2018-11-18 13:22:39,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2018-11-18 13:22:39,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2018-11-18 13:22:39,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 182 transitions. [2018-11-18 13:22:39,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:22:39,652 INFO L705 BuchiCegarLoop]: Abstraction has 124 states and 182 transitions. [2018-11-18 13:22:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 182 transitions. [2018-11-18 13:22:39,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-11-18 13:22:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-18 13:22:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2018-11-18 13:22:39,657 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 182 transitions. [2018-11-18 13:22:39,657 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 182 transitions. [2018-11-18 13:22:39,657 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:22:39,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 182 transitions. [2018-11-18 13:22:39,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-18 13:22:39,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:22:39,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:22:39,659 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] [2018-11-18 13:22:39,659 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] [2018-11-18 13:22:39,659 INFO L794 eck$LassoCheckResult]: Stem: 655#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;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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]; 560#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 555#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 556#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 631#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 616#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 617#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 598#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 652#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 635#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 596#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 563#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 565#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 554#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 630#L352 assume ~id1~0 != ~id2~0; 628#L353 assume ~id1~0 != ~id3~0; 549#L354 assume ~id2~0 != ~id3~0; 550#L355 assume ~id1~0 >= 0; 599#L356 assume ~id2~0 >= 0; 600#L357 assume ~id3~0 >= 0; 651#L358 assume 0 == ~r1~0; 594#L359 assume 0 == ~r2~0; 595#L360 assume 0 == ~r3~0; 633#L361 assume 0 != init_~r122~0 % 256; 585#L362 assume 0 != init_~r132~0 % 256; 586#L363 assume 0 != init_~r212~0 % 256; 627#L364 assume 0 != init_~r232~0 % 256; 547#L365 assume 0 != init_~r312~0 % 256; 548#L366 assume 0 != init_~r322~0 % 256; 624#L367 assume ~max1~0 == ~id1~0; 625#L368 assume ~max2~0 == ~id2~0; 650#L369 assume ~max3~0 == ~id3~0; 592#L370 assume 0 == ~st1~0; 593#L371 assume 0 == ~st2~0; 632#L372 assume 0 == ~st3~0; 583#L373 assume 0 == ~nl1~0; 584#L374 assume 0 == ~nl2~0; 626#L375 assume 0 == ~nl3~0; 545#L376 assume 0 == ~mode1~0 % 256; 546#L377 assume 0 == ~mode2~0 % 256; 620#L378 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 621#L352-1 init_#res := init_~tmp___5~0; 575#L461 main_#t~ret33 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 576#L569-3 [2018-11-18 13:22:39,659 INFO L796 eck$LassoCheckResult]: Loop: 576#L569-3 assume true; 659#L569-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1; 570#L120 assume !(0 != ~mode1~0 % 256); 572#L145 assume !(~r1~0 < 1); 559#L145-1 ~mode1~0 := 1; 566#L120-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3; 567#L163 assume !(0 != ~mode2~0 % 256); 606#L188 assume !(~r2~0 < 2); 601#L188-1 ~mode2~0 := 1; 602#L163-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5; 636#L206 assume !(0 != ~mode3~0 % 256); 654#L231 assume !(~r3~0 < 2); 605#L231-1 ~mode3~0 := 1; 653#L206-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 611#L469 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 612#L470 assume ~st1~0 + ~nl1~0 <= 1; 639#L471 assume ~st2~0 + ~nl2~0 <= 1; 573#L472 assume ~st3~0 + ~nl3~0 <= 1; 574#L473 assume ~r1~0 >= 2; 613#L477 assume ~r1~0 < 2; 615#L482 assume ~r1~0 >= 2; 569#L487 assume ~r1~0 < 2;check_~tmp~1 := 1; 589#L469-1 check_#res := check_~tmp~1; 590#L517 main_#t~ret34 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 551#L599 assume !(0 == assert_~arg % 256); 552#L594 assume { :end_inline_assert } true;main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 576#L569-3 [2018-11-18 13:22:39,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1251496387, now seen corresponding path program 2 times [2018-11-18 13:22:39,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:22:39,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:22:39,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:22:39,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:22:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:22:39,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:39,707 INFO L82 PathProgramCache]: Analyzing trace with hash 45618281, now seen corresponding path program 1 times [2018-11-18 13:22:39,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:22:39,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:22:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:22:39,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:22:39,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:22:39,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:22:39,730 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:22:39,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:22:39,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:22:39,731 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. cyclomatic complexity: 59 Second operand 3 states. [2018-11-18 13:22:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:22:39,773 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2018-11-18 13:22:39,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:22:39,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 260 transitions. [2018-11-18 13:22:39,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2018-11-18 13:22:39,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 177 states and 260 transitions. [2018-11-18 13:22:39,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2018-11-18 13:22:39,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2018-11-18 13:22:39,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 260 transitions. [2018-11-18 13:22:39,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:22:39,779 INFO L705 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2018-11-18 13:22:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 260 transitions. [2018-11-18 13:22:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-11-18 13:22:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 13:22:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 260 transitions. [2018-11-18 13:22:39,786 INFO L728 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2018-11-18 13:22:39,786 INFO L608 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2018-11-18 13:22:39,786 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:22:39,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 260 transitions. [2018-11-18 13:22:39,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2018-11-18 13:22:39,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:22:39,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:22:39,789 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] [2018-11-18 13:22:39,789 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] [2018-11-18 13:22:39,789 INFO L794 eck$LassoCheckResult]: Stem: 964#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;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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]; 867#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 862#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 863#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 937#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 922#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 923#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 905#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 961#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 941#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 903#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 870#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 872#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 861#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 936#L352 assume ~id1~0 != ~id2~0; 934#L353 assume ~id1~0 != ~id3~0; 856#L354 assume ~id2~0 != ~id3~0; 857#L355 assume ~id1~0 >= 0; 906#L356 assume ~id2~0 >= 0; 907#L357 assume ~id3~0 >= 0; 960#L358 assume 0 == ~r1~0; 901#L359 assume 0 == ~r2~0; 902#L360 assume 0 == ~r3~0; 939#L361 assume 0 != init_~r122~0 % 256; 892#L362 assume 0 != init_~r132~0 % 256; 893#L363 assume 0 != init_~r212~0 % 256; 933#L364 assume 0 != init_~r232~0 % 256; 854#L365 assume 0 != init_~r312~0 % 256; 855#L366 assume 0 != init_~r322~0 % 256; 930#L367 assume ~max1~0 == ~id1~0; 931#L368 assume ~max2~0 == ~id2~0; 959#L369 assume ~max3~0 == ~id3~0; 899#L370 assume 0 == ~st1~0; 900#L371 assume 0 == ~st2~0; 938#L372 assume 0 == ~st3~0; 890#L373 assume 0 == ~nl1~0; 891#L374 assume 0 == ~nl2~0; 932#L375 assume 0 == ~nl3~0; 852#L376 assume 0 == ~mode1~0 % 256; 853#L377 assume 0 == ~mode2~0 % 256; 926#L378 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 927#L352-1 init_#res := init_~tmp___5~0; 882#L461 main_#t~ret33 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 883#L569-3 [2018-11-18 13:22:39,789 INFO L796 eck$LassoCheckResult]: Loop: 883#L569-3 assume true; 981#L569-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1; 980#L120 assume !(0 != ~mode1~0 % 256); 979#L145 assume !(~r1~0 < 1); 866#L145-1 ~mode1~0 := 1; 873#L120-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3; 874#L163 assume !(0 != ~mode2~0 % 256); 913#L188 assume !(~r2~0 < 2); 908#L188-1 ~mode2~0 := 1; 909#L163-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5; 942#L206 assume !(0 != ~mode3~0 % 256); 971#L231 assume !(~r3~0 < 2); 993#L231-1 ~mode3~0 := 1; 991#L206-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 990#L469 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 989#L470 assume ~st1~0 + ~nl1~0 <= 1; 988#L471 assume ~st2~0 + ~nl2~0 <= 1; 987#L472 assume ~st3~0 + ~nl3~0 <= 1; 986#L473 assume !(~r1~0 >= 2); 965#L476 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 966#L477 assume ~r1~0 < 2; 978#L482 assume !(~r1~0 >= 2); 875#L486 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 876#L487 assume ~r1~0 < 2;check_~tmp~1 := 1; 985#L469-1 check_#res := check_~tmp~1; 984#L517 main_#t~ret34 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 983#L599 assume !(0 == assert_~arg % 256); 982#L594 assume { :end_inline_assert } true;main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 883#L569-3 [2018-11-18 13:22:39,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1251496387, now seen corresponding path program 3 times [2018-11-18 13:22:39,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:22:39,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:22:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:22:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:22:39,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:39,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2005134953, now seen corresponding path program 1 times [2018-11-18 13:22:39,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:22:39,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:22:39,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:22:39,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:22:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:22:39,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:39,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1737217371, now seen corresponding path program 1 times [2018-11-18 13:22:39,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:22:39,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:22:39,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:39,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:22:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:22:39,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:22:39,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:22:40,071 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 96 [2018-11-18 13:22:40,144 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:22:40,145 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:22:40,145 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:22:40,145 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:22:40,145 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:22:40,145 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:22:40,145 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:22:40,145 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:22:40,146 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-18 13:22:40,146 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:22:40,146 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:22:40,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-11-18 13:22:40,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,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-11-18 13:22:40,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,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-11-18 13:22:40,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,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-11-18 13:22:40,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,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-11-18 13:22:40,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,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-11-18 13:22:40,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,476 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:22:40,476 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/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-11-18 13:22:40,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:22:40,480 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b11c9155-85b3-4376-863c-26adb776d57b/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-11-18 13:22:40,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:22:40,498 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:22:40,582 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:22:40,583 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:22:40,583 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:22:40,583 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:22:40,583 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:22:40,583 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:22:40,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:22:40,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:22:40,584 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:22:40,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-18 13:22:40,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:22:40,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:22:40,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:22:40,893 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:22:40,896 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:22:40,897 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-11-18 13:22:40,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:22:40,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:22:40,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:22:40,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:22:40,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:22:40,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:22:40,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:22:40,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:22:40,902 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-11-18 13:22:40,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:22:40,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:22:40,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:22:40,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:22:40,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:22:40,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:22:40,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:22:40,906 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-11-18 13:22:40,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:22:40,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:22:40,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:22:40,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:22:40,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:22:40,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:22:40,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:22:40,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:22:40,909 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-11-18 13:22:40,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:22:40,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:22:40,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:22:40,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:22:40,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:22:40,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:22:40,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:22:40,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:22:40,911 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-11-18 13:22:40,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:22:40,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:22:40,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:22:40,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:22:40,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:22:40,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:22:40,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:22:40,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:22:40,913 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-11-18 13:22:40,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:22:40,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:22:40,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:22:40,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:22:40,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:22:40,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:22:40,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:22:40,917 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-11-18 13:22:40,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:22:40,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:22:40,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:22:40,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:22:40,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:22:40,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:22:40,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:22:40,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:22:40,921 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-11-18 13:22:40,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:22:40,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:22:40,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:22:40,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:22:40,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:22:40,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:22:40,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:22:40,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:22:40,924 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-11-18 13:22:40,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:22:40,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:22:40,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:22:40,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:22:40,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:22:40,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:22:40,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:22:40,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:22:40,926 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-11-18 13:22:40,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:22:40,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:22:40,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:22:40,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:22:40,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:22:40,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:22:40,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:22:40,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:22:40,928 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-11-18 13:22:40,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:22:40,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:22:40,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:22:40,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:22:40,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:22:40,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:22:40,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:22:40,930 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:22:40,933 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:22:40,933 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:22:40,934 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:22:40,934 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:22:40,935 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:22:40,935 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2018-11-18 13:22:40,936 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:22:40,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:40,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:22:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:41,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:22:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:22:41,038 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-11-18 13:22:41,038 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 177 states and 260 transitions. cyclomatic complexity: 84 Second operand 4 states. [2018-11-18 13:22:41,078 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 177 states and 260 transitions. cyclomatic complexity: 84. Second operand 4 states. Result 298 states and 447 transitions. Complement of second has 6 states. [2018-11-18 13:22:41,081 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-11-18 13:22:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:22:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2018-11-18 13:22:41,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 43 letters. Loop has 28 letters. [2018-11-18 13:22:41,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:22:41,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 71 letters. Loop has 28 letters. [2018-11-18 13:22:41,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:22:41,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 43 letters. Loop has 56 letters. [2018-11-18 13:22:41,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:22:41,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 298 states and 447 transitions. [2018-11-18 13:22:41,087 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:22:41,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 298 states to 0 states and 0 transitions. [2018-11-18 13:22:41,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:22:41,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:22:41,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:22:41,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:22:41,088 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:22:41,088 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:22:41,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:22:41,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:22:41,088 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-18 13:22:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:22:41,089 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 13:22:41,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:22:41,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 13:22:41,089 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:22:41,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:22:41,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:22:41,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:22:41,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:22:41,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:22:41,089 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:22:41,089 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:22:41,089 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:22:41,089 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:22:41,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:22:41,090 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:22:41,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:22:41,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:22:41 BoogieIcfgContainer [2018-11-18 13:22:41,094 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:22:41,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:22:41,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:22:41,094 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:22:41,094 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:22:39" (3/4) ... [2018-11-18 13:22:41,097 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:22:41,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:22:41,098 INFO L168 Benchmark]: Toolchain (without parser) took 2855.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 958.6 MB in the beginning and 911.3 MB in the end (delta: 47.3 MB). Peak memory consumption was 178.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:22:41,098 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:22:41,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 955.9 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:22:41,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:22:41,100 INFO L168 Benchmark]: Boogie Preprocessor took 26.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:22:41,100 INFO L168 Benchmark]: RCFGBuilder took 489.41 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: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:22:41,101 INFO L168 Benchmark]: BuchiAutomizer took 2010.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.3 MB in the end (delta: 158.4 MB). Peak memory consumption was 158.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:22:41,101 INFO L168 Benchmark]: Witness Printer took 3.28 ms. Allocated memory is still 1.2 GB. Free memory is still 911.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:22:41,104 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 955.9 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 489.41 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: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2010.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.3 MB in the end (delta: 158.4 MB). Peak memory consumption was 158.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.28 ms. Allocated memory is still 1.2 GB. Free memory is still 911.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 177 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 836 SDtfs, 263 SDslu, 1233 SDs, 0 SdLazy, 40 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital133 mio100 ax127 hnf104 lsp21 ukn100 mio100 lsp100 div128 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...