./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/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 9617a298e8318064de96aca26d3538590248ba76 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:39:15,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:39:15,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:39:15,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:39:15,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:39:15,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:39:15,331 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:39:15,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:39:15,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:39:15,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:39:15,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:39:15,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:39:15,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:39:15,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:39:15,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:39:15,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:39:15,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:39:15,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:39:15,341 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:39:15,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:39:15,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:39:15,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:39:15,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:39:15,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:39:15,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:39:15,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:39:15,347 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:39:15,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:39:15,348 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:39:15,349 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:39:15,349 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:39:15,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:39:15,350 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:39:15,350 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:39:15,351 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:39:15,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:39:15,351 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:39:15,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:39:15,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:39:15,364 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:39:15,364 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:39:15,364 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:39:15,364 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:39:15,364 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:39:15,364 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:39:15,365 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:39:15,365 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:39:15,365 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:39:15,365 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:39:15,366 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:39:15,366 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:39:15,366 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:39:15,366 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:39:15,366 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:39:15,366 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:39:15,366 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:39:15,367 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:39:15,367 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:39:15,367 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:39:15,367 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:39:15,367 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:39:15,367 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:39:15,367 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:39:15,367 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:39:15,368 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:39:15,368 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:39:15,368 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:39:15,369 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:39:15,370 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_748c5377-da88-4cc7-8b19-7f9438e7c424/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 -> 9617a298e8318064de96aca26d3538590248ba76 [2018-11-10 12:39:15,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:39:15,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:39:15,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:39:15,409 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:39:15,409 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:39:15,410 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 12:39:15,452 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/bin-2019/uautomizer/data/d6fe9bd3f/ed30fb84c96c4087b5ac6a4540c3a867/FLAGf41dc564b [2018-11-10 12:39:15,770 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:39:15,770 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 12:39:15,775 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/bin-2019/uautomizer/data/d6fe9bd3f/ed30fb84c96c4087b5ac6a4540c3a867/FLAGf41dc564b [2018-11-10 12:39:15,787 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/bin-2019/uautomizer/data/d6fe9bd3f/ed30fb84c96c4087b5ac6a4540c3a867 [2018-11-10 12:39:15,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:39:15,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:39:15,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:39:15,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:39:15,793 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:39:15,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:39:15" (1/1) ... [2018-11-10 12:39:15,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49867e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:15, skipping insertion in model container [2018-11-10 12:39:15,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:39:15" (1/1) ... [2018-11-10 12:39:15,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:39:15,831 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:39:15,978 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:39:15,984 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:39:16,019 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:39:16,030 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:39:16,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:16 WrapperNode [2018-11-10 12:39:16,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:39:16,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:39:16,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:39:16,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:39:16,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:16" (1/1) ... [2018-11-10 12:39:16,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:16" (1/1) ... [2018-11-10 12:39:16,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:39:16,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:39:16,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:39:16,099 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:39:16,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:16" (1/1) ... [2018-11-10 12:39:16,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:16" (1/1) ... [2018-11-10 12:39:16,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:16" (1/1) ... [2018-11-10 12:39:16,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:16" (1/1) ... [2018-11-10 12:39:16,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:16" (1/1) ... [2018-11-10 12:39:16,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:16" (1/1) ... [2018-11-10 12:39:16,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:16" (1/1) ... [2018-11-10 12:39:16,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:39:16,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:39:16,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:39:16,125 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:39:16,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/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-10 12:39:16,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:39:16,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:39:16,550 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:39:16,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:39:16 BoogieIcfgContainer [2018-11-10 12:39:16,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:39:16,551 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:39:16,551 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:39:16,553 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:39:16,554 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:39:16,554 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:39:15" (1/3) ... [2018-11-10 12:39:16,555 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42df3c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:39:16, skipping insertion in model container [2018-11-10 12:39:16,555 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:39:16,555 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:39:16" (2/3) ... [2018-11-10 12:39:16,555 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42df3c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:39:16, skipping insertion in model container [2018-11-10 12:39:16,555 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:39:16,555 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:39:16" (3/3) ... [2018-11-10 12:39:16,557 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 12:39:16,590 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:39:16,590 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:39:16,590 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:39:16,590 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:39:16,590 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:39:16,591 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:39:16,591 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:39:16,591 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:39:16,591 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:39:16,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states. [2018-11-10 12:39:16,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-10 12:39:16,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:39:16,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:39:16,627 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:39:16,627 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:39:16,627 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:39:16,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states. [2018-11-10 12:39:16,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-10 12:39:16,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:39:16,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:39:16,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:39:16,632 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:39:16,637 INFO L793 eck$LassoCheckResult]: Stem: 70#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;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~alive1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id2~0 := main_#t~nondet14;havoc main_#t~nondet14;~st2~0 := main_#t~nondet15;havoc main_#t~nondet15;~send2~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode2~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive4~0 := main_#t~nondet28;havoc main_#t~nondet28;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 98#L247true assume !(~r1~0 == 0);init_~tmp~0 := 0; 97#L247-1true init_#res := init_~tmp~0; 64#L344true main_#t~ret29 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29;assume main_~i2~0 != 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 10#L406-3true [2018-11-10 12:39:16,637 INFO L795 eck$LassoCheckResult]: Loop: 10#L406-3true assume true; 20#L406-1true assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 76#L110true assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 18#L114true assume !(node1_~m1~0 != ~nomsg~0); 16#L114-1true ~mode1~0 := 0; 73#L110-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; 92#L145true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 83#L148true assume !(node2_~m2~0 != ~nomsg~0); 81#L148-1true ~mode2~0 := 0; 90#L145-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; 52#L179true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 56#L182true assume !(node3_~m3~0 != ~nomsg~0); 54#L182-1true ~mode3~0 := 0; 50#L179-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 35#L213true assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 25#L216true assume !(node4_~m4~0 != ~nomsg~0); 24#L216-1true ~mode4~0 := 0; 19#L213-2true assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 82#L352true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 84#L352-1true check_#res := check_~tmp~1; 43#L364true main_#t~ret30 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 38#L433true assume !(assert_~arg % 256 == 0); 17#L428true assume { :end_inline_assert } true;main_#t~post31 := main_~i2~0;main_~i2~0 := main_#t~post31 + 1;havoc main_#t~post31; 10#L406-3true [2018-11-10 12:39:16,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:16,641 INFO L82 PathProgramCache]: Analyzing trace with hash 28832784, now seen corresponding path program 1 times [2018-11-10 12:39:16,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:39:16,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:39:16,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:16,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:16,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:16,755 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-10 12:39:16,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:16,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:16,759 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:39:16,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:16,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1675126752, now seen corresponding path program 1 times [2018-11-10 12:39:16,759 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:39:16,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:39:16,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:16,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:16,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:16,836 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-10 12:39:16,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:16,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:39:16,837 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:39:16,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:39:16,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:39:16,848 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 4 states. [2018-11-10 12:39:16,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:16,922 INFO L93 Difference]: Finished difference Result 100 states and 162 transitions. [2018-11-10 12:39:16,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:39:16,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 162 transitions. [2018-11-10 12:39:16,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2018-11-10 12:39:16,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 93 states and 132 transitions. [2018-11-10 12:39:16,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2018-11-10 12:39:16,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2018-11-10 12:39:16,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 132 transitions. [2018-11-10 12:39:16,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:39:16,934 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 132 transitions. [2018-11-10 12:39:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 132 transitions. [2018-11-10 12:39:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-10 12:39:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 12:39:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2018-11-10 12:39:16,963 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 132 transitions. [2018-11-10 12:39:16,963 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 132 transitions. [2018-11-10 12:39:16,963 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:39:16,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 132 transitions. [2018-11-10 12:39:16,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2018-11-10 12:39:16,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:39:16,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:39:16,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:39:16,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:39:16,969 INFO L793 eck$LassoCheckResult]: Stem: 272#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;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 229#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~alive1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id2~0 := main_#t~nondet14;havoc main_#t~nondet14;~st2~0 := main_#t~nondet15;havoc main_#t~nondet15;~send2~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode2~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive4~0 := main_#t~nondet28;havoc main_#t~nondet28;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 230#L247 assume ~r1~0 == 0; 244#L248 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 245#L249 assume ~id1~0 >= 0; 282#L250 assume ~st1~0 == 0; 286#L251 assume ~send1~0 == ~id1~0; 220#L252 assume ~mode1~0 % 256 == 0; 221#L253 assume ~id2~0 >= 0; 264#L254 assume ~st2~0 == 0; 231#L255 assume ~send2~0 == ~id2~0; 232#L256 assume ~mode2~0 % 256 == 0; 273#L257 assume ~id3~0 >= 0; 297#L258 assume ~st3~0 == 0; 246#L259 assume ~send3~0 == ~id3~0; 247#L260 assume ~mode3~0 % 256 == 0; 283#L261 assume ~id4~0 >= 0; 287#L262 assume ~st4~0 == 0; 222#L263 assume ~send4~0 == ~id4~0; 223#L264 assume ~mode4~0 % 256 == 0; 265#L265 assume ~id1~0 != ~id2~0; 233#L266 assume ~id1~0 != ~id3~0; 234#L267 assume ~id1~0 != ~id4~0; 274#L268 assume ~id2~0 != ~id3~0; 298#L269 assume ~id2~0 != ~id4~0; 251#L270 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 252#L247-1 init_#res := init_~tmp~0; 258#L344 main_#t~ret29 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29;assume main_~i2~0 != 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 239#L406-3 [2018-11-10 12:39:16,969 INFO L795 eck$LassoCheckResult]: Loop: 239#L406-3 assume true; 240#L406-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 268#L110 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 262#L114 assume !(node1_~m1~0 != ~nomsg~0); 260#L114-1 ~mode1~0 := 0; 243#L110-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; 275#L145 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 294#L148 assume !(node2_~m2~0 != ~nomsg~0); 237#L148-1 ~mode2~0 := 0; 281#L145-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; 226#L179 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 228#L182 assume !(node3_~m3~0 != ~nomsg~0); 238#L182-1 ~mode3~0 := 0; 218#L179-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 219#L213 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 279#L216 assume !(node4_~m4~0 != ~nomsg~0); 277#L216-1 ~mode4~0 := 0; 266#L213-2 assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 267#L352 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 285#L352-1 check_#res := check_~tmp~1; 295#L364 main_#t~ret30 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 301#L433 assume !(assert_~arg % 256 == 0); 261#L428 assume { :end_inline_assert } true;main_#t~post31 := main_~i2~0;main_~i2~0 := main_#t~post31 + 1;havoc main_#t~post31; 239#L406-3 [2018-11-10 12:39:16,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:16,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1386311927, now seen corresponding path program 1 times [2018-11-10 12:39:16,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:39:16,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:39:16,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:16,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:16,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:39:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:39:17,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:17,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1675126752, now seen corresponding path program 2 times [2018-11-10 12:39:17,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:39:17,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:39:17,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:17,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:17,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:17,103 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-10 12:39:17,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:17,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:39:17,104 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:39:17,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:39:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:39:17,104 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. cyclomatic complexity: 40 Second operand 5 states. [2018-11-10 12:39:17,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:17,140 INFO L93 Difference]: Finished difference Result 96 states and 134 transitions. [2018-11-10 12:39:17,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:39:17,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 134 transitions. [2018-11-10 12:39:17,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2018-11-10 12:39:17,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 93 states and 130 transitions. [2018-11-10 12:39:17,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2018-11-10 12:39:17,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2018-11-10 12:39:17,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 130 transitions. [2018-11-10 12:39:17,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:39:17,144 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 130 transitions. [2018-11-10 12:39:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 130 transitions. [2018-11-10 12:39:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-10 12:39:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 12:39:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2018-11-10 12:39:17,149 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 130 transitions. [2018-11-10 12:39:17,149 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 130 transitions. [2018-11-10 12:39:17,149 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:39:17,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 130 transitions. [2018-11-10 12:39:17,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2018-11-10 12:39:17,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:39:17,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:39:17,152 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:39:17,152 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:39:17,152 INFO L793 eck$LassoCheckResult]: Stem: 471#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;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 430#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~alive1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id2~0 := main_#t~nondet14;havoc main_#t~nondet14;~st2~0 := main_#t~nondet15;havoc main_#t~nondet15;~send2~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode2~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive4~0 := main_#t~nondet28;havoc main_#t~nondet28;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 431#L247 assume ~r1~0 == 0; 445#L248 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 446#L249 assume ~id1~0 >= 0; 483#L250 assume ~st1~0 == 0; 487#L251 assume ~send1~0 == ~id1~0; 421#L252 assume ~mode1~0 % 256 == 0; 422#L253 assume ~id2~0 >= 0; 465#L254 assume ~st2~0 == 0; 432#L255 assume ~send2~0 == ~id2~0; 433#L256 assume ~mode2~0 % 256 == 0; 472#L257 assume ~id3~0 >= 0; 498#L258 assume ~st3~0 == 0; 447#L259 assume ~send3~0 == ~id3~0; 448#L260 assume ~mode3~0 % 256 == 0; 484#L261 assume ~id4~0 >= 0; 488#L262 assume ~st4~0 == 0; 423#L263 assume ~send4~0 == ~id4~0; 424#L264 assume ~mode4~0 % 256 == 0; 466#L265 assume ~id1~0 != ~id2~0; 434#L266 assume ~id1~0 != ~id3~0; 435#L267 assume ~id1~0 != ~id4~0; 475#L268 assume ~id2~0 != ~id3~0; 499#L269 assume ~id2~0 != ~id4~0; 452#L270 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 453#L247-1 init_#res := init_~tmp~0; 460#L344 main_#t~ret29 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29;assume main_~i2~0 != 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 440#L406-3 [2018-11-10 12:39:17,153 INFO L795 eck$LassoCheckResult]: Loop: 440#L406-3 assume true; 441#L406-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 469#L110 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 463#L114 assume !(node1_~m1~0 != ~nomsg~0); 461#L114-1 ~mode1~0 := 0; 444#L110-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; 476#L145 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 496#L148 assume !(node2_~m2~0 != ~nomsg~0); 438#L148-1 ~mode2~0 := 0; 482#L145-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; 427#L179 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 429#L182 assume !(node3_~m3~0 != ~nomsg~0); 439#L182-1 ~mode3~0 := 0; 419#L179-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 420#L213 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 480#L216 assume !(node4_~m4~0 != ~nomsg~0); 477#L216-1 ~mode4~0 := 0; 467#L213-2 assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 468#L352 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 493#L353 assume ~r1~0 < 4;check_~tmp~1 := 1; 486#L352-1 check_#res := check_~tmp~1; 495#L364 main_#t~ret30 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 500#L433 assume !(assert_~arg % 256 == 0); 462#L428 assume { :end_inline_assert } true;main_#t~post31 := main_~i2~0;main_~i2~0 := main_#t~post31 + 1;havoc main_#t~post31; 440#L406-3 [2018-11-10 12:39:17,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1386311927, now seen corresponding path program 2 times [2018-11-10 12:39:17,153 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:39:17,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:39:17,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:17,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:39:17,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:39:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:39:17,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:17,190 INFO L82 PathProgramCache]: Analyzing trace with hash -772648926, now seen corresponding path program 1 times [2018-11-10 12:39:17,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:39:17,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:39:17,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:17,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:39:17,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:39:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:39:17,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:17,213 INFO L82 PathProgramCache]: Analyzing trace with hash -506050774, now seen corresponding path program 1 times [2018-11-10 12:39:17,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:39:17,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:39:17,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:17,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:39:17,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:39:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:17,261 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-10 12:39:17,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:39:17,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:39:17,493 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 117 [2018-11-10 12:39:17,898 WARN L179 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 102 [2018-11-10 12:39:17,906 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:39:17,906 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:39:17,907 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:39:17,907 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:39:17,907 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:39:17,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:39:17,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:39:17,907 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:39:17,908 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-11-10 12:39:17,908 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:39:17,908 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:39:17,925 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-10 12:39:17,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-10 12:39:17,932 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-10 12:39:17,934 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-10 12:39:17,935 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-10 12:39:17,938 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-10 12:39:17,940 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-10 12:39:17,964 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-10 12:39:17,968 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-10 12:39:17,970 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-10 12:39:17,971 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-10 12:39:17,973 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-10 12:39:17,975 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-10 12:39:17,979 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-10 12:39:17,980 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-10 12:39:18,002 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-10 12:39:18,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-10 12:39:18,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-10 12:39:18,009 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-10 12:39:18,011 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-10 12:39:18,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-10 12:39:18,018 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-10 12:39:18,019 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-10 12:39:18,022 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-10 12:39:18,025 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-10 12:39:18,027 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-10 12:39:18,040 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-10 12:39:18,042 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-10 12:39:18,354 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:39:18,355 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/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-10 12:39:18,358 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:39:18,358 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_748c5377-da88-4cc7-8b19-7f9438e7c424/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-10 12:39:18,381 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:39:18,381 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:39:18,500 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:39:18,502 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:39:18,502 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:39:18,502 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:39:18,502 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:39:18,502 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:39:18,502 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:39:18,502 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:39:18,502 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:39:18,502 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-11-10 12:39:18,502 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:39:18,502 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:39:18,507 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-10 12:39:18,517 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-10 12:39:18,521 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-10 12:39:18,522 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-10 12:39:18,523 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-10 12:39:18,525 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-10 12:39:18,528 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-10 12:39:18,530 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-10 12:39:18,552 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-10 12:39:18,554 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-10 12:39:18,555 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-10 12:39:18,557 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-10 12:39:18,558 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-10 12:39:18,559 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-10 12:39:18,560 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-10 12:39:18,563 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-10 12:39:18,564 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-10 12:39:18,565 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-10 12:39:18,568 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-10 12:39:18,570 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-10 12:39:18,572 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-10 12:39:18,573 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-10 12:39:18,588 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-10 12:39:18,589 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-10 12:39:18,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:39:18,596 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-10 12:39:18,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-10 12:39:18,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:39:18,910 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:39:18,913 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:39:18,914 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-10 12:39:18,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:39:18,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:39:18,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:39:18,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:39:18,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:39:18,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:39:18,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:39:18,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:39:18,922 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-10 12:39:18,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:39:18,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:39:18,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:39:18,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:39:18,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:39:18,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:39:18,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:39:18,929 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-10 12:39:18,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:39:18,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:39:18,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:39:18,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:39:18,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:39:18,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:39:18,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:39:18,931 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:39:18,931 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-10 12:39:18,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:39:18,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:39:18,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:39:18,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:39:18,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:39:18,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:39:18,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:39:18,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:39:18,938 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-10 12:39:18,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:39:18,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:39:18,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:39:18,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:39:18,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:39:18,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:39:18,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:39:18,944 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-10 12:39:18,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:39:18,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:39:18,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:39:18,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:39:18,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:39:18,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:39:18,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:39:18,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:39:18,948 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-10 12:39:18,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:39:18,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:39:18,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:39:18,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:39:18,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:39:18,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:39:18,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:39:18,952 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-10 12:39:18,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:39:18,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:39:18,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:39:18,956 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:39:18,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:39:18,957 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:39:18,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:39:18,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:39:18,961 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-10 12:39:18,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:39:18,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:39:18,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:39:18,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:39:18,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:39:18,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:39:18,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:39:18,967 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-10 12:39:18,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:39:18,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:39:18,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:39:18,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:39:18,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:39:18,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:39:18,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:39:18,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:39:18,972 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-10 12:39:18,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:39:18,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:39:18,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:39:18,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:39:18,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:39:18,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:39:18,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:39:18,975 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:39:18,978 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:39:18,978 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:39:18,979 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:39:18,980 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:39:18,980 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:39:18,980 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2018-11-10 12:39:18,981 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:39:18,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:39:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:19,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:39:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:39:19,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:39:19,061 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-10 12:39:19,063 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-10 12:39:19,064 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 130 transitions. cyclomatic complexity: 38 Second operand 4 states. [2018-11-10 12:39:19,098 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 130 transitions. cyclomatic complexity: 38. Second operand 4 states. Result 158 states and 233 transitions. Complement of second has 6 states. [2018-11-10 12:39:19,098 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-10 12:39:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:39:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2018-11-10 12:39:19,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 28 letters. Loop has 24 letters. [2018-11-10 12:39:19,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:39:19,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 52 letters. Loop has 24 letters. [2018-11-10 12:39:19,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:39:19,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 28 letters. Loop has 48 letters. [2018-11-10 12:39:19,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:39:19,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 233 transitions. [2018-11-10 12:39:19,104 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:39:19,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 0 states and 0 transitions. [2018-11-10 12:39:19,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:39:19,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:39:19,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:39:19,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:39:19,104 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:39:19,104 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:39:19,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:39:19,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:39:19,104 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 12:39:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:39:19,104 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 12:39:19,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:39:19,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 12:39:19,105 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:39:19,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:39:19,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:39:19,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:39:19,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:39:19,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:39:19,105 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:39:19,105 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:39:19,105 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:39:19,105 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:39:19,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:39:19,105 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:39:19,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:39:19,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:39:19 BoogieIcfgContainer [2018-11-10 12:39:19,110 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:39:19,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:39:19,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:39:19,110 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:39:19,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:39:16" (3/4) ... [2018-11-10 12:39:19,112 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:39:19,112 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:39:19,113 INFO L168 Benchmark]: Toolchain (without parser) took 3323.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 959.8 MB in the beginning and 912.0 MB in the end (delta: 47.8 MB). Peak memory consumption was 254.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:39:19,113 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:39:19,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.58 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 943.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:39:19,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 943.7 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:39:19,115 INFO L168 Benchmark]: Boogie Preprocessor took 24.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:39:19,115 INFO L168 Benchmark]: RCFGBuilder took 426.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:39:19,116 INFO L168 Benchmark]: BuchiAutomizer took 2558.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 912.0 MB in the end (delta: 153.8 MB). Peak memory consumption was 230.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:39:19,116 INFO L168 Benchmark]: Witness Printer took 2.66 ms. Allocated memory is still 1.2 GB. Free memory is still 912.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:39:19,118 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 240.58 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 943.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 943.7 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 426.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2558.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 912.0 MB in the end (delta: 153.8 MB). Peak memory consumption was 230.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.66 ms. Allocated memory is still 1.2 GB. Free memory is still 912.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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 93 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 418 SDtfs, 131 SDslu, 777 SDs, 0 SdLazy, 22 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital259 mio100 ax118 hnf104 lsp17 ukn86 mio100 lsp100 div132 bol100 ite100 ukn100 eq172 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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...