./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.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/working_dir_08332f5e-238c-431a-861f-77b981aee927/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/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 c9907cb75ed84c11388be65b346c48a42942e3a6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:27,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:27,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:27,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:27,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:27,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:27,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:27,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:27,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:27,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:27,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:27,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:27,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:27,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:27,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:27,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:27,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:27,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:27,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:27,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:27,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:27,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:27,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:27,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:27,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:27,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:27,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:27,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:27,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:27,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:27,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:27,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:27,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:27,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:27,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:27,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:27,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:27,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:27,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:27,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:27,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:27,112 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:58:27,124 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:27,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:27,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:27,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:27,125 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:27,125 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:27,126 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:27,126 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:27,126 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:27,126 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:27,126 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:27,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:27,127 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:27,127 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:27,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:27,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:27,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:27,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:27,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:27,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:27,128 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:27,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:27,129 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:27,129 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:27,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:27,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:27,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:27,129 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:27,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:27,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:27,130 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:27,131 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:27,131 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/working_dir_08332f5e-238c-431a-861f-77b981aee927/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 -> c9907cb75ed84c11388be65b346c48a42942e3a6 [2019-10-22 08:58:27,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:27,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:27,168 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:27,169 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:27,169 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:27,170 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2019-10-22 08:58:27,221 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/bin/uautomizer/data/be97f87f1/6f5238ad61004ddabfb0813335d9fef1/FLAGe757321db [2019-10-22 08:58:27,661 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:27,662 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2019-10-22 08:58:27,670 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/bin/uautomizer/data/be97f87f1/6f5238ad61004ddabfb0813335d9fef1/FLAGe757321db [2019-10-22 08:58:27,679 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/bin/uautomizer/data/be97f87f1/6f5238ad61004ddabfb0813335d9fef1 [2019-10-22 08:58:27,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:27,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:27,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:27,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:27,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:27,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:27" (1/1) ... [2019-10-22 08:58:27,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1250712a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:27, skipping insertion in model container [2019-10-22 08:58:27,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:27" (1/1) ... [2019-10-22 08:58:27,697 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:27,734 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:28,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:28,051 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:28,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:28,138 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:28,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:28 WrapperNode [2019-10-22 08:58:28,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:28,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:28,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:28,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:28,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:28" (1/1) ... [2019-10-22 08:58:28,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:28" (1/1) ... [2019-10-22 08:58:28,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:28,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:28,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:28,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:28,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:28" (1/1) ... [2019-10-22 08:58:28,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:28" (1/1) ... [2019-10-22 08:58:28,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:28" (1/1) ... [2019-10-22 08:58:28,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:28" (1/1) ... [2019-10-22 08:58:28,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:28" (1/1) ... [2019-10-22 08:58:28,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:28" (1/1) ... [2019-10-22 08:58:28,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:28" (1/1) ... [2019-10-22 08:58:28,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:28,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:28,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:28,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:28,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/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-10-22 08:58:28,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:28,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:28,954 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:28,954 INFO L284 CfgBuilder]: Removed 23 assume(true) statements. [2019-10-22 08:58:28,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:28 BoogieIcfgContainer [2019-10-22 08:58:28,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:28,956 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:28,956 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:28,965 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:28,966 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:28,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:27" (1/3) ... [2019-10-22 08:58:28,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@489b78ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:28, skipping insertion in model container [2019-10-22 08:58:28,967 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:28,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:28" (2/3) ... [2019-10-22 08:58:28,968 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@489b78ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:28, skipping insertion in model container [2019-10-22 08:58:28,968 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:28,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:28" (3/3) ... [2019-10-22 08:58:28,970 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2019-10-22 08:58:29,017 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:29,017 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:29,017 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:29,017 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:29,017 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:29,017 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:29,018 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:29,018 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:29,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states. [2019-10-22 08:58:29,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-10-22 08:58:29,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:29,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:29,094 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:29,094 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, 1, 1, 1] [2019-10-22 08:58:29,094 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:29,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states. [2019-10-22 08:58:29,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-10-22 08:58:29,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:29,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:29,101 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:29,102 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, 1, 1, 1] [2019-10-22 08:58:29,109 INFO L791 eck$LassoCheckResult]: Stem: 102#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 12#L-1true havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 15#L329true assume !(0 == ~r1~0);init_~tmp~0 := 0; 17#L329-1true init_#res := init_~tmp~0; 21#L494true main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 69#L570-2true [2019-10-22 08:58:29,110 INFO L793 eck$LassoCheckResult]: Loop: 69#L570-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 110#L126true 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 65#L130true assume !(node1_~m1~0 != ~nomsg~0); 64#L130-1true ~mode1~0 := 0; 107#L126-2true havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 24#L158true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 29#L161true assume !(node2_~m2~0 != ~nomsg~0); 28#L161-1true ~mode2~0 := 0; 22#L158-2true havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 133#L192true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 120#L195true assume !(node3_~m3~0 != ~nomsg~0); 119#L195-1true ~mode3~0 := 0; 112#L192-2true havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 81#L226true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 54#L229true assume !(node4_~m4~0 != ~nomsg~0); 68#L229-1true ~mode4~0 := 0; 78#L226-2true havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 35#L260true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 11#L263true assume !(node5_~m5~0 != ~nomsg~0); 6#L263-1true ~mode5~0 := 0; 33#L260-2true havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 106#L294true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 100#L297true assume !(node6_~m6~0 != ~nomsg~0); 99#L297-1true ~mode6~0 := 0; 122#L294-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 45#L502true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 47#L502-1true check_#res := check_~tmp~1; 126#L514true main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 85#L603true assume !(0 == assert_~arg % 256); 58#L598true main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 69#L570-2true [2019-10-22 08:58:29,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:29,117 INFO L82 PathProgramCache]: Analyzing trace with hash 28934070, now seen corresponding path program 1 times [2019-10-22 08:58:29,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:29,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302708202] [2019-10-22 08:58:29,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:29,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302708202] [2019-10-22 08:58:29,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:29,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:29,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040182069] [2019-10-22 08:58:29,347 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:29,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:29,347 INFO L82 PathProgramCache]: Analyzing trace with hash 448128979, now seen corresponding path program 1 times [2019-10-22 08:58:29,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:29,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459998967] [2019-10-22 08:58:29,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:29,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459998967] [2019-10-22 08:58:29,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:29,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:29,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435498924] [2019-10-22 08:58:29,545 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:29,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:29,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:29,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:29,563 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2019-10-22 08:58:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:29,656 INFO L93 Difference]: Finished difference Result 141 states and 236 transitions. [2019-10-22 08:58:29,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:29,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 236 transitions. [2019-10-22 08:58:29,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 08:58:29,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 134 states and 189 transitions. [2019-10-22 08:58:29,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-10-22 08:58:29,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-10-22 08:58:29,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 189 transitions. [2019-10-22 08:58:29,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:29,679 INFO L688 BuchiCegarLoop]: Abstraction has 134 states and 189 transitions. [2019-10-22 08:58:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 189 transitions. [2019-10-22 08:58:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-10-22 08:58:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-22 08:58:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 189 transitions. [2019-10-22 08:58:29,708 INFO L711 BuchiCegarLoop]: Abstraction has 134 states and 189 transitions. [2019-10-22 08:58:29,708 INFO L591 BuchiCegarLoop]: Abstraction has 134 states and 189 transitions. [2019-10-22 08:58:29,708 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:29,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 189 transitions. [2019-10-22 08:58:29,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 08:58:29,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:29,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:29,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:29,712 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, 1, 1, 1] [2019-10-22 08:58:29,712 INFO L791 eck$LassoCheckResult]: Stem: 423#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 316#L-1 havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 317#L329 assume 0 == ~r1~0; 320#L330 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 391#L331 assume ~id1~0 >= 0; 314#L332 assume 0 == ~st1~0; 315#L333 assume ~send1~0 == ~id1~0; 362#L334 assume 0 == ~mode1~0 % 256; 363#L335 assume ~id2~0 >= 0; 415#L336 assume 0 == ~st2~0; 354#L337 assume ~send2~0 == ~id2~0; 355#L338 assume 0 == ~mode2~0 % 256; 395#L339 assume ~id3~0 >= 0; 318#L340 assume 0 == ~st3~0; 319#L341 assume ~send3~0 == ~id3~0; 390#L342 assume 0 == ~mode3~0 % 256; 310#L343 assume ~id4~0 >= 0; 311#L344 assume 0 == ~st4~0; 360#L345 assume ~send4~0 == ~id4~0; 361#L346 assume 0 == ~mode4~0 % 256; 414#L347 assume ~id5~0 >= 0; 351#L348 assume 0 == ~st5~0; 352#L349 assume ~send5~0 == ~id5~0; 394#L350 assume 0 == ~mode5~0 % 256; 343#L351 assume ~id6~0 >= 0; 344#L352 assume 0 == ~st6~0; 388#L353 assume ~send6~0 == ~id6~0; 308#L354 assume 0 == ~mode6~0 % 256; 309#L355 assume ~id1~0 != ~id2~0; 358#L356 assume ~id1~0 != ~id3~0; 359#L357 assume ~id1~0 != ~id4~0; 412#L358 assume ~id1~0 != ~id5~0; 349#L359 assume ~id1~0 != ~id6~0; 350#L360 assume ~id2~0 != ~id3~0; 393#L361 assume ~id2~0 != ~id4~0; 341#L362 assume ~id2~0 != ~id5~0; 342#L363 assume ~id2~0 != ~id6~0; 387#L364 assume ~id3~0 != ~id4~0; 303#L365 assume ~id3~0 != ~id5~0; 304#L366 assume ~id3~0 != ~id6~0; 384#L367 assume ~id4~0 != ~id5~0; 385#L368 assume ~id4~0 != ~id6~0; 410#L369 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 327#L329-1 init_#res := init_~tmp~0; 328#L494 main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 334#L570-2 [2019-10-22 08:58:29,712 INFO L793 eck$LassoCheckResult]: Loop: 334#L570-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 400#L126 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 396#L130 assume !(node1_~m1~0 != ~nomsg~0); 330#L130-1 ~mode1~0 := 0; 383#L126-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 339#L158 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 340#L161 assume !(node2_~m2~0 != ~nomsg~0); 347#L161-1 ~mode2~0 := 0; 335#L158-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 336#L192 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 424#L195 assume !(node3_~m3~0 != ~nomsg~0); 299#L195-1 ~mode3~0 := 0; 404#L192-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 411#L226 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 386#L229 assume !(node4_~m4~0 != ~nomsg~0); 306#L229-1 ~mode4~0 := 0; 346#L226-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 357#L260 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 312#L263 assume !(node5_~m5~0 != ~nomsg~0); 301#L263-1 ~mode5~0 := 0; 302#L260-2 havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 353#L294 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 422#L297 assume !(node6_~m6~0 != ~nomsg~0); 325#L297-1 ~mode6~0 := 0; 399#L294-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 372#L502 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 373#L502-1 check_#res := check_~tmp~1; 378#L514 main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 413#L603 assume !(0 == assert_~arg % 256); 389#L598 main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 334#L570-2 [2019-10-22 08:58:29,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 1 times [2019-10-22 08:58:29,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:29,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199853099] [2019-10-22 08:58:29,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:29,832 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:29,833 INFO L82 PathProgramCache]: Analyzing trace with hash 448128979, now seen corresponding path program 2 times [2019-10-22 08:58:29,833 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:29,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486993091] [2019-10-22 08:58:29,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:29,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486993091] [2019-10-22 08:58:29,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:29,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:29,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782314421] [2019-10-22 08:58:29,953 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:29,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:29,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:29,954 INFO L87 Difference]: Start difference. First operand 134 states and 189 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-10-22 08:58:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:30,021 INFO L93 Difference]: Finished difference Result 137 states and 191 transitions. [2019-10-22 08:58:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:30,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 191 transitions. [2019-10-22 08:58:30,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 08:58:30,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 134 states and 187 transitions. [2019-10-22 08:58:30,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-10-22 08:58:30,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-10-22 08:58:30,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 187 transitions. [2019-10-22 08:58:30,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:30,027 INFO L688 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2019-10-22 08:58:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 187 transitions. [2019-10-22 08:58:30,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-10-22 08:58:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-22 08:58:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2019-10-22 08:58:30,043 INFO L711 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2019-10-22 08:58:30,043 INFO L591 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2019-10-22 08:58:30,043 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:30,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 187 transitions. [2019-10-22 08:58:30,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-10-22 08:58:30,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:30,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:30,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:30,046 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, 1, 1, 1, 1] [2019-10-22 08:58:30,046 INFO L791 eck$LassoCheckResult]: Stem: 706#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 599#L-1 havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 600#L329 assume 0 == ~r1~0; 603#L330 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 674#L331 assume ~id1~0 >= 0; 597#L332 assume 0 == ~st1~0; 598#L333 assume ~send1~0 == ~id1~0; 645#L334 assume 0 == ~mode1~0 % 256; 646#L335 assume ~id2~0 >= 0; 698#L336 assume 0 == ~st2~0; 637#L337 assume ~send2~0 == ~id2~0; 638#L338 assume 0 == ~mode2~0 % 256; 678#L339 assume ~id3~0 >= 0; 601#L340 assume 0 == ~st3~0; 602#L341 assume ~send3~0 == ~id3~0; 673#L342 assume 0 == ~mode3~0 % 256; 593#L343 assume ~id4~0 >= 0; 594#L344 assume 0 == ~st4~0; 643#L345 assume ~send4~0 == ~id4~0; 644#L346 assume 0 == ~mode4~0 % 256; 697#L347 assume ~id5~0 >= 0; 634#L348 assume 0 == ~st5~0; 635#L349 assume ~send5~0 == ~id5~0; 677#L350 assume 0 == ~mode5~0 % 256; 628#L351 assume ~id6~0 >= 0; 629#L352 assume 0 == ~st6~0; 671#L353 assume ~send6~0 == ~id6~0; 591#L354 assume 0 == ~mode6~0 % 256; 592#L355 assume ~id1~0 != ~id2~0; 641#L356 assume ~id1~0 != ~id3~0; 642#L357 assume ~id1~0 != ~id4~0; 695#L358 assume ~id1~0 != ~id5~0; 632#L359 assume ~id1~0 != ~id6~0; 633#L360 assume ~id2~0 != ~id3~0; 676#L361 assume ~id2~0 != ~id4~0; 624#L362 assume ~id2~0 != ~id5~0; 625#L363 assume ~id2~0 != ~id6~0; 670#L364 assume ~id3~0 != ~id4~0; 589#L365 assume ~id3~0 != ~id5~0; 590#L366 assume ~id3~0 != ~id6~0; 667#L367 assume ~id4~0 != ~id5~0; 668#L368 assume ~id4~0 != ~id6~0; 694#L369 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 610#L329-1 init_#res := init_~tmp~0; 611#L494 main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 617#L570-2 [2019-10-22 08:58:30,046 INFO L793 eck$LassoCheckResult]: Loop: 617#L570-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 683#L126 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 679#L130 assume !(node1_~m1~0 != ~nomsg~0); 613#L130-1 ~mode1~0 := 0; 666#L126-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 622#L158 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 623#L161 assume !(node2_~m2~0 != ~nomsg~0); 630#L161-1 ~mode2~0 := 0; 618#L158-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 619#L192 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 707#L195 assume !(node3_~m3~0 != ~nomsg~0); 582#L195-1 ~mode3~0 := 0; 687#L192-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 693#L226 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 669#L229 assume !(node4_~m4~0 != ~nomsg~0); 585#L229-1 ~mode4~0 := 0; 627#L226-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 640#L260 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 595#L263 assume !(node5_~m5~0 != ~nomsg~0); 587#L263-1 ~mode5~0 := 0; 588#L260-2 havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 636#L294 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 705#L297 assume !(node6_~m6~0 != ~nomsg~0); 608#L297-1 ~mode6~0 := 0; 682#L294-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 655#L502 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 656#L503 assume ~r1~0 < 6;check_~tmp~1 := 1; 660#L502-1 check_#res := check_~tmp~1; 661#L514 main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 696#L603 assume !(0 == assert_~arg % 256); 672#L598 main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 617#L570-2 [2019-10-22 08:58:30,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:30,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 2 times [2019-10-22 08:58:30,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:30,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882203378] [2019-10-22 08:58:30,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:30,140 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:30,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:30,141 INFO L82 PathProgramCache]: Analyzing trace with hash 623769500, now seen corresponding path program 1 times [2019-10-22 08:58:30,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:30,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907542867] [2019-10-22 08:58:30,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:30,178 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1738677955, now seen corresponding path program 1 times [2019-10-22 08:58:30,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:30,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283150251] [2019-10-22 08:58:30,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:30,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283150251] [2019-10-22 08:58:30,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:30,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:30,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069468298] [2019-10-22 08:58:30,768 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2019-10-22 08:58:31,636 WARN L191 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 134 [2019-10-22 08:58:31,654 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:31,654 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:31,655 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:31,655 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:31,655 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:31,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:31,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:31,655 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:31,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_Iteration3_Loop [2019-10-22 08:58:31,656 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:31,656 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:31,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,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-10-22 08:58:31,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,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-10-22 08:58:31,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,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-10-22 08:58:31,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:31,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,123 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-22 08:58:32,469 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-22 08:58:32,615 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:32,616 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/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-10-22 08:58:32,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:32,623 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_08332f5e-238c-431a-861f-77b981aee927/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-10-22 08:58:32,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:32,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:32,771 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:32,773 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:32,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:32,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:32,773 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:32,773 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:32,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:32,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:32,774 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:32,774 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_Iteration3_Loop [2019-10-22 08:58:32,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:32,774 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:32,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-10-22 08:58:32,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,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-10-22 08:58:32,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,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-10-22 08:58:32,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:32,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:33,276 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-22 08:58:33,551 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-22 08:58:33,579 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:33,584 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:33,585 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-10-22 08:58:33,587 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,587 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:33,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,590 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:33,590 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:33,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,594 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-10-22 08:58:33,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,597 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:33,597 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:33,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,599 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-10-22 08:58:33,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,599 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:33,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,600 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,600 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:33,600 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:33,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,601 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-10-22 08:58:33,602 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,602 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,602 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,602 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,603 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:33,603 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:33,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,606 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-10-22 08:58:33,606 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,606 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:33,606 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,607 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,607 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:33,607 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:33,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,610 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-10-22 08:58:33,610 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,610 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:33,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,611 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,611 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:33,611 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:33,612 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,612 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-10-22 08:58:33,613 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,613 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:33,613 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,614 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:33,614 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:33,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,615 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-10-22 08:58:33,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,617 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:33,617 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:33,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,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-10-22 08:58:33,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,620 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:33,620 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,621 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:58:33,621 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,622 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:58:33,622 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:33,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,626 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-10-22 08:58:33,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,628 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:33,628 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:33,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,630 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-10-22 08:58:33,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,631 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:33,631 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,631 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,632 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:33,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:33,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,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-10-22 08:58:33,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,636 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:33,636 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:33,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,639 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-10-22 08:58:33,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:33,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:33,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:33,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,641 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-10-22 08:58:33,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,642 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:33,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:33,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:33,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,644 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-10-22 08:58:33,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,644 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:33,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,645 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:33,645 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:33,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,646 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-10-22 08:58:33,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,648 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:33,648 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:33,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,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-10-22 08:58:33,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:33,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:33,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:33,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:33,654 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-10-22 08:58:33,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:33,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:33,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:33,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:33,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:33,656 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:33,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:33,657 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:33,661 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:33,661 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:58:33,663 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:33,663 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:33,663 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:33,664 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2019-10-22 08:58:33,666 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:33,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:33,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:33,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:33,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:33,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:33,805 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-10-22 08:58:33,805 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 134 states and 187 transitions. cyclomatic complexity: 54 Second operand 3 states. [2019-10-22 08:58:33,872 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 134 states and 187 transitions. cyclomatic complexity: 54. Second operand 3 states. Result 223 states and 330 transitions. Complement of second has 4 states. [2019-10-22 08:58:33,874 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-10-22 08:58:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2019-10-22 08:58:33,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 187 transitions. Stem has 45 letters. Loop has 31 letters. [2019-10-22 08:58:33,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:33,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 187 transitions. Stem has 76 letters. Loop has 31 letters. [2019-10-22 08:58:33,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:33,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 187 transitions. Stem has 45 letters. Loop has 62 letters. [2019-10-22 08:58:33,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:33,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 330 transitions. [2019-10-22 08:58:33,890 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:33,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 0 states and 0 transitions. [2019-10-22 08:58:33,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:33,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:33,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:33,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:33,891 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:33,891 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:33,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:33,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:33,892 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-10-22 08:58:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:33,892 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-10-22 08:58:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:58:33,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-10-22 08:58:33,892 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:33,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:58:33,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:33,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:33,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:33,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:33,893 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:33,893 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:33,893 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:33,893 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:33,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:33,893 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:33,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:33,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:33 BoogieIcfgContainer [2019-10-22 08:58:33,899 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:33,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:33,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:33,900 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:33,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:28" (3/4) ... [2019-10-22 08:58:33,906 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:33,906 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:33,907 INFO L168 Benchmark]: Toolchain (without parser) took 6224.50 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -199.5 MB). Peak memory consumption was 148.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:33,908 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:33,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 939.1 MB in the beginning and 1.2 GB in the end (delta: -215.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:33,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:33,909 INFO L168 Benchmark]: Boogie Preprocessor took 31.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:33,910 INFO L168 Benchmark]: RCFGBuilder took 737.71 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: 60.2 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:33,910 INFO L168 Benchmark]: BuchiAutomizer took 4943.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -57.0 MB). Peak memory consumption was 120.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:33,910 INFO L168 Benchmark]: Witness Printer took 6.60 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:33,913 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 455.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 939.1 MB in the beginning and 1.2 GB in the end (delta: -215.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 737.71 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: 60.2 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4943.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -57.0 MB). Peak memory consumption was 120.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.60 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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 + 23 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 4.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. 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 134 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 606 SDtfs, 188 SDslu, 1118 SDs, 0 SdLazy, 22 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax121 hnf105 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...