./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_true-unreach-call.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_82dfd728-d890-4d1c-8092-7653b0e72d0b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/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 624250415cb355767b499d123f33fd2a923cf042 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:29:33,055 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:29:33,056 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:29:33,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:29:33,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:29:33,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:29:33,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:29:33,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:29:33,068 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:29:33,069 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:29:33,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:29:33,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:29:33,070 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:29:33,071 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:29:33,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:29:33,072 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:29:33,073 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:29:33,074 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:29:33,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:29:33,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:29:33,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:29:33,078 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:29:33,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:29:33,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:29:33,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:29:33,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:29:33,081 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:29:33,082 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:29:33,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:29:33,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:29:33,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:29:33,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:29:33,084 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:29:33,084 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:29:33,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:29:33,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:29:33,086 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 14:29:33,096 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:29:33,096 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:29:33,097 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:29:33,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:29:33,098 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:29:33,098 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 14:29:33,098 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 14:29:33,098 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 14:29:33,098 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 14:29:33,098 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 14:29:33,098 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 14:29:33,099 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:29:33,099 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:29:33,099 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 14:29:33,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:29:33,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:29:33,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:29:33,099 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 14:29:33,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 14:29:33,100 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 14:29:33,100 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:29:33,100 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:29:33,100 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 14:29:33,100 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:29:33,100 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 14:29:33,100 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:29:33,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:29:33,101 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 14:29:33,101 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:29:33,101 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:29:33,101 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 14:29:33,102 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 14:29:33,102 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_82dfd728-d890-4d1c-8092-7653b0e72d0b/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 -> 624250415cb355767b499d123f33fd2a923cf042 [2018-11-18 14:29:33,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:29:33,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:29:33,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:29:33,134 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:29:33,135 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:29:33,135 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 14:29:33,177 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/bin-2019/uautomizer/data/dc310ef2c/6436116f14de482e98165640fcde0ba6/FLAG82a40ca7c [2018-11-18 14:29:33,600 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:29:33,600 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 14:29:33,606 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/bin-2019/uautomizer/data/dc310ef2c/6436116f14de482e98165640fcde0ba6/FLAG82a40ca7c [2018-11-18 14:29:33,615 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/bin-2019/uautomizer/data/dc310ef2c/6436116f14de482e98165640fcde0ba6 [2018-11-18 14:29:33,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:29:33,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:29:33,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:29:33,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:29:33,622 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:29:33,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:29:33" (1/1) ... [2018-11-18 14:29:33,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c3b532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33, skipping insertion in model container [2018-11-18 14:29:33,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:29:33" (1/1) ... [2018-11-18 14:29:33,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:29:33,663 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:29:33,837 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:29:33,846 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:29:33,924 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:29:33,939 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:29:33,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33 WrapperNode [2018-11-18 14:29:33,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:29:33,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:29:33,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:29:33,941 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:29:33,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33" (1/1) ... [2018-11-18 14:29:33,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33" (1/1) ... [2018-11-18 14:29:33,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:29:33,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:29:33,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:29:33,976 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:29:33,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33" (1/1) ... [2018-11-18 14:29:33,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33" (1/1) ... [2018-11-18 14:29:33,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33" (1/1) ... [2018-11-18 14:29:33,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33" (1/1) ... [2018-11-18 14:29:33,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33" (1/1) ... [2018-11-18 14:29:33,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33" (1/1) ... [2018-11-18 14:29:33,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33" (1/1) ... [2018-11-18 14:29:34,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:29:34,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:29:34,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:29:34,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:29:34,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/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 14:29:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:29:34,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:29:34,484 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:29:34,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:29:34 BoogieIcfgContainer [2018-11-18 14:29:34,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:29:34,485 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 14:29:34,485 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 14:29:34,487 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 14:29:34,488 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:29:34,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 02:29:33" (1/3) ... [2018-11-18 14:29:34,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a8cbe43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:29:34, skipping insertion in model container [2018-11-18 14:29:34,489 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:29:34,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:33" (2/3) ... [2018-11-18 14:29:34,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a8cbe43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:29:34, skipping insertion in model container [2018-11-18 14:29:34,489 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:29:34,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:29:34" (3/3) ... [2018-11-18 14:29:34,491 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 14:29:34,523 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:29:34,524 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 14:29:34,524 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 14:29:34,524 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 14:29:34,524 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:29:34,524 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:29:34,524 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 14:29:34,524 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:29:34,524 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 14:29:34,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states. [2018-11-18 14:29:34,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2018-11-18 14:29:34,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:29:34,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:29:34,557 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 14:29:34,557 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 14:29:34,557 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 14:29:34,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states. [2018-11-18 14:29:34,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2018-11-18 14:29:34,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:29:34,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:29:34,562 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 14:29:34,562 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 14:29:34,569 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 14:29:34,570 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 < 2); 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 14:29:34,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:34,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2018311820, now seen corresponding path program 1 times [2018-11-18 14:29:34,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:34,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:34,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:34,729 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 14:29:34,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:29:34,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:29:34,735 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:29:34,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:34,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2016493084, now seen corresponding path program 1 times [2018-11-18 14:29:34,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:34,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:34,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:34,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:34,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:34,811 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 14:29:34,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:29:34,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:29:34,813 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:29:34,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:29:34,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:29:34,824 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2018-11-18 14:29:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:29:34,882 INFO L93 Difference]: Finished difference Result 131 states and 223 transitions. [2018-11-18 14:29:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:29:34,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 223 transitions. [2018-11-18 14:29:34,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-18 14:29:34,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 124 states and 190 transitions. [2018-11-18 14:29:34,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2018-11-18 14:29:34,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2018-11-18 14:29:34,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 190 transitions. [2018-11-18 14:29:34,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:29:34,895 INFO L705 BuchiCegarLoop]: Abstraction has 124 states and 190 transitions. [2018-11-18 14:29:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 190 transitions. [2018-11-18 14:29:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-11-18 14:29:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-18 14:29:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 190 transitions. [2018-11-18 14:29:34,921 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 190 transitions. [2018-11-18 14:29:34,921 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 190 transitions. [2018-11-18 14:29:34,921 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 14:29:34,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 190 transitions. [2018-11-18 14:29:34,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-18 14:29:34,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:29:34,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:29:34,924 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 14:29:34,924 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 14:29:34,925 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 14:29:34,925 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 < 2); 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 14:29:34,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:34,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1251496387, now seen corresponding path program 1 times [2018-11-18 14:29:34,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:34,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:34,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:35,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:35,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2016493084, now seen corresponding path program 2 times [2018-11-18 14:29:35,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:35,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:35,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:35,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:35,077 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 14:29:35,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:29:35,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:29:35,077 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:29:35,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:29:35,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:29:35,078 INFO L87 Difference]: Start difference. First operand 124 states and 190 transitions. cyclomatic complexity: 67 Second operand 5 states. [2018-11-18 14:29:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:29:35,134 INFO L93 Difference]: Finished difference Result 127 states and 192 transitions. [2018-11-18 14:29:35,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:29:35,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 192 transitions. [2018-11-18 14:29:35,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-18 14:29:35,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 124 states and 182 transitions. [2018-11-18 14:29:35,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2018-11-18 14:29:35,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2018-11-18 14:29:35,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 182 transitions. [2018-11-18 14:29:35,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:29:35,139 INFO L705 BuchiCegarLoop]: Abstraction has 124 states and 182 transitions. [2018-11-18 14:29:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 182 transitions. [2018-11-18 14:29:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-11-18 14:29:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-18 14:29:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2018-11-18 14:29:35,146 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 182 transitions. [2018-11-18 14:29:35,146 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 182 transitions. [2018-11-18 14:29:35,146 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 14:29:35,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 182 transitions. [2018-11-18 14:29:35,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-18 14:29:35,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:29:35,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:29:35,148 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 14:29:35,148 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 14:29:35,149 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 14:29:35,149 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 < 2); 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 14:29:35,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1251496387, now seen corresponding path program 2 times [2018-11-18 14:29:35,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:35,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:35,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:35,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:29:35,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:35,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:35,201 INFO L82 PathProgramCache]: Analyzing trace with hash 45618281, now seen corresponding path program 1 times [2018-11-18 14:29:35,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:35,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:35,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:35,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:29:35,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:35,230 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 14:29:35,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:29:35,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:29:35,231 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:29:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:29:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:29:35,232 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. cyclomatic complexity: 59 Second operand 3 states. [2018-11-18 14:29:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:29:35,293 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2018-11-18 14:29:35,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:29:35,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 260 transitions. [2018-11-18 14:29:35,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2018-11-18 14:29:35,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 177 states and 260 transitions. [2018-11-18 14:29:35,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2018-11-18 14:29:35,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2018-11-18 14:29:35,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 260 transitions. [2018-11-18 14:29:35,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:29:35,299 INFO L705 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2018-11-18 14:29:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 260 transitions. [2018-11-18 14:29:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-11-18 14:29:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 14:29:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 260 transitions. [2018-11-18 14:29:35,308 INFO L728 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2018-11-18 14:29:35,308 INFO L608 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2018-11-18 14:29:35,308 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 14:29:35,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 260 transitions. [2018-11-18 14:29:35,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2018-11-18 14:29:35,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:29:35,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:29:35,312 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 14:29:35,312 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:29:35,313 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 14:29:35,313 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 < 2; 950#L146 assume !(0 != ~ep12~0 % 256); 885#L146-2 assume !(0 != ~ep13~0 % 256); 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 14:29:35,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:35,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1251496387, now seen corresponding path program 3 times [2018-11-18 14:29:35,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:35,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:35,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:35,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:35,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:35,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash -421950566, now seen corresponding path program 1 times [2018-11-18 14:29:35,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:35,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:35,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:35,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:29:35,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:35,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:35,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1934907178, now seen corresponding path program 1 times [2018-11-18 14:29:35,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:35,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:35,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:35,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:35,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:35,424 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 14:29:35,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:29:35,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:29:35,642 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 100 [2018-11-18 14:29:35,726 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:29:35,726 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:29:35,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:29:35,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:29:35,727 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:29:35,727 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:29:35,727 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:29:35,727 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:29:35,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-18 14:29:35,727 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:29:35,727 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:29:35,745 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 14:29:35,760 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 14:29:35,764 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 14:29:35,767 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 14:29:35,773 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 14:29:35,774 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 14:29:35,777 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 14:29:35,778 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 14:29:35,786 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 14:29:35,793 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 14:29:35,795 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 14:29:35,797 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 14:29:35,798 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 14:29:35,800 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 14:29:35,801 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 14:29:35,804 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 14:29:35,805 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 14:29:35,808 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 14:29:35,810 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 14:29:35,825 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 14:29:35,827 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 14:29:35,828 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 14:29:35,829 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 14:29:35,830 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 14:29:35,832 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 14:29:35,833 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 14:29:36,101 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:29:36,102 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/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 14:29:36,111 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:29:36,111 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:29:36,128 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:29:36,128 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=-256} Honda state: {~ep12~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/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 14:29:36,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:29:36,149 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82dfd728-d890-4d1c-8092-7653b0e72d0b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:29:36,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:29:36,166 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:29:36,243 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:29:36,245 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:29:36,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:29:36,245 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:29:36,245 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:29:36,245 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:29:36,245 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:29:36,245 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:29:36,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:29:36,246 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-18 14:29:36,246 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:29:36,246 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:29:36,248 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 14:29:36,250 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 14:29:36,253 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 14:29:36,255 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 14:29:36,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:36,262 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 14:29:36,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:36,265 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 14:29:36,267 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 14:29:36,273 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 14:29:36,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:36,279 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 14:29:36,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:36,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:36,284 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 14:29:36,285 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 14:29:36,287 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 14:29:36,291 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 14:29:36,292 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 14:29:36,294 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 14:29:36,295 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 14:29:36,297 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 14:29:36,298 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 14:29:36,300 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 14:29:36,301 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 14:29:36,316 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 14:29:36,717 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:29:36,721 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:29:36,722 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 14:29:36,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:36,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:36,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:36,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:36,727 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 14:29:36,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:36,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:36,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:36,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:36,733 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 14:29:36,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:36,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:36,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:36,737 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 14:29:36,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:36,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:36,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:36,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:36,741 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 14:29:36,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:36,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:36,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:36,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:36,743 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 14:29:36,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:36,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:36,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:36,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:36,745 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 14:29:36,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:36,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:36,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:36,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:36,748 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 14:29:36,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:36,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:36,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:36,752 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 14:29:36,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:36,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:36,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:36,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:36,756 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 14:29:36,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:36,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:36,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:36,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:36,761 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 14:29:36,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:36,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:36,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:36,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:36,763 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 14:29:36,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:36,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:36,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:36,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:36,766 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 14:29:36,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:36,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:36,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:36,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:36,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:36,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:36,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:36,769 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:29:36,771 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:29:36,771 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 14:29:36,772 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:29:36,773 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 14:29:36,773 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:29:36,778 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 14:29:36,779 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 14:29:36,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:36,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:36,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:36,878 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 14:29:36,881 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 14:29:36,882 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 177 states and 260 transitions. cyclomatic complexity: 84 Second operand 4 states. [2018-11-18 14:29:36,930 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 14:29:36,931 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 14:29:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:29:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2018-11-18 14:29:36,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 43 letters. Loop has 30 letters. [2018-11-18 14:29:36,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:36,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 73 letters. Loop has 30 letters. [2018-11-18 14:29:36,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:36,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 43 letters. Loop has 60 letters. [2018-11-18 14:29:36,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:36,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 298 states and 447 transitions. [2018-11-18 14:29:36,939 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:29:36,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 298 states to 0 states and 0 transitions. [2018-11-18 14:29:36,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 14:29:36,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 14:29:36,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 14:29:36,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:29:36,939 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:29:36,939 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:29:36,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:29:36,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:29:36,940 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-18 14:29:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:29:36,940 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 14:29:36,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 14:29:36,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 14:29:36,940 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:29:36,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 14:29:36,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 14:29:36,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 14:29:36,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 14:29:36,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:29:36,941 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:29:36,941 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:29:36,941 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:29:36,941 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 14:29:36,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:29:36,941 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:29:36,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 14:29:36,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 02:29:36 BoogieIcfgContainer [2018-11-18 14:29:36,946 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 14:29:36,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:29:36,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:29:36,947 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:29:36,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:29:34" (3/4) ... [2018-11-18 14:29:36,950 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 14:29:36,950 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:29:36,950 INFO L168 Benchmark]: Toolchain (without parser) took 3332.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -74.0 MB). Peak memory consumption was 151.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:29:36,951 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:29:36,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -190.5 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:29:36,952 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:29:36,952 INFO L168 Benchmark]: Boogie Preprocessor took 26.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:29:36,952 INFO L168 Benchmark]: RCFGBuilder took 482.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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:29:36,953 INFO L168 Benchmark]: BuchiAutomizer took 2461.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.2 MB). Peak memory consumption was 127.9 MB. Max. memory is 11.5 GB. [2018-11-18 14:29:36,955 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:29:36,957 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -190.5 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 482.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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2461.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.2 MB). Peak memory consumption was 127.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.12 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.1s. 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: 771 SDtfs, 248 SDslu, 1233 SDs, 0 SdLazy, 39 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax125 hnf105 lsp20 ukn100 mio100 lsp100 div128 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...