./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/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 eee91c19016e0e0d442fe120ce120b855cb8f82c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 03:03:15,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:03:15,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:03:15,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:03:15,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:03:15,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:03:15,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:03:15,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:03:15,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:03:15,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:03:15,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:03:15,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:03:15,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:03:15,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:03:15,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:03:15,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:03:15,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:03:15,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:03:15,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:03:15,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:03:15,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:03:15,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:03:15,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:03:15,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:03:15,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:03:15,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:03:15,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:03:15,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:03:15,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:03:15,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:03:15,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:03:15,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:03:15,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:03:15,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:03:15,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:03:15,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:03:15,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:03:15,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:03:15,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:03:15,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:03:15,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:03:15,362 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:03:15,401 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:03:15,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:03:15,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:03:15,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:03:15,404 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:03:15,404 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:03:15,404 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:03:15,404 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:03:15,405 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:03:15,405 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:03:15,406 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:03:15,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:03:15,406 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:03:15,407 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:03:15,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:03:15,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:03:15,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:03:15,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:03:15,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:03:15,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:03:15,408 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:03:15,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:03:15,408 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:03:15,409 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:03:15,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:03:15,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:03:15,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:03:15,410 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:03:15,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:03:15,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:03:15,410 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:03:15,410 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:03:15,412 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:03:15,412 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/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 -> eee91c19016e0e0d442fe120ce120b855cb8f82c [2020-11-28 03:03:15,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:03:15,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:03:15,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:03:15,746 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:03:15,753 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:03:15,754 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2020-11-28 03:03:15,834 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/data/43875cd76/10fea36aea5e4b7491e2f4f2ba088746/FLAGcdba5cb4b [2020-11-28 03:03:16,296 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:03:16,297 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2020-11-28 03:03:16,306 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/data/43875cd76/10fea36aea5e4b7491e2f4f2ba088746/FLAGcdba5cb4b [2020-11-28 03:03:16,686 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/data/43875cd76/10fea36aea5e4b7491e2f4f2ba088746 [2020-11-28 03:03:16,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:03:16,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:03:16,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:03:16,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:03:16,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:03:16,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:16" (1/1) ... [2020-11-28 03:03:16,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce73b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:16, skipping insertion in model container [2020-11-28 03:03:16,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:16" (1/1) ... [2020-11-28 03:03:16,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:03:16,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:03:16,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:03:16,995 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:03:17,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:03:17,051 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:03:17,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:17 WrapperNode [2020-11-28 03:03:17,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:03:17,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:03:17,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:03:17,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:03:17,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:17" (1/1) ... [2020-11-28 03:03:17,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:17" (1/1) ... [2020-11-28 03:03:17,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:03:17,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:03:17,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:03:17,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:03:17,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:17" (1/1) ... [2020-11-28 03:03:17,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:17" (1/1) ... [2020-11-28 03:03:17,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:17" (1/1) ... [2020-11-28 03:03:17,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:17" (1/1) ... [2020-11-28 03:03:17,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:17" (1/1) ... [2020-11-28 03:03:17,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:17" (1/1) ... [2020-11-28 03:03:17,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:17" (1/1) ... [2020-11-28 03:03:17,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:03:17,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:03:17,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:03:17,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:03:17,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/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 [2020-11-28 03:03:17,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:03:17,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:03:17,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:03:17,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:03:17,754 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:03:17,754 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-11-28 03:03:17,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:17 BoogieIcfgContainer [2020-11-28 03:03:17,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:03:17,757 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:03:17,757 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:03:17,761 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:03:17,761 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:03:17,762 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:03:16" (1/3) ... [2020-11-28 03:03:17,763 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4769ea68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:03:17, skipping insertion in model container [2020-11-28 03:03:17,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:03:17,763 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:17" (2/3) ... [2020-11-28 03:03:17,764 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4769ea68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:03:17, skipping insertion in model container [2020-11-28 03:03:17,764 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:03:17,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:17" (3/3) ... [2020-11-28 03:03:17,766 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2020-11-28 03:03:17,830 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:03:17,830 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:03:17,830 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:03:17,830 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:03:17,831 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:03:17,831 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:03:17,831 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:03:17,831 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:03:17,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states. [2020-11-28 03:03:17,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-11-28 03:03:17,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:03:17,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:03:17,893 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:03:17,893 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:03:17,893 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:03:17,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states. [2020-11-28 03:03:17,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-11-28 03:03:17,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:03:17,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:03:17,911 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:03:17,912 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:03:17,920 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~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]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~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;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 41#L132true assume !(0 == ~r1~0);init_~tmp~0 := 0; 38#L132-1true init_#res := init_~tmp~0; 4#L197true main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 40#L249true assume !(0 == main_~i2~0); 35#L249-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 52#L257-2true [2020-11-28 03:03:17,922 INFO L796 eck$LassoCheckResult]: Loop: 52#L257-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 12#L54true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 3#L58true assume !(node1_~m1~0 != ~nomsg~0); 19#L58-1true ~mode1~0 := 0; 60#L54-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 48#L82true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 53#L85true assume !(node2_~m2~0 != ~nomsg~0); 30#L85-1true ~mode2~0 := 0; 46#L82-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 54#L107true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 39#L110true assume !(node3_~m3~0 != ~nomsg~0); 36#L110-1true ~mode3~0 := 0; 29#L107-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 37#L205true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 34#L205-1true check_#res := check_~tmp~1; 63#L225true main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 20#L281true assume !(0 == assert_~arg % 256); 51#L276true main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 52#L257-2true [2020-11-28 03:03:17,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:03:17,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2020-11-28 03:03:17,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:03:17,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092832644] [2020-11-28 03:03:17,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:03:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:03:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:03:18,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092832644] [2020-11-28 03:03:18,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:03:18,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:03:18,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480581069] [2020-11-28 03:03:18,223 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:03:18,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:03:18,224 INFO L82 PathProgramCache]: Analyzing trace with hash 517894128, now seen corresponding path program 1 times [2020-11-28 03:03:18,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:03:18,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166679859] [2020-11-28 03:03:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:03:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:03:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:03:18,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166679859] [2020-11-28 03:03:18,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:03:18,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:03:18,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484520710] [2020-11-28 03:03:18,430 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:03:18,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:03:18,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:03:18,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:03:18,449 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2020-11-28 03:03:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:03:18,638 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2020-11-28 03:03:18,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:03:18,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 154 transitions. [2020-11-28 03:03:18,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-28 03:03:18,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 90 states and 130 transitions. [2020-11-28 03:03:18,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-11-28 03:03:18,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2020-11-28 03:03:18,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2020-11-28 03:03:18,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:03:18,657 INFO L691 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2020-11-28 03:03:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2020-11-28 03:03:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2020-11-28 03:03:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-28 03:03:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2020-11-28 03:03:18,685 INFO L714 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-11-28 03:03:18,685 INFO L594 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-11-28 03:03:18,686 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:03:18,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2020-11-28 03:03:18,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-28 03:03:18,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:03:18,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:03:18,689 INFO L852 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] [2020-11-28 03:03:18,689 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:03:18,689 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~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]; 191#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~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;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 192#L132 assume 0 == ~r1~0; 225#L133 assume ~id1~0 >= 0; 226#L134 assume 0 == ~st1~0; 184#L135 assume ~send1~0 == ~id1~0; 185#L136 assume 0 == ~mode1~0 % 256; 212#L137 assume ~id2~0 >= 0; 193#L138 assume 0 == ~st2~0; 194#L139 assume ~send2~0 == ~id2~0; 218#L140 assume 0 == ~mode2~0 % 256; 233#L141 assume ~id3~0 >= 0; 200#L142 assume 0 == ~st3~0; 201#L143 assume ~send3~0 == ~id3~0; 205#L144 assume 0 == ~mode3~0 % 256; 228#L145 assume ~id1~0 != ~id2~0; 186#L146 assume ~id1~0 != ~id3~0; 187#L147 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 213#L132-1 init_#res := init_~tmp~0; 182#L197 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 183#L249 assume !(0 == main_~i2~0); 220#L249-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 221#L257-2 [2020-11-28 03:03:18,689 INFO L796 eck$LassoCheckResult]: Loop: 221#L257-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 195#L54 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 179#L58 assume !(node1_~m1~0 != ~nomsg~0); 180#L58-1 ~mode1~0 := 0; 204#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 230#L82 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 231#L85 assume !(node2_~m2~0 != ~nomsg~0); 215#L85-1 ~mode2~0 := 0; 189#L82-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 227#L107 assume !(0 != ~mode3~0 % 256); 199#L120 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 197#L120-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 198#L107-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 214#L205 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 208#L205-1 check_#res := check_~tmp~1; 219#L225 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 202#L281 assume !(0 == assert_~arg % 256); 203#L276 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 221#L257-2 [2020-11-28 03:03:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:03:18,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2020-11-28 03:03:18,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:03:18,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296618394] [2020-11-28 03:03:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:03:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:03:18,724 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:03:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:03:18,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:03:18,787 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:03:18,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:03:18,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1735879526, now seen corresponding path program 1 times [2020-11-28 03:03:18,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:03:18,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164476087] [2020-11-28 03:03:18,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:03:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:03:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:03:18,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164476087] [2020-11-28 03:03:18,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:03:18,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:03:18,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970098422] [2020-11-28 03:03:18,922 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:03:18,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:03:18,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:03:18,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:03:18,923 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. cyclomatic complexity: 21 Second operand 5 states. [2020-11-28 03:03:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:03:19,008 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2020-11-28 03:03:19,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:03:19,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2020-11-28 03:03:19,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-28 03:03:19,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2020-11-28 03:03:19,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-11-28 03:03:19,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-11-28 03:03:19,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2020-11-28 03:03:19,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:03:19,014 INFO L691 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-11-28 03:03:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2020-11-28 03:03:19,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-11-28 03:03:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-28 03:03:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2020-11-28 03:03:19,019 INFO L714 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-11-28 03:03:19,019 INFO L594 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-11-28 03:03:19,020 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:03:19,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2020-11-28 03:03:19,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-28 03:03:19,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:03:19,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:03:19,023 INFO L852 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] [2020-11-28 03:03:19,028 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:03:19,028 INFO L794 eck$LassoCheckResult]: Stem: 343#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~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]; 318#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~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;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 319#L132 assume 0 == ~r1~0; 352#L133 assume ~id1~0 >= 0; 353#L134 assume 0 == ~st1~0; 311#L135 assume ~send1~0 == ~id1~0; 312#L136 assume 0 == ~mode1~0 % 256; 338#L137 assume ~id2~0 >= 0; 320#L138 assume 0 == ~st2~0; 321#L139 assume ~send2~0 == ~id2~0; 344#L140 assume 0 == ~mode2~0 % 256; 360#L141 assume ~id3~0 >= 0; 327#L142 assume 0 == ~st3~0; 328#L143 assume ~send3~0 == ~id3~0; 332#L144 assume 0 == ~mode3~0 % 256; 354#L145 assume ~id1~0 != ~id2~0; 313#L146 assume ~id1~0 != ~id3~0; 314#L147 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 339#L132-1 init_#res := init_~tmp~0; 309#L197 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 310#L249 assume !(0 == main_~i2~0); 347#L249-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 348#L257-2 [2020-11-28 03:03:19,029 INFO L796 eck$LassoCheckResult]: Loop: 348#L257-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 322#L54 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 306#L58 assume !(node1_~m1~0 != ~nomsg~0); 307#L58-1 ~mode1~0 := 0; 329#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 356#L82 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 357#L85 assume !(node2_~m2~0 != ~nomsg~0); 341#L85-1 ~mode2~0 := 0; 316#L82-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 355#L107 assume !(0 != ~mode3~0 % 256); 326#L120 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 324#L120-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 325#L107-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 340#L205 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 349#L206 assume ~r1~0 >= 3; 335#L210 assume ~r1~0 < 3;check_~tmp~1 := 1; 345#L205-1 check_#res := check_~tmp~1; 346#L225 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 330#L281 assume !(0 == assert_~arg % 256); 331#L276 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 348#L257-2 [2020-11-28 03:03:19,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:03:19,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2020-11-28 03:03:19,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:03:19,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733409670] [2020-11-28 03:03:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:03:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:03:19,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:03:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:03:19,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:03:19,141 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:03:19,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:03:19,142 INFO L82 PathProgramCache]: Analyzing trace with hash 317028566, now seen corresponding path program 1 times [2020-11-28 03:03:19,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:03:19,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920297232] [2020-11-28 03:03:19,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:03:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:03:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:03:19,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920297232] [2020-11-28 03:03:19,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:03:19,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:03:19,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950118366] [2020-11-28 03:03:19,200 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:03:19,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:03:19,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:03:19,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:03:19,202 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. cyclomatic complexity: 18 Second operand 3 states. [2020-11-28 03:03:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:03:19,241 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2020-11-28 03:03:19,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:03:19,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2020-11-28 03:03:19,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-11-28 03:03:19,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2020-11-28 03:03:19,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-11-28 03:03:19,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-11-28 03:03:19,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2020-11-28 03:03:19,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:03:19,246 INFO L691 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-28 03:03:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2020-11-28 03:03:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-28 03:03:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-28 03:03:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2020-11-28 03:03:19,253 INFO L714 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-28 03:03:19,253 INFO L594 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-28 03:03:19,253 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:03:19,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2020-11-28 03:03:19,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-11-28 03:03:19,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:03:19,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:03:19,256 INFO L852 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] [2020-11-28 03:03:19,258 INFO L853 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] [2020-11-28 03:03:19,259 INFO L794 eck$LassoCheckResult]: Stem: 489#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~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]; 464#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~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;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 465#L132 assume 0 == ~r1~0; 500#L133 assume ~id1~0 >= 0; 501#L134 assume 0 == ~st1~0; 457#L135 assume ~send1~0 == ~id1~0; 458#L136 assume 0 == ~mode1~0 % 256; 484#L137 assume ~id2~0 >= 0; 466#L138 assume 0 == ~st2~0; 467#L139 assume ~send2~0 == ~id2~0; 490#L140 assume 0 == ~mode2~0 % 256; 511#L141 assume ~id3~0 >= 0; 473#L142 assume 0 == ~st3~0; 474#L143 assume ~send3~0 == ~id3~0; 478#L144 assume 0 == ~mode3~0 % 256; 503#L145 assume ~id1~0 != ~id2~0; 459#L146 assume ~id1~0 != ~id3~0; 460#L147 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 485#L132-1 init_#res := init_~tmp~0; 455#L197 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 456#L249 assume !(0 == main_~i2~0); 493#L249-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 494#L257-2 [2020-11-28 03:03:19,259 INFO L796 eck$LassoCheckResult]: Loop: 494#L257-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 531#L54 assume !(0 != ~mode1~0 % 256); 530#L70 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite7 := ~p1_new~0; 499#L70-2 ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 475#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 504#L82 assume !(0 != ~mode2~0 % 256); 488#L95 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 461#L95-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 462#L82-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 502#L107 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 497#L110 assume !(node3_~m3~0 != ~nomsg~0); 483#L110-1 ~mode3~0 := 0; 515#L107-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 514#L205 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 513#L206 assume !(~r1~0 >= 3); 480#L209 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 481#L210 assume ~r1~0 < 3;check_~tmp~1 := 1; 535#L205-1 check_#res := check_~tmp~1; 534#L225 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 533#L281 assume !(0 == assert_~arg % 256); 532#L276 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 494#L257-2 [2020-11-28 03:03:19,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:03:19,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2020-11-28 03:03:19,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:03:19,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209199227] [2020-11-28 03:03:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:03:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:03:19,309 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:03:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:03:19,324 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:03:19,333 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:03:19,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:03:19,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1423181589, now seen corresponding path program 1 times [2020-11-28 03:03:19,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:03:19,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172231053] [2020-11-28 03:03:19,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:03:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:03:19,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:03:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:03:19,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:03:19,387 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:03:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:03:19,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1593761069, now seen corresponding path program 1 times [2020-11-28 03:03:19,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:03:19,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100058219] [2020-11-28 03:03:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:03:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:03:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:03:19,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100058219] [2020-11-28 03:03:19,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:03:19,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:03:19,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104831225] [2020-11-28 03:03:19,892 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 102 [2020-11-28 03:03:20,309 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2020-11-28 03:03:20,322 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:03:20,322 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:03:20,323 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:03:20,323 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:03:20,323 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-28 03:03:20,323 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:03:20,323 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:03:20,324 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:03:20,324 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-28 03:03:20,324 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:03:20,324 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:03:20,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,655 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-11-28 03:03:20,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:20,982 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-28 03:03:21,012 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-28 03:03:26,823 WARN L193 SmtUtils]: Spent 5.67 s on a formula simplification. DAG size of input: 175 DAG size of output: 103 [2020-11-28 03:03:26,910 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:03:26,911 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/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) [2020-11-28 03:03:26,917 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-28 03:03:26,917 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/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 [2020-11-28 03:03:26,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-28 03:03:26,946 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-28 03:03:26,972 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-28 03:03:26,973 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:03:26,974 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:03:26,974 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:03:26,974 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:03:26,974 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:03:26,974 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:03:26,974 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:03:26,974 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:03:26,974 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-28 03:03:26,974 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:03:26,974 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:03:26,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:26,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,211 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-11-28 03:03:27,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:03:27,515 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-28 03:03:27,528 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-11-28 03:03:32,971 WARN L193 SmtUtils]: Spent 5.28 s on a formula simplification. DAG size of input: 175 DAG size of output: 103 [2020-11-28 03:03:33,064 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:03:33,068 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:03:33,078 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 [2020-11-28 03:03:33,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:03:33,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:03:33,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:03:33,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:03:33,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:03:33,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:03:33,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:03:33,088 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:03:33,172 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-28 03:03:33,172 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1e055ff-cea6-458b-97b2-bd15568e23ab/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:03:33,177 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-28 03:03:33,177 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-28 03:03:33,178 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:03:33,178 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:03:33,243 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-28 03:03:33,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:03:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:03:33,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:03:33,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:03:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:03:33,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 03:03:33,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:03:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:03:33,428 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 [2020-11-28 03:03:33,428 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30 Second operand 3 states. [2020-11-28 03:03:33,480 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30. Second operand 3 states. Result 145 states and 204 transitions. Complement of second has 4 states. [2020-11-28 03:03:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-28 03:03:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 03:03:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-11-28 03:03:33,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 21 letters. [2020-11-28 03:03:33,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:03:33,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 43 letters. Loop has 21 letters. [2020-11-28 03:03:33,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:03:33,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 42 letters. [2020-11-28 03:03:33,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:03:33,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 204 transitions. [2020-11-28 03:03:33,493 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:03:33,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 0 states and 0 transitions. [2020-11-28 03:03:33,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-28 03:03:33,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-28 03:03:33,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-28 03:03:33,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:03:33,494 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:03:33,494 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:03:33,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:03:33,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:03:33,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:03:33,496 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2020-11-28 03:03:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:03:33,496 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-11-28 03:03:33,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-28 03:03:33,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-11-28 03:03:33,499 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:03:33,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-11-28 03:03:33,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-28 03:03:33,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-28 03:03:33,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-28 03:03:33,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:03:33,500 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:03:33,500 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:03:33,500 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:03:33,500 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:03:33,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-28 03:03:33,500 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:03:33,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-28 03:03:33,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:03:33 BoogieIcfgContainer [2020-11-28 03:03:33,505 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:03:33,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:03:33,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:03:33,506 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:03:33,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:17" (3/4) ... [2020-11-28 03:03:33,510 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-28 03:03:33,510 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:03:33,512 INFO L168 Benchmark]: Toolchain (without parser) took 16820.57 ms. Allocated memory was 71.3 MB in the beginning and 247.5 MB in the end (delta: 176.2 MB). Free memory was 38.9 MB in the beginning and 177.5 MB in the end (delta: -138.7 MB). Peak memory consumption was 37.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:03:33,513 INFO L168 Benchmark]: CDTParser took 1.14 ms. Allocated memory is still 71.3 MB. Free memory was 51.9 MB in the beginning and 51.9 MB in the end (delta: 25.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:03:33,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.51 ms. Allocated memory was 71.3 MB in the beginning and 92.3 MB in the end (delta: 21.0 MB). Free memory was 38.7 MB in the beginning and 62.4 MB in the end (delta: -23.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:03:33,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.30 ms. Allocated memory is still 92.3 MB. Free memory was 62.4 MB in the beginning and 60.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:03:33,523 INFO L168 Benchmark]: Boogie Preprocessor took 34.74 ms. Allocated memory is still 92.3 MB. Free memory was 60.3 MB in the beginning and 58.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:03:33,523 INFO L168 Benchmark]: RCFGBuilder took 618.11 ms. Allocated memory is still 92.3 MB. Free memory was 58.6 MB in the beginning and 60.0 MB in the end (delta: -1.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:03:33,524 INFO L168 Benchmark]: BuchiAutomizer took 15748.61 ms. Allocated memory was 92.3 MB in the beginning and 247.5 MB in the end (delta: 155.2 MB). Free memory was 60.0 MB in the beginning and 178.6 MB in the end (delta: -118.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:03:33,527 INFO L168 Benchmark]: Witness Printer took 3.78 ms. Allocated memory is still 247.5 MB. Free memory was 178.6 MB in the beginning and 177.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:03:33,534 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14 ms. Allocated memory is still 71.3 MB. Free memory was 51.9 MB in the beginning and 51.9 MB in the end (delta: 25.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 360.51 ms. Allocated memory was 71.3 MB in the beginning and 92.3 MB in the end (delta: 21.0 MB). Free memory was 38.7 MB in the beginning and 62.4 MB in the end (delta: -23.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.30 ms. Allocated memory is still 92.3 MB. Free memory was 62.4 MB in the beginning and 60.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.74 ms. Allocated memory is still 92.3 MB. Free memory was 60.3 MB in the beginning and 58.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 618.11 ms. Allocated memory is still 92.3 MB. Free memory was 58.6 MB in the beginning and 60.0 MB in the end (delta: -1.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 15748.61 ms. Allocated memory was 92.3 MB in the beginning and 247.5 MB in the end (delta: 155.2 MB). Free memory was 60.0 MB in the beginning and 178.6 MB in the end (delta: -118.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.78 ms. Allocated memory is still 247.5 MB. Free memory was 178.6 MB in the beginning and 177.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 14.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 347 SDtfs, 219 SDslu, 585 SDs, 0 SdLazy, 46 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital151 mio100 ax123 hnf104 lsp69 ukn64 mio100 lsp100 div169 bol100 ite100 ukn100 eq166 hnf68 smp100 dnf7015 smp23 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 108ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...