./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/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 f2969d4725852fd68e7759cdb7f1d1929ca0124c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:18:47,461 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:18:47,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:18:47,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:18:47,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:18:47,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:18:47,470 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:18:47,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:18:47,472 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:18:47,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:18:47,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:18:47,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:18:47,474 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:18:47,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:18:47,476 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:18:47,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:18:47,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:18:47,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:18:47,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:18:47,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:18:47,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:18:47,482 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:18:47,484 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:18:47,484 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:18:47,484 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:18:47,485 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:18:47,485 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:18:47,486 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:18:47,487 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:18:47,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:18:47,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:18:47,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:18:47,488 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:18:47,488 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:18:47,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:18:47,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:18:47,490 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 15:18:47,500 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:18:47,501 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:18:47,501 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:18:47,502 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:18:47,502 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:18:47,502 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:18:47,502 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:18:47,502 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:18:47,502 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:18:47,503 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:18:47,503 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:18:47,503 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:18:47,503 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:18:47,503 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:18:47,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:18:47,503 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:18:47,504 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:18:47,504 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:18:47,504 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:18:47,504 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:18:47,504 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:18:47,504 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:18:47,504 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:18:47,504 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:18:47,505 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:18:47,505 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:18:47,505 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:18:47,505 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:18:47,505 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:18:47,505 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:18:47,506 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:18:47,506 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:18:47,506 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_86ad7ef0-47c3-488e-9593-c76d35702cb5/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 -> f2969d4725852fd68e7759cdb7f1d1929ca0124c [2018-11-23 15:18:47,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:18:47,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:18:47,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:18:47,541 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:18:47,542 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:18:47,542 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-23 15:18:47,582 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/bin-2019/uautomizer/data/b70a0e2d9/fddfccfabacf44f0813867a8459ffb9f/FLAG5e48b1c73 [2018-11-23 15:18:47,911 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:18:47,912 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-23 15:18:47,918 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/bin-2019/uautomizer/data/b70a0e2d9/fddfccfabacf44f0813867a8459ffb9f/FLAG5e48b1c73 [2018-11-23 15:18:47,927 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/bin-2019/uautomizer/data/b70a0e2d9/fddfccfabacf44f0813867a8459ffb9f [2018-11-23 15:18:47,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:18:47,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:18:47,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:18:47,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:18:47,933 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:18:47,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:18:47" (1/1) ... [2018-11-23 15:18:47,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e1a27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:47, skipping insertion in model container [2018-11-23 15:18:47,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:18:47" (1/1) ... [2018-11-23 15:18:47,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:18:47,964 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:18:48,107 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:18:48,113 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:18:48,140 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:18:48,188 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:18:48,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:48 WrapperNode [2018-11-23 15:18:48,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:18:48,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:18:48,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:18:48,190 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:18:48,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:48" (1/1) ... [2018-11-23 15:18:48,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:48" (1/1) ... [2018-11-23 15:18:48,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:18:48,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:18:48,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:18:48,221 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:18:48,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:48" (1/1) ... [2018-11-23 15:18:48,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:48" (1/1) ... [2018-11-23 15:18:48,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:48" (1/1) ... [2018-11-23 15:18:48,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:48" (1/1) ... [2018-11-23 15:18:48,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:48" (1/1) ... [2018-11-23 15:18:48,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:48" (1/1) ... [2018-11-23 15:18:48,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:48" (1/1) ... [2018-11-23 15:18:48,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:18:48,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:18:48,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:18:48,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:18:48,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/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-23 15:18:48,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:18:48,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:18:48,565 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:18:48,565 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-11-23 15:18:48,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:18:48 BoogieIcfgContainer [2018-11-23 15:18:48,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:18:48,566 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:18:48,566 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:18:48,568 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:18:48,569 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:18:48,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:18:47" (1/3) ... [2018-11-23 15:18:48,570 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33714efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:18:48, skipping insertion in model container [2018-11-23 15:18:48,570 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:18:48,570 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:48" (2/3) ... [2018-11-23 15:18:48,570 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33714efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:18:48, skipping insertion in model container [2018-11-23 15:18:48,570 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:18:48,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:18:48" (3/3) ... [2018-11-23 15:18:48,572 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-23 15:18:48,614 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:18:48,614 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:18:48,614 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:18:48,615 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:18:48,615 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:18:48,615 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:18:48,615 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:18:48,615 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:18:48,615 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:18:48,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states. [2018-11-23 15:18:48,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-23 15:18:48,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:18:48,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:18:48,655 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:18:48,655 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:48,656 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:18:48,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states. [2018-11-23 15:18:48,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-23 15:18:48,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:18:48,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:18:48,660 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:18:48,660 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:48,667 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~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]; 11#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~alive1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive3~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 50#L202true assume !(0 == ~r1~0);init_~tmp~0 := 0; 30#L202-1true init_#res := init_~tmp~0; 24#L271true main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 25#L326-2true [2018-11-23 15:18:48,668 INFO L796 eck$LassoCheckResult]: Loop: 25#L326-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 5#L102true assume !(0 != ~mode1~0 % 256); 19#L120true assume !(0 != ~alive1~0 % 256); 15#L120-2true ~mode1~0 := 1; 23#L102-2true havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 63#L134true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 49#L137true assume !(node2_~m2~0 != ~nomsg~0); 47#L137-1true ~mode2~0 := 0; 75#L134-2true havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 8#L168true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 14#L171true assume !(node3_~m3~0 != ~nomsg~0); 13#L171-1true ~mode3~0 := 0; 6#L168-2true ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 55#L279true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 53#L279-1true check_#res := check_~tmp~1; 73#L291true main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 66#L350true assume !(0 == assert_~arg % 256); 42#L345true main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 25#L326-2true [2018-11-23 15:18:48,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:48,673 INFO L82 PathProgramCache]: Analyzing trace with hash 28791078, now seen corresponding path program 1 times [2018-11-23 15:18:48,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:18:48,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:18:48,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:48,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:48,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:48,783 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-23 15:18:48,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:48,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:18:48,787 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:18:48,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1620739646, now seen corresponding path program 1 times [2018-11-23 15:18:48,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:18:48,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:18:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:48,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:48,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:48,853 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-23 15:18:48,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:48,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:18:48,855 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:18:48,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:18:48,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:18:48,866 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2018-11-23 15:18:48,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:48,907 INFO L93 Difference]: Finished difference Result 75 states and 119 transitions. [2018-11-23 15:18:48,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:18:48,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 119 transitions. [2018-11-23 15:18:48,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-11-23 15:18:48,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2018-11-23 15:18:48,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-23 15:18:48,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-23 15:18:48,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2018-11-23 15:18:48,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:18:48,919 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-23 15:18:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2018-11-23 15:18:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 15:18:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 15:18:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2018-11-23 15:18:48,944 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-23 15:18:48,944 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-23 15:18:48,944 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:18:48,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2018-11-23 15:18:48,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-11-23 15:18:48,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:18:48,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:18:48,946 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:48,946 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:48,947 INFO L794 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~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]; 179#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~alive1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive3~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 180#L202 assume 0 == ~r1~0; 219#L203 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 187#L204 assume ~id1~0 >= 0; 188#L205 assume 0 == ~st1~0; 207#L206 assume ~send1~0 == ~id1~0; 226#L207 assume 0 == ~mode1~0 % 256; 165#L208 assume ~id2~0 >= 0; 166#L209 assume 0 == ~st2~0; 201#L210 assume ~send2~0 == ~id2~0; 217#L211 assume 0 == ~mode2~0 % 256; 177#L212 assume ~id3~0 >= 0; 178#L213 assume 0 == ~st3~0; 220#L214 assume ~send3~0 == ~id3~0; 189#L215 assume 0 == ~mode3~0 % 256; 190#L216 assume ~id1~0 != ~id2~0; 209#L217 assume ~id1~0 != ~id3~0; 227#L218 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 202#L202-1 init_#res := init_~tmp~0; 195#L271 main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 196#L326-2 [2018-11-23 15:18:48,947 INFO L796 eck$LassoCheckResult]: Loop: 196#L326-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 169#L102 assume !(0 != ~mode1~0 % 256); 170#L120 assume !(0 != ~alive1~0 % 256); 186#L120-2 ~mode1~0 := 1; 176#L102-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 194#L134 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 218#L137 assume !(node2_~m2~0 != ~nomsg~0); 182#L137-1 ~mode2~0 := 0; 208#L134-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 172#L168 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 174#L171 assume !(node3_~m3~0 != ~nomsg~0); 184#L171-1 ~mode3~0 := 0; 167#L168-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 168#L279 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 214#L279-1 check_#res := check_~tmp~1; 222#L291 main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 229#L350 assume !(0 == assert_~arg % 256); 211#L345 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 196#L326-2 [2018-11-23 15:18:48,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 1 times [2018-11-23 15:18:48,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:18:48,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:18:48,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:48,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:48,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:18:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:18:48,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:48,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1620739646, now seen corresponding path program 2 times [2018-11-23 15:18:48,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:18:48,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:18:48,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:48,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:48,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:49,056 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-23 15:18:49,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:49,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:18:49,056 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:18:49,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:18:49,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:18:49,057 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 5 states. [2018-11-23 15:18:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:49,085 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2018-11-23 15:18:49,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:18:49,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 98 transitions. [2018-11-23 15:18:49,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-11-23 15:18:49,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 68 states and 94 transitions. [2018-11-23 15:18:49,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-23 15:18:49,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-23 15:18:49,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 94 transitions. [2018-11-23 15:18:49,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:18:49,087 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 94 transitions. [2018-11-23 15:18:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 94 transitions. [2018-11-23 15:18:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 15:18:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 15:18:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2018-11-23 15:18:49,090 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 94 transitions. [2018-11-23 15:18:49,090 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 94 transitions. [2018-11-23 15:18:49,090 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:18:49,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 94 transitions. [2018-11-23 15:18:49,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-11-23 15:18:49,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:18:49,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:18:49,091 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:49,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:49,091 INFO L794 eck$LassoCheckResult]: Stem: 355#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~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]; 330#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~alive1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive3~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 331#L202 assume 0 == ~r1~0; 370#L203 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 338#L204 assume ~id1~0 >= 0; 339#L205 assume 0 == ~st1~0; 358#L206 assume ~send1~0 == ~id1~0; 377#L207 assume 0 == ~mode1~0 % 256; 316#L208 assume ~id2~0 >= 0; 317#L209 assume 0 == ~st2~0; 352#L210 assume ~send2~0 == ~id2~0; 368#L211 assume 0 == ~mode2~0 % 256; 328#L212 assume ~id3~0 >= 0; 329#L213 assume 0 == ~st3~0; 371#L214 assume ~send3~0 == ~id3~0; 340#L215 assume 0 == ~mode3~0 % 256; 341#L216 assume ~id1~0 != ~id2~0; 360#L217 assume ~id1~0 != ~id3~0; 378#L218 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 353#L202-1 init_#res := init_~tmp~0; 346#L271 main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 347#L326-2 [2018-11-23 15:18:49,091 INFO L796 eck$LassoCheckResult]: Loop: 347#L326-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 318#L102 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 320#L106 assume !(node1_~m1~0 != ~nomsg~0); 326#L106-1 ~mode1~0 := 0; 327#L102-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 345#L134 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 369#L137 assume !(node2_~m2~0 != ~nomsg~0); 333#L137-1 ~mode2~0 := 0; 359#L134-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 323#L168 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 325#L171 assume !(node3_~m3~0 != ~nomsg~0); 335#L171-1 ~mode3~0 := 0; 321#L168-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 322#L279 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 376#L280 assume ~r1~0 < 3;check_~tmp~1 := 1; 365#L279-1 check_#res := check_~tmp~1; 373#L291 main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 380#L350 assume !(0 == assert_~arg % 256); 362#L345 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 347#L326-2 [2018-11-23 15:18:49,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:49,091 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 2 times [2018-11-23 15:18:49,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:18:49,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:18:49,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:49,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:18:49,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:18:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:18:49,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:49,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2125434835, now seen corresponding path program 1 times [2018-11-23 15:18:49,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:18:49,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:18:49,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:49,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:18:49,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:18:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:18:49,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:49,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1643984114, now seen corresponding path program 1 times [2018-11-23 15:18:49,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:18:49,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:18:49,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:49,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:49,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:49,186 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-23 15:18:49,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:49,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:18:49,376 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2018-11-23 15:18:49,703 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-11-23 15:18:49,713 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:18:49,714 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:18:49,714 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:18:49,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:18:49,715 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 15:18:49,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:18:49,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:18:49,715 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:18:49,715 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2018-11-23 15:18:49,715 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:18:49,716 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:18:49,737 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-23 15:18:49,743 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-23 15:18:49,747 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-23 15:18:49,748 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-23 15:18:49,749 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-23 15:18:49,753 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-23 15:18:49,755 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-23 15:18:49,757 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-23 15:18:49,779 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-23 15:18:49,780 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-23 15:18:49,783 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-23 15:18:49,784 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-23 15:18:49,785 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-23 15:18:49,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:18:49,788 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-23 15:18:49,789 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-23 15:18:49,792 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-23 15:18:49,806 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-23 15:18:49,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:18:49,812 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-23 15:18:49,813 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-23 15:18:49,815 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-23 15:18:50,100 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:18:50,101 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/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-23 15:18:50,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 15:18:50,111 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ad7ef0-47c3-488e-9593-c76d35702cb5/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-23 15:18:50,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 15:18:50,151 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 15:18:50,228 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 15:18:50,230 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:18:50,230 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:18:50,230 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:18:50,230 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:18:50,230 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:18:50,231 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:18:50,231 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:18:50,231 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:18:50,231 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2018-11-23 15:18:50,231 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:18:50,231 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:18:50,235 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-23 15:18:50,244 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-23 15:18:50,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:18:50,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:18:50,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:18:50,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:18:50,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:18:50,266 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-23 15:18:50,269 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-23 15:18:50,270 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-23 15:18:50,286 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-23 15:18:50,289 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-23 15:18:50,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:18:50,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:18:50,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:18:50,328 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-23 15:18:50,329 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-23 15:18:50,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:18:50,336 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-23 15:18:50,337 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-23 15:18:50,339 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-23 15:18:50,341 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-23 15:18:50,585 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:18:50,589 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:18:50,590 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-23 15:18:50,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,597 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-23 15:18:50,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,603 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-23 15:18:50,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:18:50,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:18:50,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,608 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-23 15:18:50,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,614 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-23 15:18:50,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,616 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-23 15:18:50,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:18:50,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:18:50,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,626 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-23 15:18:50,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,628 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-23 15:18:50,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:18:50,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:18:50,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,636 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-23 15:18:50,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,640 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-23 15:18:50,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,648 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-23 15:18:50,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,652 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-23 15:18:50,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,656 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-23 15:18:50,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:18:50,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:18:50,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,660 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-23 15:18:50,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,665 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-23 15:18:50,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,666 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 15:18:50,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,666 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:18:50,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,670 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-23 15:18:50,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,672 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-23 15:18:50,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:18:50,676 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-23 15:18:50,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:18:50,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:18:50,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:18:50,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:18:50,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:18:50,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:18:50,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:18:50,678 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:18:50,681 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:18:50,681 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 15:18:50,683 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:18:50,683 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 15:18:50,683 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:18:50,684 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2018-11-23 15:18:50,684 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 15:18:50,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:50,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:18:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:50,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:18:50,771 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-23 15:18:50,773 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-23 15:18:50,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 94 transitions. cyclomatic complexity: 27 Second operand 3 states. [2018-11-23 15:18:50,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 94 transitions. cyclomatic complexity: 27. Second operand 3 states. Result 115 states and 168 transitions. Complement of second has 4 states. [2018-11-23 15:18:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 15:18:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:18:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-23 15:18:50,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 94 transitions. Stem has 21 letters. Loop has 19 letters. [2018-11-23 15:18:50,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:18:50,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 94 transitions. Stem has 40 letters. Loop has 19 letters. [2018-11-23 15:18:50,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:18:50,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 94 transitions. Stem has 21 letters. Loop has 38 letters. [2018-11-23 15:18:50,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:18:50,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 168 transitions. [2018-11-23 15:18:50,807 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:18:50,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 0 states and 0 transitions. [2018-11-23 15:18:50,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:18:50,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:18:50,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:18:50,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:18:50,808 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:18:50,808 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:18:50,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:18:50,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:18:50,809 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-23 15:18:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:50,809 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 15:18:50,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:18:50,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-23 15:18:50,809 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:18:50,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 15:18:50,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:18:50,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:18:50,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:18:50,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:18:50,810 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:18:50,810 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:18:50,810 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:18:50,810 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:18:50,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:18:50,810 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:18:50,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:18:50,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:18:50 BoogieIcfgContainer [2018-11-23 15:18:50,814 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:18:50,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:18:50,815 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:18:50,815 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:18:50,815 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:18:48" (3/4) ... [2018-11-23 15:18:50,818 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:18:50,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:18:50,818 INFO L168 Benchmark]: Toolchain (without parser) took 2888.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 960.7 MB in the beginning and 899.5 MB in the end (delta: 61.3 MB). Peak memory consumption was 197.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:18:50,819 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:18:50,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 960.7 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:18:50,820 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:18:50,820 INFO L168 Benchmark]: Boogie Preprocessor took 20.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:18:50,820 INFO L168 Benchmark]: RCFGBuilder took 324.69 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:18:50,821 INFO L168 Benchmark]: BuchiAutomizer took 2248.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.5 MB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:18:50,821 INFO L168 Benchmark]: Witness Printer took 3.18 ms. Allocated memory is still 1.2 GB. Free memory is still 899.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:18:50,823 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 960.7 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 324.69 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2248.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.5 MB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.18 ms. Allocated memory is still 1.2 GB. Free memory is still 899.5 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 + 11 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. 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 68 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 303 SDtfs, 167 SDslu, 560 SDs, 0 SdLazy, 22 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital215 mio100 ax117 hnf104 lsp22 ukn65 mio100 lsp100 div173 bol100 ite100 ukn100 eq151 hnf74 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms 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...