./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.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_1899eda6-c100-4e50-925c-41569a30f56c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/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 63f7e211c70f21ed4f07b4260bf4bc5ddfe3e501 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 23:17:34,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 23:17:34,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 23:17:34,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 23:17:34,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 23:17:34,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 23:17:34,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 23:17:34,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 23:17:34,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 23:17:34,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 23:17:34,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 23:17:34,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 23:17:34,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 23:17:34,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 23:17:34,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 23:17:34,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 23:17:34,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 23:17:34,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 23:17:34,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 23:17:34,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 23:17:34,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 23:17:34,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 23:17:34,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 23:17:34,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 23:17:34,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 23:17:34,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 23:17:34,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 23:17:34,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 23:17:34,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 23:17:34,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 23:17:34,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 23:17:34,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 23:17:34,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 23:17:34,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 23:17:34,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 23:17:34,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 23:17:34,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 23:17:34,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 23:17:34,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 23:17:34,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 23:17:34,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 23:17:34,493 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 23:17:34,536 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 23:17:34,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 23:17:34,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 23:17:34,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 23:17:34,542 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 23:17:34,542 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 23:17:34,542 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 23:17:34,542 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 23:17:34,542 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 23:17:34,543 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 23:17:34,544 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 23:17:34,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 23:17:34,544 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 23:17:34,544 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 23:17:34,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 23:17:34,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 23:17:34,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 23:17:34,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 23:17:34,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 23:17:34,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 23:17:34,546 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 23:17:34,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 23:17:34,546 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 23:17:34,547 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 23:17:34,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 23:17:34,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 23:17:34,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 23:17:34,548 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 23:17:34,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 23:17:34,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 23:17:34,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 23:17:34,550 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 23:17:34,551 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 23:17:34,551 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_1899eda6-c100-4e50-925c-41569a30f56c/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_1899eda6-c100-4e50-925c-41569a30f56c/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 -> 63f7e211c70f21ed4f07b4260bf4bc5ddfe3e501 [2020-11-29 23:17:34,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 23:17:34,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 23:17:34,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 23:17:34,892 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 23:17:34,893 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 23:17:34,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2020-11-29 23:17:34,972 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/bin/uautomizer/data/d78a0899d/b7c225c4627a447498ef9f6f0087fea5/FLAGff02db5e6 [2020-11-29 23:17:35,548 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 23:17:35,549 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2020-11-29 23:17:35,573 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/bin/uautomizer/data/d78a0899d/b7c225c4627a447498ef9f6f0087fea5/FLAGff02db5e6 [2020-11-29 23:17:35,863 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/bin/uautomizer/data/d78a0899d/b7c225c4627a447498ef9f6f0087fea5 [2020-11-29 23:17:35,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 23:17:35,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 23:17:35,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 23:17:35,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 23:17:35,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 23:17:35,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:17:35" (1/1) ... [2020-11-29 23:17:35,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d73adeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:35, skipping insertion in model container [2020-11-29 23:17:35,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:17:35" (1/1) ... [2020-11-29 23:17:35,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 23:17:35,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 23:17:36,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:17:36,145 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 23:17:36,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:17:36,199 INFO L208 MainTranslator]: Completed translation [2020-11-29 23:17:36,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:36 WrapperNode [2020-11-29 23:17:36,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 23:17:36,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 23:17:36,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 23:17:36,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 23:17:36,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:36" (1/1) ... [2020-11-29 23:17:36,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:36" (1/1) ... [2020-11-29 23:17:36,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 23:17:36,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 23:17:36,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 23:17:36,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 23:17:36,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:36" (1/1) ... [2020-11-29 23:17:36,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:36" (1/1) ... [2020-11-29 23:17:36,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:36" (1/1) ... [2020-11-29 23:17:36,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:36" (1/1) ... [2020-11-29 23:17:36,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:36" (1/1) ... [2020-11-29 23:17:36,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:36" (1/1) ... [2020-11-29 23:17:36,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:36" (1/1) ... [2020-11-29 23:17:36,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 23:17:36,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 23:17:36,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 23:17:36,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 23:17:36,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/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-29 23:17:36,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 23:17:36,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 23:17:36,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 23:17:36,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 23:17:37,077 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 23:17:37,080 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-11-29 23:17:37,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:17:37 BoogieIcfgContainer [2020-11-29 23:17:37,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 23:17:37,084 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 23:17:37,084 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 23:17:37,087 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 23:17:37,088 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 23:17:37,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 11:17:35" (1/3) ... [2020-11-29 23:17:37,090 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ae5f0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 11:17:37, skipping insertion in model container [2020-11-29 23:17:37,090 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 23:17:37,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:17:36" (2/3) ... [2020-11-29 23:17:37,091 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ae5f0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 11:17:37, skipping insertion in model container [2020-11-29 23:17:37,091 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 23:17:37,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:17:37" (3/3) ... [2020-11-29 23:17:37,095 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c [2020-11-29 23:17:37,139 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 23:17:37,139 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 23:17:37,139 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 23:17:37,139 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 23:17:37,139 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 23:17:37,139 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 23:17:37,140 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 23:17:37,140 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 23:17:37,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states. [2020-11-29 23:17:37,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-11-29 23:17:37,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:17:37,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:17:37,183 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:17:37,183 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-29 23:17:37,183 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 23:17:37,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states. [2020-11-29 23:17:37,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-11-29 23:17:37,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:17:37,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:17:37,197 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:17:37,197 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-29 23:17:37,203 INFO L794 eck$LassoCheckResult]: Stem: 27#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(32);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; 8#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; 43#L129true assume !(0 == ~r1~0);init_~tmp~0 := 0; 40#L129-1true init_#res := init_~tmp~0; 30#L194true main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 41#L246true assume !(0 == main_~i2~0); 25#L246-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; 36#L254-2true [2020-11-29 23:17:37,203 INFO L796 eck$LassoCheckResult]: Loop: 36#L254-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 10#L54true assume !(0 != ~mode1~0 % 256); 64#L68true assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite7 := ~p1_new~0; 61#L68-2true ~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; 56#L54-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 4#L80true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 52#L83true assume !(node2_~m2~0 != ~nomsg~0); 51#L83-1true ~mode2~0 := 0; 18#L80-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 55#L105true assume !(0 != ~mode3~0 % 256); 42#L118true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 26#L118-2true ~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; 50#L105-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; 39#L202true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 24#L202-1true check_#res := check_~tmp~1; 54#L222true 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; 29#L278true assume !(0 == assert_~arg % 256); 49#L273true main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 36#L254-2true [2020-11-29 23:17:37,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:17:37,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2020-11-29 23:17:37,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:17:37,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668120706] [2020-11-29 23:17:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:17:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:17:37,523 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-29 23:17:37,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668120706] [2020-11-29 23:17:37,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:17:37,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 23:17:37,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373495496] [2020-11-29 23:17:37,530 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 23:17:37,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:17:37,534 INFO L82 PathProgramCache]: Analyzing trace with hash -879473510, now seen corresponding path program 1 times [2020-11-29 23:17:37,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:17:37,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007784408] [2020-11-29 23:17:37,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:17:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:17:37,711 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-29 23:17:37,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007784408] [2020-11-29 23:17:37,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:17:37,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 23:17:37,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601509645] [2020-11-29 23:17:37,713 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 23:17:37,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:17:37,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 23:17:37,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:17:37,736 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2020-11-29 23:17:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:17:37,889 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2020-11-29 23:17:37,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:17:37,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 154 transitions. [2020-11-29 23:17:37,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-29 23:17:37,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 90 states and 130 transitions. [2020-11-29 23:17:37,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-11-29 23:17:37,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2020-11-29 23:17:37,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2020-11-29 23:17:37,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 23:17:37,922 INFO L691 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2020-11-29 23:17:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2020-11-29 23:17:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2020-11-29 23:17:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-29 23:17:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2020-11-29 23:17:37,946 INFO L714 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-11-29 23:17:37,946 INFO L594 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-11-29 23:17:37,946 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 23:17:37,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2020-11-29 23:17:37,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-29 23:17:37,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:17:37,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:17:37,950 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-29 23:17:37,950 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-29 23:17:37,950 INFO L794 eck$LassoCheckResult]: Stem: 215#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(32);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; 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#L129 assume 0 == ~r1~0; 228#L130 assume ~id1~0 >= 0; 200#L131 assume 0 == ~st1~0; 201#L132 assume ~send1~0 == ~id1~0; 221#L133 assume 0 == ~mode1~0 % 256; 222#L134 assume ~id2~0 >= 0; 185#L135 assume 0 == ~st2~0; 186#L136 assume ~send2~0 == ~id2~0; 208#L137 assume 0 == ~mode2~0 % 256; 193#L138 assume ~id3~0 >= 0; 194#L139 assume 0 == ~st3~0; 216#L140 assume ~send3~0 == ~id3~0; 229#L141 assume 0 == ~mode3~0 % 256; 204#L142 assume ~id1~0 != ~id2~0; 205#L143 assume ~id1~0 != ~id3~0; 207#L144 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 223#L129-1 init_#res := init_~tmp~0; 219#L194 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 220#L246 assume !(0 == main_~i2~0); 213#L246-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; 214#L254-2 [2020-11-29 23:17:37,950 INFO L796 eck$LassoCheckResult]: Loop: 214#L254-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; 206#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 182#L80 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 183#L83 assume !(node2_~m2~0 != ~nomsg~0); 190#L83-1 ~mode2~0 := 0; 202#L80-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 203#L105 assume !(0 != ~mode3~0 % 256); 227#L118 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 211#L118-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; 212#L105-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; 225#L202 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 209#L202-1 check_#res := check_~tmp~1; 210#L222 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; 217#L278 assume !(0 == assert_~arg % 256); 218#L273 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 214#L254-2 [2020-11-29 23:17:37,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:17:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2020-11-29 23:17:37,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:17:37,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980424084] [2020-11-29 23:17:37,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:17:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:17:38,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:17:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:17:38,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:17:38,072 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:17:38,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:17:38,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1735879526, now seen corresponding path program 1 times [2020-11-29 23:17:38,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:17:38,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975134263] [2020-11-29 23:17:38,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:17:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:17:38,182 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-29 23:17:38,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975134263] [2020-11-29 23:17:38,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:17:38,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 23:17:38,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350952184] [2020-11-29 23:17:38,183 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 23:17:38,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:17:38,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 23:17:38,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:17:38,184 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. cyclomatic complexity: 21 Second operand 5 states. [2020-11-29 23:17:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:17:38,282 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2020-11-29 23:17:38,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 23:17:38,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2020-11-29 23:17:38,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-29 23:17:38,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2020-11-29 23:17:38,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-11-29 23:17:38,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-11-29 23:17:38,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2020-11-29 23:17:38,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 23:17:38,287 INFO L691 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-11-29 23:17:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2020-11-29 23:17:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-11-29 23:17:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-29 23:17:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2020-11-29 23:17:38,297 INFO L714 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-11-29 23:17:38,297 INFO L594 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-11-29 23:17:38,297 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 23:17:38,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2020-11-29 23:17:38,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-11-29 23:17:38,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:17:38,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:17:38,300 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-29 23:17:38,300 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-29 23:17:38,301 INFO L794 eck$LassoCheckResult]: Stem: 342#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(32);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; 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#L129 assume 0 == ~r1~0; 355#L130 assume ~id1~0 >= 0; 327#L131 assume 0 == ~st1~0; 328#L132 assume ~send1~0 == ~id1~0; 348#L133 assume 0 == ~mode1~0 % 256; 349#L134 assume ~id2~0 >= 0; 312#L135 assume 0 == ~st2~0; 313#L136 assume ~send2~0 == ~id2~0; 335#L137 assume 0 == ~mode2~0 % 256; 320#L138 assume ~id3~0 >= 0; 321#L139 assume 0 == ~st3~0; 343#L140 assume ~send3~0 == ~id3~0; 356#L141 assume 0 == ~mode3~0 % 256; 329#L142 assume ~id1~0 != ~id2~0; 330#L143 assume ~id1~0 != ~id3~0; 334#L144 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 350#L129-1 init_#res := init_~tmp~0; 346#L194 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 347#L246 assume !(0 == main_~i2~0); 338#L246-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; 339#L254-2 [2020-11-29 23:17:38,301 INFO L796 eck$LassoCheckResult]: Loop: 339#L254-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; 333#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 309#L80 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 310#L83 assume !(node2_~m2~0 != ~nomsg~0); 317#L83-1 ~mode2~0 := 0; 331#L80-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 332#L105 assume !(0 != ~mode3~0 % 256); 354#L118 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 340#L118-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; 341#L105-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; 352#L202 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 353#L203 assume ~r1~0 >= 3; 358#L207 assume ~r1~0 < 3;check_~tmp~1 := 1; 336#L202-1 check_#res := check_~tmp~1; 337#L222 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; 344#L278 assume !(0 == assert_~arg % 256); 345#L273 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 339#L254-2 [2020-11-29 23:17:38,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:17:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2020-11-29 23:17:38,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:17:38,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452166764] [2020-11-29 23:17:38,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:17:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:17:38,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:17:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:17:38,350 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:17:38,370 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:17:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:17:38,371 INFO L82 PathProgramCache]: Analyzing trace with hash 317028566, now seen corresponding path program 1 times [2020-11-29 23:17:38,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:17:38,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923809904] [2020-11-29 23:17:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:17:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:17:38,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-29 23:17:38,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923809904] [2020-11-29 23:17:38,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:17:38,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:17:38,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546088097] [2020-11-29 23:17:38,429 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 23:17:38,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:17:38,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:17:38,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:17:38,430 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. cyclomatic complexity: 18 Second operand 3 states. [2020-11-29 23:17:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:17:38,467 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2020-11-29 23:17:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:17:38,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2020-11-29 23:17:38,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-11-29 23:17:38,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2020-11-29 23:17:38,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-11-29 23:17:38,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-11-29 23:17:38,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2020-11-29 23:17:38,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 23:17:38,472 INFO L691 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-29 23:17:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2020-11-29 23:17:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-29 23:17:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-29 23:17:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2020-11-29 23:17:38,487 INFO L714 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-29 23:17:38,487 INFO L594 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-11-29 23:17:38,487 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 23:17:38,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2020-11-29 23:17:38,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-11-29 23:17:38,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 23:17:38,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 23:17:38,490 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-29 23:17:38,490 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-29 23:17:38,490 INFO L794 eck$LassoCheckResult]: Stem: 488#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(32);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; 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#L129 assume 0 == ~r1~0; 501#L130 assume ~id1~0 >= 0; 473#L131 assume 0 == ~st1~0; 474#L132 assume ~send1~0 == ~id1~0; 494#L133 assume 0 == ~mode1~0 % 256; 495#L134 assume ~id2~0 >= 0; 458#L135 assume 0 == ~st2~0; 459#L136 assume ~send2~0 == ~id2~0; 481#L137 assume 0 == ~mode2~0 % 256; 466#L138 assume ~id3~0 >= 0; 467#L139 assume 0 == ~st3~0; 489#L140 assume ~send3~0 == ~id3~0; 502#L141 assume 0 == ~mode3~0 % 256; 477#L142 assume ~id1~0 != ~id2~0; 478#L143 assume ~id1~0 != ~id3~0; 480#L144 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 496#L129-1 init_#res := init_~tmp~0; 492#L194 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 493#L246 assume !(0 == main_~i2~0); 484#L246-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; 485#L254-2 [2020-11-29 23:17:38,490 INFO L796 eck$LassoCheckResult]: Loop: 485#L254-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 468#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; 452#L58 assume !(node1_~m1~0 != ~nomsg~0); 453#L58-1 ~mode1~0 := 0; 479#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 455#L80 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 456#L83 assume !(node2_~m2~0 != ~nomsg~0); 463#L83-1 ~mode2~0 := 0; 475#L80-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 476#L105 assume !(0 != ~mode3~0 % 256); 516#L118 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 514#L118-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; 513#L105-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; 512#L202 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 511#L203 assume !(~r1~0 >= 3); 503#L206 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 504#L207 assume ~r1~0 < 3;check_~tmp~1 := 1; 482#L202-1 check_#res := check_~tmp~1; 483#L222 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; 490#L278 assume !(0 == assert_~arg % 256); 491#L273 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 485#L254-2 [2020-11-29 23:17:38,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:17:38,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2020-11-29 23:17:38,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:17:38,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11501503] [2020-11-29 23:17:38,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:17:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:17:38,521 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:17:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:17:38,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:17:38,574 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:17:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:17:38,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1410446433, now seen corresponding path program 1 times [2020-11-29 23:17:38,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:17:38,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248283012] [2020-11-29 23:17:38,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:17:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:17:38,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:17:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:17:38,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:17:38,619 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:17:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:17:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1606496225, now seen corresponding path program 1 times [2020-11-29 23:17:38,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:17:38,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602453223] [2020-11-29 23:17:38,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:17:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:17:38,697 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-29 23:17:38,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602453223] [2020-11-29 23:17:38,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:17:38,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:17:38,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327885079] [2020-11-29 23:17:39,156 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2020-11-29 23:17:39,574 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2020-11-29 23:17:39,586 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 23:17:39,586 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 23:17:39,587 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 23:17:39,587 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 23:17:39,587 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-29 23:17:39,587 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:17:39,587 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 23:17:39,588 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 23:17:39,588 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-29 23:17:39,588 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 23:17:39,588 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 23:17:39,613 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-29 23:17:39,628 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-29 23:17:39,644 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-29 23:17:39,648 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-29 23:17:39,659 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-29 23:17:39,674 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-29 23:17:39,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-29 23:17:39,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-29 23:17:39,714 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-29 23:17:39,727 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-29 23:17:39,736 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-29 23:17:39,876 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-11-29 23:17:39,878 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-29 23:17:39,881 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-29 23:17:39,884 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-29 23:17:40,221 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-29 23:17:41,422 WARN L193 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-11-29 23:17:41,448 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 23:17:41,448 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/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-29 23:17:41,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 23:17:41,460 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_1899eda6-c100-4e50-925c-41569a30f56c/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) [2020-11-29 23:17:41,512 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-29 23:17:41,512 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:17:41,556 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-29 23:17:41,558 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 23:17:41,558 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 23:17:41,558 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 23:17:41,558 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 23:17:41,558 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 23:17:41,559 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:17:41,559 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 23:17:41,559 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 23:17:41,559 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-29 23:17:41,559 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 23:17:41,559 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 23:17:41,563 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-29 23:17:41,575 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-29 23:17:41,586 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-29 23:17:41,590 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-29 23:17:41,598 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-29 23:17:41,603 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-29 23:17:41,606 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-29 23:17:41,621 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-29 23:17:41,628 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-29 23:17:41,643 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-29 23:17:41,734 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-29 23:17:41,746 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-29 23:17:41,757 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-29 23:17:41,760 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-29 23:17:43,023 WARN L193 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-11-29 23:17:43,044 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 23:17:43,048 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1899eda6-c100-4e50-925c-41569a30f56c/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 23:17:43,060 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-29 23:17:43,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 23:17:43,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 23:17:43,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 23:17:43,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 23:17:43,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 23:17:43,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 23:17:43,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 23:17:43,068 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 23:17:43,110 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-29 23:17:43,110 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_1899eda6-c100-4e50-925c-41569a30f56c/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-29 23:17:43,115 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 23:17:43,116 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-29 23:17:43,116 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 23:17:43,117 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-29 23:17:43,149 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-29 23:17:43,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:17:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:17:43,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 23:17:43,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:17:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:17:43,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 23:17:43,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:17:43,402 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-29 23:17:43,405 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-29 23:17:43,406 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30 Second operand 3 states. [2020-11-29 23:17:43,468 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-29 23:17:43,470 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-29 23:17:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 23:17:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-11-29 23:17:43,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 21 letters. [2020-11-29 23:17:43,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 23:17:43,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 43 letters. Loop has 21 letters. [2020-11-29 23:17:43,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 23:17:43,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 42 letters. [2020-11-29 23:17:43,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 23:17:43,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 204 transitions. [2020-11-29 23:17:43,478 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 23:17:43,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 0 states and 0 transitions. [2020-11-29 23:17:43,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 23:17:43,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 23:17:43,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 23:17:43,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 23:17:43,479 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 23:17:43,479 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 23:17:43,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:17:43,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:17:43,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:17:43,484 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-11-29 23:17:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:17:43,484 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-11-29 23:17:43,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 23:17:43,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-11-29 23:17:43,485 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 23:17:43,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 23:17:43,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 23:17:43,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 23:17:43,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 23:17:43,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 23:17:43,485 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 23:17:43,485 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 23:17:43,485 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 23:17:43,485 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 23:17:43,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-29 23:17:43,485 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 23:17:43,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-29 23:17:43,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 11:17:43 BoogieIcfgContainer [2020-11-29 23:17:43,489 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 23:17:43,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 23:17:43,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 23:17:43,490 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 23:17:43,491 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:17:37" (3/4) ... [2020-11-29 23:17:43,494 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 23:17:43,494 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 23:17:43,495 INFO L168 Benchmark]: Toolchain (without parser) took 7628.79 ms. Allocated memory was 94.4 MB in the beginning and 172.0 MB in the end (delta: 77.6 MB). Free memory was 65.8 MB in the beginning and 71.9 MB in the end (delta: -6.0 MB). Peak memory consumption was 71.6 MB. Max. memory is 16.1 GB. [2020-11-29 23:17:43,496 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 94.4 MB. Free memory was 51.2 MB in the beginning and 51.1 MB in the end (delta: 71.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:17:43,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.87 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 65.5 MB in the beginning and 87.9 MB in the end (delta: -22.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 23:17:43,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.85 ms. Allocated memory is still 113.2 MB. Free memory was 87.9 MB in the beginning and 86.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:17:43,498 INFO L168 Benchmark]: Boogie Preprocessor took 29.43 ms. Allocated memory is still 113.2 MB. Free memory was 86.0 MB in the beginning and 84.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:17:43,498 INFO L168 Benchmark]: RCFGBuilder took 779.79 ms. Allocated memory is still 113.2 MB. Free memory was 84.4 MB in the beginning and 57.2 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2020-11-29 23:17:43,499 INFO L168 Benchmark]: BuchiAutomizer took 6405.86 ms. Allocated memory was 113.2 MB in the beginning and 172.0 MB in the end (delta: 58.7 MB). Free memory was 57.2 MB in the beginning and 71.9 MB in the end (delta: -14.7 MB). Peak memory consumption was 45.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:17:43,499 INFO L168 Benchmark]: Witness Printer took 3.73 ms. Allocated memory is still 172.0 MB. Free memory is still 71.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:17:43,502 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80 ms. Allocated memory is still 94.4 MB. Free memory was 51.2 MB in the beginning and 51.1 MB in the end (delta: 71.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 333.87 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 65.5 MB in the beginning and 87.9 MB in the end (delta: -22.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 69.85 ms. Allocated memory is still 113.2 MB. Free memory was 87.9 MB in the beginning and 86.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.43 ms. Allocated memory is still 113.2 MB. Free memory was 86.0 MB in the beginning and 84.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 779.79 ms. Allocated memory is still 113.2 MB. Free memory was 84.4 MB in the beginning and 57.2 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 6405.86 ms. Allocated memory was 113.2 MB in the beginning and 172.0 MB in the end (delta: 58.7 MB). Free memory was 57.2 MB in the beginning and 71.9 MB in the end (delta: -14.7 MB). Peak memory consumption was 45.1 MB. Max. memory is 16.1 GB. * Witness Printer took 3.73 ms. Allocated memory is still 172.0 MB. Free memory is still 71.9 MB. There was no memory consumed. 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 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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: inital150 mio100 ax100 hnf98 lsp59 ukn72 mio100 lsp100 div149 bol100 ite100 ukn100 eq178 hnf72 smp100 dnf670 smp48 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 66ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...