./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.1.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_29f9ad7b-89bc-4c6f-85f2-639493c087a3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/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 abf77f97875b3c7e87b90b0cc41c08fea68d8fc2 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:40:16,292 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:40:16,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:40:16,302 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:40:16,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:40:16,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:40:16,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:40:16,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:40:16,307 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:40:16,308 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:40:16,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:40:16,308 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:40:16,315 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:40:16,316 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:40:16,317 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:40:16,318 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:40:16,318 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:40:16,320 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:40:16,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:40:16,326 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:40:16,327 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:40:16,328 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:40:16,331 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:40:16,332 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:40:16,332 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:40:16,333 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:40:16,334 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:40:16,335 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:40:16,335 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:40:16,336 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:40:16,336 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:40:16,337 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:40:16,337 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:40:16,337 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:40:16,338 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:40:16,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:40:16,338 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 15:40:16,350 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:40:16,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:40:16,352 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:40:16,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:40:16,353 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:40:16,353 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:40:16,353 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:40:16,353 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:40:16,354 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:40:16,354 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:40:16,354 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:40:16,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:40:16,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:40:16,354 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:40:16,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:40:16,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:40:16,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:40:16,355 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:40:16,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:40:16,355 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:40:16,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:40:16,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:40:16,355 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:40:16,355 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:40:16,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:40:16,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:40:16,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:40:16,356 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:40:16,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:40:16,356 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:40:16,356 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:40:16,357 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:40:16,357 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_29f9ad7b-89bc-4c6f-85f2-639493c087a3/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 -> abf77f97875b3c7e87b90b0cc41c08fea68d8fc2 [2018-11-18 15:40:16,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:40:16,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:40:16,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:40:16,413 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:40:16,414 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:40:16,414 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 15:40:16,492 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/bin-2019/uautomizer/data/9a55f4ab0/385b62c49cce4a63a358786133f46781/FLAG692472d02 [2018-11-18 15:40:16,888 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:40:16,889 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 15:40:16,896 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/bin-2019/uautomizer/data/9a55f4ab0/385b62c49cce4a63a358786133f46781/FLAG692472d02 [2018-11-18 15:40:17,265 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/bin-2019/uautomizer/data/9a55f4ab0/385b62c49cce4a63a358786133f46781 [2018-11-18 15:40:17,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:40:17,269 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:40:17,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:40:17,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:40:17,273 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:40:17,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:40:17" (1/1) ... [2018-11-18 15:40:17,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22fd3e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17, skipping insertion in model container [2018-11-18 15:40:17,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:40:17" (1/1) ... [2018-11-18 15:40:17,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:40:17,321 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:40:17,528 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:40:17,543 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:40:17,588 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:40:17,602 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:40:17,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17 WrapperNode [2018-11-18 15:40:17,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:40:17,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:40:17,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:40:17,603 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:40:17,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17" (1/1) ... [2018-11-18 15:40:17,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17" (1/1) ... [2018-11-18 15:40:17,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:40:17,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:40:17,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:40:17,686 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:40:17,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17" (1/1) ... [2018-11-18 15:40:17,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17" (1/1) ... [2018-11-18 15:40:17,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17" (1/1) ... [2018-11-18 15:40:17,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17" (1/1) ... [2018-11-18 15:40:17,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17" (1/1) ... [2018-11-18 15:40:17,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17" (1/1) ... [2018-11-18 15:40:17,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17" (1/1) ... [2018-11-18 15:40:17,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:40:17,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:40:17,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:40:17,712 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:40:17,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/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 15:40:17,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:40:17,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:40:18,223 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:40:18,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:40:18 BoogieIcfgContainer [2018-11-18 15:40:18,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:40:18,224 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:40:18,224 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:40:18,227 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:40:18,227 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:40:18,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:40:17" (1/3) ... [2018-11-18 15:40:18,228 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b51c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:40:18, skipping insertion in model container [2018-11-18 15:40:18,228 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:40:18,228 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:17" (2/3) ... [2018-11-18 15:40:18,229 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b51c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:40:18, skipping insertion in model container [2018-11-18 15:40:18,229 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:40:18,229 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:40:18" (3/3) ... [2018-11-18 15:40:18,230 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 15:40:18,265 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:40:18,266 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:40:18,266 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:40:18,266 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:40:18,266 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:40:18,266 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:40:18,266 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:40:18,267 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:40:18,267 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:40:18,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2018-11-18 15:40:18,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-18 15:40:18,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:18,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:18,314 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:40:18,314 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 15:40:18,314 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:40:18,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2018-11-18 15:40:18,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-18 15:40:18,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:18,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:18,317 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:40:18,317 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 15:40:18,322 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 14#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~ret22, main_#t~ret23, main_#t~post24, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~alive1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive3~0 := main_#t~nondet21;havoc main_#t~nondet21;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 61#L207true assume !(0 == ~r1~0);init_~tmp~0 := 0; 77#L207-1true init_#res := init_~tmp~0; 52#L276true main_#t~ret22 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret22;havoc main_#t~ret22;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 55#L331-3true [2018-11-18 15:40:18,323 INFO L796 eck$LassoCheckResult]: Loop: 55#L331-3true assume true; 71#L331-1true assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 6#L102true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 36#L106true assume !(node1_~m1~0 != ~nomsg~0); 11#L106-1true ~mode1~0 := 0; 24#L102-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 39#L139true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 23#L142true assume !(node2_~m2~0 != ~nomsg~0); 21#L142-1true ~mode2~0 := 0; 12#L139-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 59#L173true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 27#L176true assume !(node3_~m3~0 != ~nomsg~0); 26#L176-1true ~mode3~0 := 0; 57#L173-2true assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 66#L284true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 64#L284-1true check_#res := check_~tmp~1; 9#L296true main_#t~ret23 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret23;havoc main_#t~ret23;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; 28#L355true assume !(0 == assert_~arg % 256); 74#L350true assume { :end_inline_assert } true;main_#t~post24 := main_~i2~0;main_~i2~0 := 1 + main_#t~post24;havoc main_#t~post24; 55#L331-3true [2018-11-18 15:40:18,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:18,327 INFO L82 PathProgramCache]: Analyzing trace with hash 28791078, now seen corresponding path program 1 times [2018-11-18 15:40:18,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:18,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:18,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:18,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:18,475 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 15:40:18,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:18,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:40:18,481 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:40:18,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:18,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1798022383, now seen corresponding path program 1 times [2018-11-18 15:40:18,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:18,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:18,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:18,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:18,556 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 15:40:18,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:18,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:40:18,557 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:40:18,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:40:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:40:18,568 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 4 states. [2018-11-18 15:40:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:18,652 INFO L93 Difference]: Finished difference Result 79 states and 125 transitions. [2018-11-18 15:40:18,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:40:18,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 125 transitions. [2018-11-18 15:40:18,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 15:40:18,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 72 states and 102 transitions. [2018-11-18 15:40:18,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-18 15:40:18,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-18 15:40:18,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 102 transitions. [2018-11-18 15:40:18,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:40:18,666 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-18 15:40:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 102 transitions. [2018-11-18 15:40:18,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-18 15:40:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 15:40:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2018-11-18 15:40:18,689 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-18 15:40:18,689 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-18 15:40:18,689 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:40:18,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2018-11-18 15:40:18,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 15:40:18,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:18,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:18,692 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] [2018-11-18 15:40:18,692 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 15:40:18,692 INFO L794 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 197#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~ret22, main_#t~ret23, main_#t~post24, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~alive1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive3~0 := main_#t~nondet21;havoc main_#t~nondet21;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 198#L207 assume 0 == ~r1~0; 171#L208 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 172#L209 assume ~id1~0 >= 0; 214#L210 assume 0 == ~st1~0; 231#L211 assume ~send1~0 == ~id1~0; 193#L212 assume 0 == ~mode1~0 % 256; 194#L213 assume ~id2~0 >= 0; 235#L214 assume 0 == ~st2~0; 202#L215 assume ~send2~0 == ~id2~0; 203#L216 assume 0 == ~mode2~0 % 256; 226#L217 assume ~id3~0 >= 0; 239#L218 assume 0 == ~st3~0; 175#L219 assume ~send3~0 == ~id3~0; 176#L220 assume 0 == ~mode3~0 % 256; 215#L221 assume ~id1~0 != ~id2~0; 232#L222 assume ~id1~0 != ~id3~0; 220#L223 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 221#L207-1 init_#res := init_~tmp~0; 233#L276 main_#t~ret22 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret22;havoc main_#t~ret22;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 234#L331-3 [2018-11-18 15:40:18,692 INFO L796 eck$LassoCheckResult]: Loop: 234#L331-3 assume true; 237#L331-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 177#L102 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 179#L106 assume !(node1_~m1~0 != ~nomsg~0); 191#L106-1 ~mode1~0 := 0; 192#L102-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 207#L139 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 205#L142 assume !(node2_~m2~0 != ~nomsg~0); 204#L142-1 ~mode2~0 := 0; 189#L139-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 190#L173 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 210#L176 assume !(node3_~m3~0 != ~nomsg~0); 209#L176-1 ~mode3~0 := 0; 196#L173-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 236#L284 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 182#L284-1 check_#res := check_~tmp~1; 184#L296 main_#t~ret23 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret23;havoc main_#t~ret23;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; 185#L355 assume !(0 == assert_~arg % 256); 212#L350 assume { :end_inline_assert } true;main_#t~post24 := main_~i2~0;main_~i2~0 := 1 + main_#t~post24;havoc main_#t~post24; 234#L331-3 [2018-11-18 15:40:18,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:18,693 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 1 times [2018-11-18 15:40:18,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:18,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:18,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:18,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1798022383, now seen corresponding path program 2 times [2018-11-18 15:40:18,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:18,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:18,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:18,830 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 15:40:18,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:18,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:40:18,831 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:40:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:40:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:40:18,831 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 31 Second operand 5 states. [2018-11-18 15:40:18,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:18,907 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-11-18 15:40:18,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:40:18,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 104 transitions. [2018-11-18 15:40:18,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 15:40:18,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 72 states and 100 transitions. [2018-11-18 15:40:18,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-18 15:40:18,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-18 15:40:18,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 100 transitions. [2018-11-18 15:40:18,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:40:18,911 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 100 transitions. [2018-11-18 15:40:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 100 transitions. [2018-11-18 15:40:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-18 15:40:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 15:40:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2018-11-18 15:40:18,916 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 100 transitions. [2018-11-18 15:40:18,916 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 100 transitions. [2018-11-18 15:40:18,916 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:40:18,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 100 transitions. [2018-11-18 15:40:18,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 15:40:18,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:18,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:18,918 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] [2018-11-18 15:40:18,918 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] [2018-11-18 15:40:18,918 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 356#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~ret22, main_#t~ret23, main_#t~post24, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~alive1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive3~0 := main_#t~nondet21;havoc main_#t~nondet21;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 357#L207 assume 0 == ~r1~0; 330#L208 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 331#L209 assume ~id1~0 >= 0; 373#L210 assume 0 == ~st1~0; 390#L211 assume ~send1~0 == ~id1~0; 352#L212 assume 0 == ~mode1~0 % 256; 353#L213 assume ~id2~0 >= 0; 394#L214 assume 0 == ~st2~0; 361#L215 assume ~send2~0 == ~id2~0; 362#L216 assume 0 == ~mode2~0 % 256; 385#L217 assume ~id3~0 >= 0; 398#L218 assume 0 == ~st3~0; 332#L219 assume ~send3~0 == ~id3~0; 333#L220 assume 0 == ~mode3~0 % 256; 374#L221 assume ~id1~0 != ~id2~0; 391#L222 assume ~id1~0 != ~id3~0; 379#L223 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 380#L207-1 init_#res := init_~tmp~0; 392#L276 main_#t~ret22 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret22;havoc main_#t~ret22;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 393#L331-3 [2018-11-18 15:40:18,919 INFO L796 eck$LassoCheckResult]: Loop: 393#L331-3 assume true; 395#L331-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 336#L102 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 338#L106 assume !(node1_~m1~0 != ~nomsg~0); 348#L106-1 ~mode1~0 := 0; 349#L102-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 366#L139 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 364#L142 assume !(node2_~m2~0 != ~nomsg~0); 363#L142-1 ~mode2~0 := 0; 350#L139-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 351#L173 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 369#L176 assume !(node3_~m3~0 != ~nomsg~0); 368#L176-1 ~mode3~0 := 0; 355#L173-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 397#L284 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 340#L285 assume ~r1~0 < 3;check_~tmp~1 := 1; 341#L284-1 check_#res := check_~tmp~1; 343#L296 main_#t~ret23 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret23;havoc main_#t~ret23;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; 344#L355 assume !(0 == assert_~arg % 256); 371#L350 assume { :end_inline_assert } true;main_#t~post24 := main_~i2~0;main_~i2~0 := 1 + main_#t~post24;havoc main_#t~post24; 393#L331-3 [2018-11-18 15:40:18,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:18,919 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 2 times [2018-11-18 15:40:18,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:18,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:18,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:40:18,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:18,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:18,954 INFO L82 PathProgramCache]: Analyzing trace with hash -287446291, now seen corresponding path program 1 times [2018-11-18 15:40:18,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:18,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:18,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:40:18,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:18,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:18,986 INFO L82 PathProgramCache]: Analyzing trace with hash 600424136, now seen corresponding path program 1 times [2018-11-18 15:40:18,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:18,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:18,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:18,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:18,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:19,052 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 15:40:19,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:19,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:40:19,427 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2018-11-18 15:40:19,870 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-11-18 15:40:19,877 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:40:19,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:40:19,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:40:19,878 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:40:19,878 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 15:40:19,879 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:40:19,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:40:19,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:40:19,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2018-11-18 15:40:19,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:40:19,879 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:40:19,898 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 15:40:19,921 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 15:40:19,926 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 15:40:19,928 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 15:40:19,929 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 15:40:19,931 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 15:40:19,945 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 15:40:19,946 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 15:40:19,950 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 15:40:19,951 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 15:40:19,953 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 15:40:19,982 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 15:40:19,984 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 15:40:19,992 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 15:40:19,994 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 15:40:19,996 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 15:40:19,998 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 15:40:19,999 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 15:40:20,006 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 15:40:20,007 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 15:40:20,012 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 15:40:20,013 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 15:40:20,015 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 15:40:20,449 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:40:20,450 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/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 15:40:20,454 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:20,454 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29f9ad7b-89bc-4c6f-85f2-639493c087a3/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 15:40:20,476 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 15:40:20,476 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:20,575 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 15:40:20,577 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:40:20,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:40:20,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:40:20,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:40:20,577 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:40:20,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:40:20,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:40:20,577 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:40:20,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2018-11-18 15:40:20,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:40:20,578 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:40:20,580 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 15:40:20,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:40:20,601 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 15:40:20,604 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 15:40:20,606 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 15:40:20,607 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 15:40:20,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:40:20,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:40:20,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:40:20,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:40:20,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:40:20,628 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 15:40:20,630 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 15:40:20,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:40:20,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:40:20,722 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 15:40:20,724 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 15:40:20,729 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 15:40:20,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:40:20,733 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 15:40:20,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:40:20,735 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 15:40:20,740 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 15:40:21,016 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:40:21,019 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:40:21,020 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 15:40:21,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,027 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 15:40:21,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,031 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 15:40:21,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:21,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:40:21,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,036 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 15:40:21,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,038 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 15:40:21,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,040 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 15:40:21,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:21,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:40:21,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,045 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 15:40:21,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:21,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:40:21,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,052 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 15:40:21,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,054 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 15:40:21,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,057 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 15:40:21,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,072 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 15:40:21,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:21,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:40:21,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,077 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 15:40:21,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,079 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 15:40:21,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,079 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:21,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,080 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:21,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,091 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 15:40:21,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,093 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 15:40:21,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,100 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 15:40:21,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,106 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 15:40:21,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:21,112 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 15:40:21,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:21,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:21,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:21,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:21,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:21,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:21,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:21,115 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:40:21,118 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 15:40:21,118 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 15:40:21,120 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:40:21,120 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 15:40:21,120 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:40:21,121 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 15:40:21,123 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 15:40:21,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:21,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:40:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:21,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:40:21,198 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 15:40:21,200 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 15:40:21,201 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 100 transitions. cyclomatic complexity: 29 Second operand 4 states. [2018-11-18 15:40:21,236 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 100 transitions. cyclomatic complexity: 29. Second operand 4 states. Result 123 states and 180 transitions. Complement of second has 6 states. [2018-11-18 15:40:21,237 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 15:40:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:40:21,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2018-11-18 15:40:21,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 21 letters. Loop has 20 letters. [2018-11-18 15:40:21,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:40:21,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 41 letters. Loop has 20 letters. [2018-11-18 15:40:21,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:40:21,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 21 letters. Loop has 40 letters. [2018-11-18 15:40:21,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:40:21,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 180 transitions. [2018-11-18 15:40:21,245 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:40:21,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 0 states and 0 transitions. [2018-11-18 15:40:21,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:40:21,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:40:21,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:40:21,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:40:21,246 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:40:21,246 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:40:21,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:40:21,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:40:21,246 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-18 15:40:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:21,246 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 15:40:21,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:40:21,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 15:40:21,247 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:40:21,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 15:40:21,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:40:21,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:40:21,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:40:21,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:40:21,247 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:40:21,247 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:40:21,247 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:40:21,248 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:40:21,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:40:21,248 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:40:21,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 15:40:21,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:40:21 BoogieIcfgContainer [2018-11-18 15:40:21,252 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:40:21,252 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:40:21,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:40:21,252 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:40:21,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:40:18" (3/4) ... [2018-11-18 15:40:21,255 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 15:40:21,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:40:21,255 INFO L168 Benchmark]: Toolchain (without parser) took 3987.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -62.8 MB). Peak memory consumption was 152.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:21,256 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:40:21,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.79 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:21,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 943.1 MB in the beginning and 1.2 GB in the end (delta: -213.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:21,257 INFO L168 Benchmark]: Boogie Preprocessor took 25.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:21,258 INFO L168 Benchmark]: RCFGBuilder took 512.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:21,258 INFO L168 Benchmark]: BuchiAutomizer took 3027.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.1 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:21,259 INFO L168 Benchmark]: Witness Printer took 2.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:40:21,261 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.79 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 943.1 MB in the beginning and 1.2 GB in the end (delta: -213.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 512.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3027.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.1 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.91 ms. Allocated memory is still 1.2 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 72 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 321 SDtfs, 101 SDslu, 597 SDs, 0 SdLazy, 22 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital215 mio100 ax117 hnf104 lsp22 ukn65 mio100 lsp100 div173 bol100 ite100 ukn100 eq151 hnf74 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...