./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/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 c13792dac8774c9ebb29902c2dbd93ae05dc00b8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:00:28,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:28,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:28,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:28,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:28,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:28,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:28,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:28,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:28,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:28,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:28,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:28,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:28,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:28,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:28,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:28,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:28,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:28,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:28,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:28,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:28,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:28,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:28,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:28,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:28,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:28,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:28,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:28,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:28,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:28,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:28,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:28,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:28,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:28,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:28,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:28,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:28,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:28,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:28,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:28,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:28,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:00:28,200 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:28,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:28,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:28,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:28,202 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:28,202 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:28,202 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:28,203 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:28,203 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:28,203 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:28,203 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:28,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:28,204 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:28,204 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:28,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:28,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:28,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:28,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:28,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:28,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:28,205 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:28,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:28,205 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:28,206 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:28,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:28,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:28,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:28,207 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:28,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:28,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:28,207 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:28,208 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:28,208 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_d1189160-85df-4373-a92d-2dcae24b8cea/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 -> c13792dac8774c9ebb29902c2dbd93ae05dc00b8 [2019-10-22 09:00:28,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:28,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:28,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:28,266 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:28,267 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:28,268 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2019-10-22 09:00:28,316 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/bin/uautomizer/data/f24612e24/0e198ab86bd94fa7ba0320dcd8f7600e/FLAGc54519b14 [2019-10-22 09:00:28,745 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:28,745 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2019-10-22 09:00:28,755 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/bin/uautomizer/data/f24612e24/0e198ab86bd94fa7ba0320dcd8f7600e/FLAGc54519b14 [2019-10-22 09:00:28,768 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/bin/uautomizer/data/f24612e24/0e198ab86bd94fa7ba0320dcd8f7600e [2019-10-22 09:00:28,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:28,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:28,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:28,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:28,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:28,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:28" (1/1) ... [2019-10-22 09:00:28,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eafad64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:28, skipping insertion in model container [2019-10-22 09:00:28,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:28" (1/1) ... [2019-10-22 09:00:28,787 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:28,819 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:29,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:29,139 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:29,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:29,209 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:29,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:29 WrapperNode [2019-10-22 09:00:29,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:29,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:29,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:29,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:29,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:29" (1/1) ... [2019-10-22 09:00:29,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:29" (1/1) ... [2019-10-22 09:00:29,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:29,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:29,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:29,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:29,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:29" (1/1) ... [2019-10-22 09:00:29,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:29" (1/1) ... [2019-10-22 09:00:29,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:29" (1/1) ... [2019-10-22 09:00:29,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:29" (1/1) ... [2019-10-22 09:00:29,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:29" (1/1) ... [2019-10-22 09:00:29,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:29" (1/1) ... [2019-10-22 09:00:29,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:29" (1/1) ... [2019-10-22 09:00:29,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:29,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:29,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:29,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:29,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/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 09:00:29,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:29,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:30,037 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:30,038 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-10-22 09:00:30,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:30 BoogieIcfgContainer [2019-10-22 09:00:30,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:30,040 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:30,040 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:30,043 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:30,044 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:30,044 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:28" (1/3) ... [2019-10-22 09:00:30,045 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d144ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:30, skipping insertion in model container [2019-10-22 09:00:30,045 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:30,046 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:29" (2/3) ... [2019-10-22 09:00:30,046 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d144ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:30, skipping insertion in model container [2019-10-22 09:00:30,046 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:30,046 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:30" (3/3) ... [2019-10-22 09:00:30,048 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2019-10-22 09:00:30,088 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:30,089 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:30,089 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:30,089 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:30,090 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:30,090 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:30,090 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:30,091 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:30,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states. [2019-10-22 09:00:30,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2019-10-22 09:00:30,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:30,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:30,140 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:30,140 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:30,141 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:30,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states. [2019-10-22 09:00:30,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2019-10-22 09:00:30,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:30,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:30,147 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:30,148 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:30,155 INFO L791 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 8#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 55#L287true assume !(0 == ~r1~0);init_~tmp~0 := 0; 39#L287-1true init_#res := init_~tmp~0; 65#L416true main_#t~ret35 := init_#res;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 49#L485-2true [2019-10-22 09:00:30,156 INFO L793 eck$LassoCheckResult]: Loop: 49#L485-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 98#L118true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 33#L122true assume !(node1_~m1~0 != ~nomsg~0); 46#L122-1true ~mode1~0 := 0; 85#L118-2true havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 26#L150true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 16#L153true assume !(node2_~m2~0 != ~nomsg~0); 15#L153-1true ~mode2~0 := 0; 7#L150-2true havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 103#L184true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 82#L187true assume !(node3_~m3~0 != ~nomsg~0); 81#L187-1true ~mode3~0 := 0; 99#L184-2true havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 48#L218true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 38#L221true assume !(node4_~m4~0 != ~nomsg~0); 37#L221-1true ~mode4~0 := 0; 59#L218-2true havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 4#L252true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 9#L255true assume !(node5_~m5~0 != ~nomsg~0); 111#L255-1true ~mode5~0 := 0; 3#L252-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 70#L424true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 73#L424-1true check_#res := check_~tmp~1; 23#L436true main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 61#L515true assume !(0 == assert_~arg % 256); 41#L510true main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; 49#L485-2true [2019-10-22 09:00:30,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:30,162 INFO L82 PathProgramCache]: Analyzing trace with hash 28880448, now seen corresponding path program 1 times [2019-10-22 09:00:30,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:30,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198340165] [2019-10-22 09:00:30,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,351 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 09:00:30,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198340165] [2019-10-22 09:00:30,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:30,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:30,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591126950] [2019-10-22 09:00:30,357 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:30,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:30,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1018090030, now seen corresponding path program 1 times [2019-10-22 09:00:30,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:30,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60566755] [2019-10-22 09:00:30,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,460 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 09:00:30,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60566755] [2019-10-22 09:00:30,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:30,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:30,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058308338] [2019-10-22 09:00:30,463 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:30,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:30,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:30,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:30,478 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 4 states. [2019-10-22 09:00:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:30,565 INFO L93 Difference]: Finished difference Result 118 states and 195 transitions. [2019-10-22 09:00:30,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:30,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 195 transitions. [2019-10-22 09:00:30,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2019-10-22 09:00:30,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 111 states and 157 transitions. [2019-10-22 09:00:30,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2019-10-22 09:00:30,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2019-10-22 09:00:30,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 157 transitions. [2019-10-22 09:00:30,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:30,580 INFO L688 BuchiCegarLoop]: Abstraction has 111 states and 157 transitions. [2019-10-22 09:00:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 157 transitions. [2019-10-22 09:00:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-22 09:00:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-22 09:00:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2019-10-22 09:00:30,611 INFO L711 BuchiCegarLoop]: Abstraction has 111 states and 157 transitions. [2019-10-22 09:00:30,611 INFO L591 BuchiCegarLoop]: Abstraction has 111 states and 157 transitions. [2019-10-22 09:00:30,611 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:30,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 157 transitions. [2019-10-22 09:00:30,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2019-10-22 09:00:30,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:30,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:30,614 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:30,614 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:30,614 INFO L791 eck$LassoCheckResult]: Stem: 353#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 260#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 261#L287 assume 0 == ~r1~0; 266#L288 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 267#L289 assume ~id1~0 >= 0; 321#L290 assume 0 == ~st1~0; 322#L291 assume ~send1~0 == ~id1~0; 350#L292 assume 0 == ~mode1~0 % 256; 275#L293 assume ~id2~0 >= 0; 276#L294 assume 0 == ~st2~0; 330#L295 assume ~send2~0 == ~id2~0; 256#L296 assume 0 == ~mode2~0 % 256; 257#L297 assume ~id3~0 >= 0; 334#L298 assume 0 == ~st3~0; 270#L299 assume ~send3~0 == ~id3~0; 271#L300 assume 0 == ~mode3~0 % 256; 323#L301 assume ~id4~0 >= 0; 324#L302 assume 0 == ~st4~0; 337#L303 assume ~send4~0 == ~id4~0; 297#L304 assume 0 == ~mode4~0 % 256; 298#L305 assume ~id5~0 >= 0; 336#L306 assume 0 == ~st5~0; 268#L307 assume ~send5~0 == ~id5~0; 269#L308 assume 0 == ~mode5~0 % 256; 331#L309 assume ~id1~0 != ~id2~0; 254#L310 assume ~id1~0 != ~id3~0; 255#L311 assume ~id1~0 != ~id4~0; 305#L312 assume ~id1~0 != ~id5~0; 306#L313 assume ~id2~0 != ~id3~0; 349#L314 assume ~id2~0 != ~id4~0; 295#L315 assume ~id2~0 != ~id5~0; 296#L316 assume ~id3~0 != ~id4~0; 335#L317 assume ~id3~0 != ~id5~0; 264#L318 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 265#L287-1 init_#res := init_~tmp~0; 314#L416 main_#t~ret35 := init_#res;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 317#L485-2 [2019-10-22 09:00:30,615 INFO L793 eck$LassoCheckResult]: Loop: 317#L485-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 328#L118 assume !(0 != ~mode1~0 % 256); 281#L136 assume !(0 != ~alive1~0 % 256); 277#L136-2 ~mode1~0 := 1; 278#L118-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 290#L150 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 273#L153 assume !(node2_~m2~0 != ~nomsg~0); 272#L153-1 ~mode2~0 := 0; 258#L150-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 259#L184 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 351#L187 assume !(node3_~m3~0 != ~nomsg~0); 309#L187-1 ~mode3~0 := 0; 344#L184-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 327#L218 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 312#L221 assume !(node4_~m4~0 != ~nomsg~0); 311#L221-1 ~mode4~0 := 0; 293#L218-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 251#L252 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 253#L255 assume !(node5_~m5~0 != ~nomsg~0); 263#L255-1 ~mode5~0 := 0; 249#L252-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 250#L424 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 280#L424-1 check_#res := check_~tmp~1; 286#L436 main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 287#L515 assume !(0 == assert_~arg % 256); 316#L510 main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; 317#L485-2 [2019-10-22 09:00:30,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:30,615 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 1 times [2019-10-22 09:00:30,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:30,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551107142] [2019-10-22 09:00:30,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:30,701 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:30,702 INFO L82 PathProgramCache]: Analyzing trace with hash 214509128, now seen corresponding path program 1 times [2019-10-22 09:00:30,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:30,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040967568] [2019-10-22 09:00:30,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:30,771 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 09:00:30,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040967568] [2019-10-22 09:00:30,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:30,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:30,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019335157] [2019-10-22 09:00:30,772 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:30,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:30,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:30,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:30,773 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. cyclomatic complexity: 47 Second operand 5 states. [2019-10-22 09:00:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:30,823 INFO L93 Difference]: Finished difference Result 114 states and 159 transitions. [2019-10-22 09:00:30,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:30,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 159 transitions. [2019-10-22 09:00:30,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2019-10-22 09:00:30,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 111 states and 155 transitions. [2019-10-22 09:00:30,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2019-10-22 09:00:30,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2019-10-22 09:00:30,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 155 transitions. [2019-10-22 09:00:30,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:30,828 INFO L688 BuchiCegarLoop]: Abstraction has 111 states and 155 transitions. [2019-10-22 09:00:30,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 155 transitions. [2019-10-22 09:00:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-22 09:00:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-22 09:00:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2019-10-22 09:00:30,833 INFO L711 BuchiCegarLoop]: Abstraction has 111 states and 155 transitions. [2019-10-22 09:00:30,833 INFO L591 BuchiCegarLoop]: Abstraction has 111 states and 155 transitions. [2019-10-22 09:00:30,833 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:30,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 155 transitions. [2019-10-22 09:00:30,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2019-10-22 09:00:30,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:30,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:30,836 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:30,836 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:30,836 INFO L791 eck$LassoCheckResult]: Stem: 590#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 497#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~ret35, main_#t~ret36, main_#t~post37, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id1~0 := main_#t~nondet10;havoc main_#t~nondet10;~st1~0 := main_#t~nondet11;havoc main_#t~nondet11;~send1~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode1~0 := main_#t~nondet13;havoc main_#t~nondet13;~alive1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~alive2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~alive3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~alive4~0 := main_#t~nondet29;havoc main_#t~nondet29;~id5~0 := main_#t~nondet30;havoc main_#t~nondet30;~st5~0 := main_#t~nondet31;havoc main_#t~nondet31;~send5~0 := main_#t~nondet32;havoc main_#t~nondet32;~mode5~0 := main_#t~nondet33;havoc main_#t~nondet33;~alive5~0 := main_#t~nondet34;havoc main_#t~nondet34;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 498#L287 assume 0 == ~r1~0; 503#L288 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 504#L289 assume ~id1~0 >= 0; 558#L290 assume 0 == ~st1~0; 559#L291 assume ~send1~0 == ~id1~0; 587#L292 assume 0 == ~mode1~0 % 256; 512#L293 assume ~id2~0 >= 0; 513#L294 assume 0 == ~st2~0; 567#L295 assume ~send2~0 == ~id2~0; 493#L296 assume 0 == ~mode2~0 % 256; 494#L297 assume ~id3~0 >= 0; 571#L298 assume 0 == ~st3~0; 507#L299 assume ~send3~0 == ~id3~0; 508#L300 assume 0 == ~mode3~0 % 256; 560#L301 assume ~id4~0 >= 0; 561#L302 assume 0 == ~st4~0; 574#L303 assume ~send4~0 == ~id4~0; 534#L304 assume 0 == ~mode4~0 % 256; 535#L305 assume ~id5~0 >= 0; 573#L306 assume 0 == ~st5~0; 505#L307 assume ~send5~0 == ~id5~0; 506#L308 assume 0 == ~mode5~0 % 256; 568#L309 assume ~id1~0 != ~id2~0; 491#L310 assume ~id1~0 != ~id3~0; 492#L311 assume ~id1~0 != ~id4~0; 542#L312 assume ~id1~0 != ~id5~0; 543#L313 assume ~id2~0 != ~id3~0; 586#L314 assume ~id2~0 != ~id4~0; 532#L315 assume ~id2~0 != ~id5~0; 533#L316 assume ~id3~0 != ~id4~0; 572#L317 assume ~id3~0 != ~id5~0; 501#L318 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 502#L287-1 init_#res := init_~tmp~0; 551#L416 main_#t~ret35 := init_#res;main_~i2~0 := main_#t~ret35;havoc main_#t~ret35;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 554#L485-2 [2019-10-22 09:00:30,837 INFO L793 eck$LassoCheckResult]: Loop: 554#L485-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 565#L118 assume !(0 != ~mode1~0 % 256); 518#L136 assume !(0 != ~alive1~0 % 256); 514#L136-2 ~mode1~0 := 1; 515#L118-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 527#L150 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 510#L153 assume !(node2_~m2~0 != ~nomsg~0); 509#L153-1 ~mode2~0 := 0; 495#L150-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 496#L184 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 588#L187 assume !(node3_~m3~0 != ~nomsg~0); 546#L187-1 ~mode3~0 := 0; 581#L184-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 564#L218 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 549#L221 assume !(node4_~m4~0 != ~nomsg~0); 548#L221-1 ~mode4~0 := 0; 530#L218-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 488#L252 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 490#L255 assume !(node5_~m5~0 != ~nomsg~0); 500#L255-1 ~mode5~0 := 0; 486#L252-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 487#L424 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 525#L425 assume ~r1~0 < 5;check_~tmp~1 := 1; 517#L424-1 check_#res := check_~tmp~1; 523#L436 main_#t~ret36 := check_#res;main_~c1~0 := main_#t~ret36;havoc main_#t~ret36;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 524#L515 assume !(0 == assert_~arg % 256); 553#L510 main_#t~post37 := main_~i2~0;main_~i2~0 := 1 + main_#t~post37;havoc main_#t~post37; 554#L485-2 [2019-10-22 09:00:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 2 times [2019-10-22 09:00:30,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:30,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289544436] [2019-10-22 09:00:30,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:30,909 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:30,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:30,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1971488599, now seen corresponding path program 1 times [2019-10-22 09:00:30,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:30,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662959215] [2019-10-22 09:00:30,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:30,956 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:30,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:30,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2077663555, now seen corresponding path program 1 times [2019-10-22 09:00:30,956 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:30,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310888345] [2019-10-22 09:00:30,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:30,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,057 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 09:00:31,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310888345] [2019-10-22 09:00:31,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:31,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:31,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309632261] [2019-10-22 09:00:31,404 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 124 [2019-10-22 09:00:31,786 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2019-10-22 09:00:31,798 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:31,799 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:31,799 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:31,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:31,800 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:31,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:31,800 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:31,800 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:31,800 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2019-10-22 09:00:31,800 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:31,802 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:31,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,846 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 09:00:31,849 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 09:00:31,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 09:00: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 09:00: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 09:00: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 09:00:31,865 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 09:00:31,867 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 09:00:31,872 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 09:00: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 09:00:31,876 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 09:00:31,880 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 09:00:31,884 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 09:00: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 09:00: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 09:00: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 09:00:31,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 09:00:31,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 09:00:31,908 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 09:00:31,910 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 09:00:31,912 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 09:00:31,914 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 09:00:31,917 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 09:00:31,918 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 09:00:31,924 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 09:00:31,926 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 09:00:31,963 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 09:00:31,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 09:00:31,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 09:00:31,973 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 09:00:31,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 09:00:31,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 09:00:32,504 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:32,505 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/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 09:00:32,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:32,518 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1189160-85df-4373-a92d-2dcae24b8cea/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 09:00:32,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:32,528 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:32,622 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:32,624 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:32,624 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:32,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:32,624 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:32,624 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:32,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:32,624 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:32,625 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:32,625 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2019-10-22 09:00:32,625 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:32,625 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:32,628 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 09:00:32,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,635 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 09:00:32,637 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 09:00:32,639 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 09:00:32,642 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 09:00:32,645 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 09:00:32,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,648 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 09:00:32,651 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 09:00:32,653 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 09:00:32,654 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 09:00:32,656 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 09:00:32,659 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 09:00:32,661 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 09:00:32,662 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 09:00:32,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,669 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 09:00:32,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,705 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 09:00:32,709 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 09:00:32,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:32,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 09:00:32,717 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 09:00:32,720 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 09:00:32,721 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 09:00:32,724 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 09:00:32,725 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 09:00:32,728 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 09:00:32,732 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 09:00:32,734 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 09:00:33,184 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:33,189 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:33,191 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 09:00:33,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,192 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,195 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,195 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,199 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 09:00:33,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,201 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:33,201 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:33,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,203 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 09:00:33,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,204 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,204 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,205 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,205 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,206 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 09:00:33,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,207 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,207 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,208 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:33,208 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:33,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,210 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 09:00:33,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,211 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,211 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,211 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,212 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,212 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,214 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 09:00:33,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,215 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,216 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,216 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,217 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 09:00:33,217 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,217 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,218 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,218 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,218 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,218 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,219 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 09:00:33,219 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,220 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,221 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:33,221 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:33,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,223 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 09:00:33,224 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,224 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,225 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,225 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,227 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 09:00:33,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,227 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,228 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,228 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,229 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:33,229 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:33,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,231 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 09:00:33,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,231 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,232 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,232 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,233 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 09:00:33,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,234 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,234 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,234 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,234 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,234 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,235 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 09:00:33,236 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,236 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,236 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,236 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,236 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,236 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,238 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 09:00:33,238 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,238 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,239 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,239 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,240 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 09:00:33,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,240 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,240 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,241 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,242 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,242 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,242 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 09:00:33,243 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,243 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,243 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,243 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,244 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:33,244 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:33,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,247 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 09:00:33,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,247 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,247 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,247 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,248 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,248 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,250 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 09:00:33,250 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,250 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,251 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,251 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,251 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,252 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:33,256 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:33,256 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:00:33,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:33,258 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:33,258 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:33,259 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2019-10-22 09:00:33,260 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:33,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:33,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:33,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:33,388 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 09:00:33,392 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 09:00:33,392 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 155 transitions. cyclomatic complexity: 45 Second operand 3 states. [2019-10-22 09:00:33,444 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 155 transitions. cyclomatic complexity: 45. Second operand 3 states. Result 186 states and 275 transitions. Complement of second has 4 states. [2019-10-22 09:00:33,445 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 09:00:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2019-10-22 09:00:33,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 155 transitions. Stem has 36 letters. Loop has 27 letters. [2019-10-22 09:00:33,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:33,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 155 transitions. Stem has 63 letters. Loop has 27 letters. [2019-10-22 09:00:33,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:33,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 155 transitions. Stem has 36 letters. Loop has 54 letters. [2019-10-22 09:00:33,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:33,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 275 transitions. [2019-10-22 09:00:33,456 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:33,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 0 states and 0 transitions. [2019-10-22 09:00:33,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:33,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:33,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:33,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:33,456 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:33,456 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:33,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:33,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:33,457 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-10-22 09:00:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:33,457 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-10-22 09:00:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:00:33,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-10-22 09:00:33,458 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:33,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:00:33,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:33,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:33,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:33,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:33,458 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:33,458 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:33,458 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:33,458 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:33,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:33,459 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:33,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:33,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:33 BoogieIcfgContainer [2019-10-22 09:00:33,464 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:33,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:33,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:33,464 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:33,465 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:30" (3/4) ... [2019-10-22 09:00:33,473 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:33,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:33,475 INFO L168 Benchmark]: Toolchain (without parser) took 4702.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -121.1 MB). Peak memory consumption was 77.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:33,475 INFO L168 Benchmark]: CDTParser took 0.21 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 09:00:33,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -206.9 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:33,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:33,477 INFO L168 Benchmark]: Boogie Preprocessor took 68.17 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:33,477 INFO L168 Benchmark]: RCFGBuilder took 704.66 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:33,478 INFO L168 Benchmark]: BuchiAutomizer took 3424.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:33,478 INFO L168 Benchmark]: Witness Printer took 9.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:33,481 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.21 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 436.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -206.9 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.17 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 704.66 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3424.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. * Witness Printer took 9.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 111 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 501 SDtfs, 274 SDslu, 926 SDs, 0 SdLazy, 22 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax142 hnf109 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq228 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...