./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/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 ed765f1987456e72af41b47c4e2a2164d166c0f3 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:08:31,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:08:31,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:08:31,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:08:31,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:08:31,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:08:31,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:08:31,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:08:31,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:08:31,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:08:31,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:08:31,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:08:31,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:08:31,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:08:31,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:08:31,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:08:31,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:08:31,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:08:31,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:08:31,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:08:31,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:08:31,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:08:31,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:08:31,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:08:31,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:08:31,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:08:31,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:08:31,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:08:31,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:08:31,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:08:31,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:08:31,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:08:31,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:08:31,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:08:31,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:08:31,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:08:31,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:08:31,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:08:31,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:08:31,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:08:31,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:08:31,357 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 21:08:31,385 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:08:31,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:08:31,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:08:31,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:08:31,396 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:08:31,396 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:08:31,396 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:08:31,397 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:08:31,397 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:08:31,397 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:08:31,397 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:08:31,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:08:31,401 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:08:31,401 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:08:31,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:08:31,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:08:31,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:08:31,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:08:31,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:08:31,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:08:31,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:08:31,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:08:31,402 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:08:31,403 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:08:31,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:08:31,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:08:31,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:08:31,404 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:08:31,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:08:31,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:08:31,404 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:08:31,405 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:08:31,405 INFO L138 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/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/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 -> ed765f1987456e72af41b47c4e2a2164d166c0f3 [2019-11-15 21:08:31,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:08:31,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:08:31,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:08:31,444 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:08:31,445 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:08:31,445 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2019-11-15 21:08:31,498 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/uautomizer/data/c48a89b8e/c6faff82ba73498eb6171278ef2fb003/FLAG0a2e8ec1b [2019-11-15 21:08:31,886 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:08:31,887 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2019-11-15 21:08:31,897 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/uautomizer/data/c48a89b8e/c6faff82ba73498eb6171278ef2fb003/FLAG0a2e8ec1b [2019-11-15 21:08:32,215 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/uautomizer/data/c48a89b8e/c6faff82ba73498eb6171278ef2fb003 [2019-11-15 21:08:32,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:08:32,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:08:32,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:08:32,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:08:32,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:08:32,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:08:32" (1/1) ... [2019-11-15 21:08:32,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6333d557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32, skipping insertion in model container [2019-11-15 21:08:32,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:08:32" (1/1) ... [2019-11-15 21:08:32,236 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:08:32,293 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:08:32,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:08:32,702 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:08:32,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:08:32,794 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:08:32,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32 WrapperNode [2019-11-15 21:08:32,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:08:32,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:08:32,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:08:32,796 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:08:32,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32" (1/1) ... [2019-11-15 21:08:32,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32" (1/1) ... [2019-11-15 21:08:32,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:08:32,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:08:32,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:08:32,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:08:32,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32" (1/1) ... [2019-11-15 21:08:32,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32" (1/1) ... [2019-11-15 21:08:32,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32" (1/1) ... [2019-11-15 21:08:32,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32" (1/1) ... [2019-11-15 21:08:32,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32" (1/1) ... [2019-11-15 21:08:32,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32" (1/1) ... [2019-11-15 21:08:32,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32" (1/1) ... [2019-11-15 21:08:32,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:08:32,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:08:32,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:08:32,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:08:32,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/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 [2019-11-15 21:08:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:08:32,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:08:33,736 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:08:33,736 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-15 21:08:33,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:08:33 BoogieIcfgContainer [2019-11-15 21:08:33,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:08:33,738 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:08:33,738 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:08:33,741 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:08:33,741 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:08:33,742 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:08:32" (1/3) ... [2019-11-15 21:08:33,742 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62707835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:08:33, skipping insertion in model container [2019-11-15 21:08:33,742 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:08:33,743 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:08:32" (2/3) ... [2019-11-15 21:08:33,743 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62707835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:08:33, skipping insertion in model container [2019-11-15 21:08:33,743 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:08:33,743 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:08:33" (3/3) ... [2019-11-15 21:08:33,745 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2019-11-15 21:08:33,779 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:08:33,780 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:08:33,780 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:08:33,780 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:08:33,780 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:08:33,781 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:08:33,781 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:08:33,781 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:08:33,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states. [2019-11-15 21:08:33,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2019-11-15 21:08:33,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:08:33,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:08:33,830 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:08:33,830 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:08:33,830 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:08:33,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states. [2019-11-15 21:08:33,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2019-11-15 21:08:33,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:08:33,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:08:33,840 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:08:33,840 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:08:33,846 INFO L791 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 13#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 80#L292true assume !(0 == ~r1~0);init_~tmp~0 := 0; 77#L292-1true init_#res := init_~tmp~0; 97#L421true main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 71#L490-2true [2019-11-15 21:08:33,847 INFO L793 eck$LassoCheckResult]: Loop: 71#L490-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 105#L118true 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 32#L122true assume !(node1_~m1~0 != ~nomsg~0); 46#L122-1true ~mode1~0 := 0; 90#L118-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 35#L155true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 23#L158true assume !(node2_~m2~0 != ~nomsg~0); 22#L158-1true ~mode2~0 := 0; 47#L155-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 115#L189true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 120#L192true assume !(node3_~m3~0 != ~nomsg~0); 119#L192-1true ~mode3~0 := 0; 113#L189-2true havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 92#L223true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 76#L226true assume !(node4_~m4~0 != ~nomsg~0); 73#L226-1true ~mode4~0 := 0; 66#L223-2true havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 43#L257true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 31#L260true assume !(node5_~m5~0 != ~nomsg~0); 30#L260-1true ~mode5~0 := 0; 42#L257-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 101#L429true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 102#L429-1true check_#res := check_~tmp~1; 49#L441true main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 94#L520true assume !(0 == assert_~arg % 256); 64#L515true main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 71#L490-2true [2019-11-15 21:08:33,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:08:33,853 INFO L82 PathProgramCache]: Analyzing trace with hash 28880448, now seen corresponding path program 1 times [2019-11-15 21:08:33,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:08:33,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617621460] [2019-11-15 21:08:33,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:33,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:33,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:08:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:08:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:08:34,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617621460] [2019-11-15 21:08:34,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:08:34,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:08:34,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545776907] [2019-11-15 21:08:34,039 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:08:34,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:08:34,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1515995822, now seen corresponding path program 1 times [2019-11-15 21:08:34,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:08:34,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043482642] [2019-11-15 21:08:34,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:34,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:34,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:08:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:08:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:08:34,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043482642] [2019-11-15 21:08:34,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:08:34,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:08:34,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346117880] [2019-11-15 21:08:34,220 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:08:34,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:08:34,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:08:34,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:08:34,235 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 4 states. [2019-11-15 21:08:34,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:08:34,343 INFO L93 Difference]: Finished difference Result 121 states and 200 transitions. [2019-11-15 21:08:34,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:08:34,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 200 transitions. [2019-11-15 21:08:34,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-11-15 21:08:34,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 114 states and 162 transitions. [2019-11-15 21:08:34,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2019-11-15 21:08:34,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2019-11-15 21:08:34,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 162 transitions. [2019-11-15 21:08:34,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:08:34,365 INFO L688 BuchiCegarLoop]: Abstraction has 114 states and 162 transitions. [2019-11-15 21:08:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 162 transitions. [2019-11-15 21:08:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-15 21:08:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 21:08:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2019-11-15 21:08:34,394 INFO L711 BuchiCegarLoop]: Abstraction has 114 states and 162 transitions. [2019-11-15 21:08:34,394 INFO L591 BuchiCegarLoop]: Abstraction has 114 states and 162 transitions. [2019-11-15 21:08:34,394 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:08:34,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 162 transitions. [2019-11-15 21:08:34,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-11-15 21:08:34,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:08:34,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:08:34,400 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:08:34,400 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:08:34,401 INFO L791 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 274#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 275#L292 assume 0 == ~r1~0; 287#L293 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 288#L294 assume ~id1~0 >= 0; 337#L295 assume 0 == ~st1~0; 270#L296 assume ~send1~0 == ~id1~0; 271#L297 assume 0 == ~mode1~0 % 256; 340#L298 assume ~id2~0 >= 0; 282#L299 assume 0 == ~st2~0; 283#L300 assume ~send2~0 == ~id2~0; 326#L301 assume 0 == ~mode2~0 % 256; 327#L302 assume ~id3~0 >= 0; 345#L303 assume 0 == ~st3~0; 298#L304 assume ~send3~0 == ~id3~0; 299#L305 assume 0 == ~mode3~0 % 256; 342#L306 assume ~id4~0 >= 0; 280#L307 assume 0 == ~st4~0; 281#L308 assume ~send4~0 == ~id4~0; 339#L309 assume 0 == ~mode4~0 % 256; 268#L310 assume ~id5~0 >= 0; 269#L311 assume 0 == ~st5~0; 314#L312 assume ~send5~0 == ~id5~0; 315#L313 assume 0 == ~mode5~0 % 256; 357#L314 assume ~id1~0 != ~id2~0; 296#L315 assume ~id1~0 != ~id3~0; 297#L316 assume ~id1~0 != ~id4~0; 341#L317 assume ~id1~0 != ~id5~0; 276#L318 assume ~id2~0 != ~id3~0; 277#L319 assume ~id2~0 != ~id4~0; 338#L320 assume ~id2~0 != ~id5~0; 263#L321 assume ~id3~0 != ~id4~0; 264#L322 assume ~id3~0 != ~id5~0; 310#L323 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 311#L292-1 init_#res := init_~tmp~0; 356#L421 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 347#L490-2 [2019-11-15 21:08:34,401 INFO L793 eck$LassoCheckResult]: Loop: 347#L490-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 353#L118 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 307#L122 assume !(node1_~m1~0 != ~nomsg~0); 309#L122-1 ~mode1~0 := 0; 328#L118-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 316#L155 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 290#L158 assume !(node2_~m2~0 != ~nomsg~0); 289#L158-1 ~mode2~0 := 0; 285#L155-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 329#L189 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 368#L192 assume !(node3_~m3~0 != ~nomsg~0); 261#L192-1 ~mode3~0 := 0; 358#L189-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 363#L223 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 355#L226 assume !(node4_~m4~0 != ~nomsg~0); 301#L226-1 ~mode4~0 := 0; 317#L223-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 323#L257 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 305#L260 assume !(node5_~m5~0 != ~nomsg~0); 303#L260-1 ~mode5~0 := 0; 304#L257-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 322#L429 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 325#L429-1 check_#res := check_~tmp~1; 332#L441 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 333#L520 assume !(0 == assert_~arg % 256); 346#L515 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 347#L490-2 [2019-11-15 21:08:34,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:08:34,402 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 1 times [2019-11-15 21:08:34,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:08:34,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784792162] [2019-11-15 21:08:34,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:34,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:34,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:08:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:08:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:08:34,549 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:08:34,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:08:34,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1515995822, now seen corresponding path program 2 times [2019-11-15 21:08:34,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:08:34,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119767942] [2019-11-15 21:08:34,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:34,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:34,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:08:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:08:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:08:34,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119767942] [2019-11-15 21:08:34,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:08:34,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:08:34,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683720417] [2019-11-15 21:08:34,640 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:08:34,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:08:34,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:08:34,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:08:34,640 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. cyclomatic complexity: 49 Second operand 5 states. [2019-11-15 21:08:34,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:08:34,704 INFO L93 Difference]: Finished difference Result 117 states and 164 transitions. [2019-11-15 21:08:34,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:08:34,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 164 transitions. [2019-11-15 21:08:34,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-11-15 21:08:34,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 114 states and 160 transitions. [2019-11-15 21:08:34,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2019-11-15 21:08:34,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2019-11-15 21:08:34,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 160 transitions. [2019-11-15 21:08:34,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:08:34,711 INFO L688 BuchiCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-11-15 21:08:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 160 transitions. [2019-11-15 21:08:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-15 21:08:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 21:08:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2019-11-15 21:08:34,719 INFO L711 BuchiCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-11-15 21:08:34,719 INFO L591 BuchiCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-11-15 21:08:34,720 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:08:34,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 160 transitions. [2019-11-15 21:08:34,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-11-15 21:08:34,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:08:34,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:08:34,723 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:08:34,724 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:08:34,724 INFO L791 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 517#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 518#L292 assume 0 == ~r1~0; 530#L293 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 531#L294 assume ~id1~0 >= 0; 580#L295 assume 0 == ~st1~0; 513#L296 assume ~send1~0 == ~id1~0; 514#L297 assume 0 == ~mode1~0 % 256; 583#L298 assume ~id2~0 >= 0; 525#L299 assume 0 == ~st2~0; 526#L300 assume ~send2~0 == ~id2~0; 569#L301 assume 0 == ~mode2~0 % 256; 570#L302 assume ~id3~0 >= 0; 588#L303 assume 0 == ~st3~0; 541#L304 assume ~send3~0 == ~id3~0; 542#L305 assume 0 == ~mode3~0 % 256; 585#L306 assume ~id4~0 >= 0; 523#L307 assume 0 == ~st4~0; 524#L308 assume ~send4~0 == ~id4~0; 582#L309 assume 0 == ~mode4~0 % 256; 511#L310 assume ~id5~0 >= 0; 512#L311 assume 0 == ~st5~0; 557#L312 assume ~send5~0 == ~id5~0; 558#L313 assume 0 == ~mode5~0 % 256; 600#L314 assume ~id1~0 != ~id2~0; 539#L315 assume ~id1~0 != ~id3~0; 540#L316 assume ~id1~0 != ~id4~0; 584#L317 assume ~id1~0 != ~id5~0; 519#L318 assume ~id2~0 != ~id3~0; 520#L319 assume ~id2~0 != ~id4~0; 581#L320 assume ~id2~0 != ~id5~0; 506#L321 assume ~id3~0 != ~id4~0; 507#L322 assume ~id3~0 != ~id5~0; 553#L323 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 554#L292-1 init_#res := init_~tmp~0; 599#L421 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 590#L490-2 [2019-11-15 21:08:34,725 INFO L793 eck$LassoCheckResult]: Loop: 590#L490-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 596#L118 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 550#L122 assume !(node1_~m1~0 != ~nomsg~0); 552#L122-1 ~mode1~0 := 0; 571#L118-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 559#L155 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 533#L158 assume !(node2_~m2~0 != ~nomsg~0); 532#L158-1 ~mode2~0 := 0; 528#L155-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 572#L189 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 611#L192 assume !(node3_~m3~0 != ~nomsg~0); 504#L192-1 ~mode3~0 := 0; 601#L189-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 606#L223 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 598#L226 assume !(node4_~m4~0 != ~nomsg~0); 544#L226-1 ~mode4~0 := 0; 560#L223-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 566#L257 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 548#L260 assume !(node5_~m5~0 != ~nomsg~0); 546#L260-1 ~mode5~0 := 0; 547#L257-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 565#L429 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 577#L430 assume ~r1~0 < 5;check_~tmp~1 := 1; 568#L429-1 check_#res := check_~tmp~1; 575#L441 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 576#L520 assume !(0 == assert_~arg % 256); 589#L515 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 590#L490-2 [2019-11-15 21:08:34,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:08:34,725 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 2 times [2019-11-15 21:08:34,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:08:34,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142170795] [2019-11-15 21:08:34,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:34,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:34,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:08:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:08:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:08:34,820 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:08:34,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:08:34,821 INFO L82 PathProgramCache]: Analyzing trace with hash -632096835, now seen corresponding path program 1 times [2019-11-15 21:08:34,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:08:34,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167538185] [2019-11-15 21:08:34,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:34,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:34,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:08:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:08:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:08:34,862 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:08:34,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:08:34,862 INFO L82 PathProgramCache]: Analyzing trace with hash -525921879, now seen corresponding path program 1 times [2019-11-15 21:08:34,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:08:34,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959987690] [2019-11-15 21:08:34,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:34,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:08:34,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:08:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:08:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:08:34,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959987690] [2019-11-15 21:08:34,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:08:34,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:08:34,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424048416] [2019-11-15 21:08:35,441 WARN L191 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 137 [2019-11-15 21:08:36,438 WARN L191 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 118 [2019-11-15 21:08:36,453 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:08:36,454 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:08:36,454 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:08:36,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:08:36,454 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:08:36,455 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:08:36,455 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:08:36,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:08:36,455 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2019-11-15 21:08:36,455 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:08:36,456 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:08:36,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:36,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,095 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 21:08:37,429 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:08:37,430 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/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 [2019-11-15 21:08:37,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:08:37,452 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b8ae0dd-f92d-4314-8b7d-a651a6e96731/bin/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 [2019-11-15 21:08:37,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:08:37,485 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:08:37,623 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:08:37,625 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:08:37,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:08:37,625 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:08:37,625 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:08:37,625 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:08:37,625 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:08:37,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:08:37,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:08:37,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2019-11-15 21:08:37,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:08:37,626 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:08:37,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:37,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:08:38,078 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 21:08:38,452 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 21:08:38,614 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:08:38,618 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:08:38,620 INFO L120 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 [2019-11-15 21:08:38,622 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,622 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,623 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,624 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,625 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,628 INFO L120 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 [2019-11-15 21:08:38,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,631 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:08:38,632 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:08:38,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,634 INFO L120 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 [2019-11-15 21:08:38,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,645 INFO L120 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 [2019-11-15 21:08:38,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,647 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:08:38,648 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:08:38,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,650 INFO L120 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 [2019-11-15 21:08:38,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,655 INFO L120 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 [2019-11-15 21:08:38,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,656 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,657 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,657 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,658 INFO L120 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 [2019-11-15 21:08:38,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,660 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:08:38,660 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:08:38,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,663 INFO L120 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 [2019-11-15 21:08:38,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,664 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:08:38,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,665 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:08:38,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,670 INFO L120 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 [2019-11-15 21:08:38,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,672 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,674 INFO L120 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 [2019-11-15 21:08:38,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,676 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:08:38,676 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:08:38,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,679 INFO L120 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 [2019-11-15 21:08:38,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,680 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,681 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,681 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,682 INFO L120 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 [2019-11-15 21:08:38,682 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,683 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,683 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,683 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,685 INFO L120 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 [2019-11-15 21:08:38,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,685 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,686 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,686 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,687 INFO L120 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 [2019-11-15 21:08:38,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,688 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,689 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,689 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,690 INFO L120 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 [2019-11-15 21:08:38,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,690 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,691 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,691 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,691 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,692 INFO L120 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 [2019-11-15 21:08:38,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,694 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:08:38,695 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:08:38,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,697 INFO L120 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 [2019-11-15 21:08:38,698 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,698 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,698 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,698 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,698 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,699 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,699 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,700 INFO L120 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 [2019-11-15 21:08:38,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,701 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,701 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,702 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:08:38,704 INFO L120 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 [2019-11-15 21:08:38,705 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:08:38,705 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:08:38,705 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:08:38,705 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:08:38,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:08:38,706 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:08:38,706 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:08:38,707 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:08:38,711 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:08:38,711 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:08:38,713 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:08:38,713 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:08:38,713 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:08:38,714 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2019-11-15 21:08:38,715 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:08:38,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:08:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:08:38,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:08:38,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:08:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:08:38,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:08:38,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:08:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:08:38,881 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:08:38,882 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 160 transitions. cyclomatic complexity: 47 Second operand 3 states. [2019-11-15 21:08:38,956 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 160 transitions. cyclomatic complexity: 47. Second operand 3 states. Result 192 states and 285 transitions. Complement of second has 4 states. [2019-11-15 21:08:38,956 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 [2019-11-15 21:08:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:08:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2019-11-15 21:08:38,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 160 transitions. Stem has 36 letters. Loop has 27 letters. [2019-11-15 21:08:38,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:08:38,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 160 transitions. Stem has 63 letters. Loop has 27 letters. [2019-11-15 21:08:38,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:08:38,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 160 transitions. Stem has 36 letters. Loop has 54 letters. [2019-11-15 21:08:38,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:08:38,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 285 transitions. [2019-11-15 21:08:38,966 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:08:38,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 0 states and 0 transitions. [2019-11-15 21:08:38,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:08:38,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:08:38,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:08:38,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:08:38,967 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:08:38,968 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:08:38,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:08:38,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:08:38,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:08:38,968 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-15 21:08:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:08:38,969 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 21:08:38,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:08:38,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 21:08:38,969 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:08:38,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:08:38,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:08:38,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:08:38,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:08:38,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:08:38,970 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:08:38,970 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:08:38,970 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:08:38,971 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:08:38,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:08:38,971 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:08:38,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:08:38,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:08:38 BoogieIcfgContainer [2019-11-15 21:08:38,977 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:08:38,977 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:08:38,977 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:08:38,977 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:08:38,978 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:08:33" (3/4) ... [2019-11-15 21:08:38,980 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:08:38,981 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:08:38,982 INFO L168 Benchmark]: Toolchain (without parser) took 6762.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.2 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -259.9 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:08:38,983 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:08:38,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:08:38,984 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.74 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. [2019-11-15 21:08:38,984 INFO L168 Benchmark]: Boogie Preprocessor took 48.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:08:38,985 INFO L168 Benchmark]: RCFGBuilder took 829.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:08:38,986 INFO L168 Benchmark]: BuchiAutomizer took 5239.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.5 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:08:38,986 INFO L168 Benchmark]: Witness Printer took 3.67 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:08:38,989 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 574.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.74 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 48.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 829.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5239.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.5 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.67 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 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 5.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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 114 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 516 SDtfs, 161 SDslu, 956 SDs, 0 SdLazy, 22 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital303 mio100 ax120 hnf105 lsp16 ukn100 mio100 lsp100 div103 bol100 ite100 ukn100 eq221 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms 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...