./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.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_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/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 2e996eb39709b4d3238257929f1185fef523dcd9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 19:27:08,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:27:08,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:27:08,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:27:08,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:27:08,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:27:08,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:27:08,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:27:08,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:27:08,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:27:08,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:27:08,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:27:08,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:27:08,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:27:08,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:27:08,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:27:08,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:27:08,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:27:08,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:27:08,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:27:08,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:27:08,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:27:08,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:27:08,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:27:08,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:27:08,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:27:08,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:27:08,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:27:08,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:27:08,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:27:08,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:27:08,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:27:08,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:27:08,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:27:08,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:27:08,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:27:08,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:27:08,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:27:08,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:27:08,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:27:08,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:27:08,318 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 19:27:08,367 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:27:08,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:27:08,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:27:08,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:27:08,371 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:27:08,371 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 19:27:08,371 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 19:27:08,371 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 19:27:08,372 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 19:27:08,372 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 19:27:08,373 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 19:27:08,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:27:08,374 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:27:08,374 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 19:27:08,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:27:08,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:27:08,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:27:08,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 19:27:08,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 19:27:08,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 19:27:08,376 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:27:08,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:27:08,377 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 19:27:08,377 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:27:08,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 19:27:08,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:27:08,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:27:08,378 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 19:27:08,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:27:08,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:27:08,381 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:27:08,381 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 19:27:08,384 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 19:27:08,384 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_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/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_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/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 -> 2e996eb39709b4d3238257929f1185fef523dcd9 [2020-11-29 19:27:08,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:27:08,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:27:08,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:27:08,797 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:27:08,798 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:27:08,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2020-11-29 19:27:08,921 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/bin/uautomizer/data/a24a1c312/1f43432bf28f47e1ad32c385e5cc33e1/FLAG8b348a4ec [2020-11-29 19:27:09,630 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:27:09,631 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2020-11-29 19:27:09,642 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/bin/uautomizer/data/a24a1c312/1f43432bf28f47e1ad32c385e5cc33e1/FLAG8b348a4ec [2020-11-29 19:27:09,914 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/bin/uautomizer/data/a24a1c312/1f43432bf28f47e1ad32c385e5cc33e1 [2020-11-29 19:27:09,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:27:09,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:27:09,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:27:09,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:27:09,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:27:09,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:27:09" (1/1) ... [2020-11-29 19:27:09,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f93798a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:09, skipping insertion in model container [2020-11-29 19:27:09,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:27:09" (1/1) ... [2020-11-29 19:27:09,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:27:10,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:27:10,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:27:10,299 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:27:10,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:27:10,455 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:27:10,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:10 WrapperNode [2020-11-29 19:27:10,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:27:10,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:27:10,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:27:10,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:27:10,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:10" (1/1) ... [2020-11-29 19:27:10,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:10" (1/1) ... [2020-11-29 19:27:10,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:27:10,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:27:10,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:27:10,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:27:10,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:10" (1/1) ... [2020-11-29 19:27:10,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:10" (1/1) ... [2020-11-29 19:27:10,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:10" (1/1) ... [2020-11-29 19:27:10,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:10" (1/1) ... [2020-11-29 19:27:10,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:10" (1/1) ... [2020-11-29 19:27:10,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:10" (1/1) ... [2020-11-29 19:27:10,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:10" (1/1) ... [2020-11-29 19:27:10,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:27:10,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:27:10,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:27:10,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:27:10,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/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 19:27:10,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:27:10,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:27:10,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:27:10,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:27:11,523 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:27:11,523 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-11-29 19:27:11,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:27:11 BoogieIcfgContainer [2020-11-29 19:27:11,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:27:11,530 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 19:27:11,530 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 19:27:11,544 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 19:27:11,545 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:27:11,545 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 07:27:09" (1/3) ... [2020-11-29 19:27:11,547 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3862b8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:27:11, skipping insertion in model container [2020-11-29 19:27:11,547 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:27:11,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:27:10" (2/3) ... [2020-11-29 19:27:11,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3862b8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:27:11, skipping insertion in model container [2020-11-29 19:27:11,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:27:11,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:27:11" (3/3) ... [2020-11-29 19:27:11,556 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2020-11-29 19:27:11,611 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 19:27:11,612 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 19:27:11,612 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 19:27:11,612 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:27:11,612 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:27:11,612 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 19:27:11,613 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:27:11,613 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 19:27:11,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states. [2020-11-29 19:27:11,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2020-11-29 19:27:11,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:27:11,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:27:11,672 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:27:11,673 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 19:27:11,673 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 19:27:11,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states. [2020-11-29 19:27:11,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2020-11-29 19:27:11,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:27:11,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:27:11,682 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:27:11,683 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 19:27:11,692 INFO L794 eck$LassoCheckResult]: Stem: 36#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(49);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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 14#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive3~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 39#L161true assume !(0 == ~r1~0);init_~tmp~0 := 0; 37#L161-1true init_#res := init_~tmp~0; 8#L230true main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 15#L277true assume 0 == main_~i2~0;assume false; 69#L277-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; 7#L285-2true [2020-11-29 19:27:11,693 INFO L796 eck$LassoCheckResult]: Loop: 7#L285-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 81#L57true 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; 68#L61true assume !(node1_~m1~0 != ~nomsg~0); 65#L61-1true ~mode1~0 := 0; 76#L57-2true havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 71#L94true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 75#L97true assume !(node2_~m2~0 != ~nomsg~0); 74#L97-1true ~mode2~0 := 0; 66#L94-2true havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 38#L128true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 22#L131true assume !(node3_~m3~0 != ~nomsg~0); 20#L131-1true ~mode3~0 := 0; 13#L128-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; 46#L238true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 43#L238-1true check_#res := check_~tmp~1; 50#L250true main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 72#L309true assume !(0 == assert_~arg % 256); 45#L304true main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 7#L285-2true [2020-11-29 19:27:11,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:27:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2020-11-29 19:27:11,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:27:11,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627744299] [2020-11-29 19:27:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:27:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:27:11,890 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 19:27:11,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627744299] [2020-11-29 19:27:11,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:27:11,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:27:11,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850269192] [2020-11-29 19:27:11,898 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:27:11,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:27:11,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1437480252, now seen corresponding path program 1 times [2020-11-29 19:27:11,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:27:11,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792425112] [2020-11-29 19:27:11,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:27:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:27:12,125 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 19:27:12,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792425112] [2020-11-29 19:27:12,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:27:12,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:27:12,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494822832] [2020-11-29 19:27:12,129 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 19:27:12,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:27:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-29 19:27:12,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 19:27:12,151 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 2 states. [2020-11-29 19:27:12,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:27:12,172 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2020-11-29 19:27:12,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 19:27:12,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 125 transitions. [2020-11-29 19:27:12,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-11-29 19:27:12,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 120 transitions. [2020-11-29 19:27:12,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2020-11-29 19:27:12,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2020-11-29 19:27:12,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 120 transitions. [2020-11-29 19:27:12,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:27:12,195 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2020-11-29 19:27:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 120 transitions. [2020-11-29 19:27:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-11-29 19:27:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-29 19:27:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2020-11-29 19:27:12,246 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2020-11-29 19:27:12,246 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2020-11-29 19:27:12,246 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 19:27:12,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 120 transitions. [2020-11-29 19:27:12,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-11-29 19:27:12,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:27:12,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:27:12,250 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:27:12,250 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 19:27:12,251 INFO L794 eck$LassoCheckResult]: Stem: 218#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(49);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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 190#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive3~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 191#L161 assume !(0 == ~r1~0);init_~tmp~0 := 0; 169#L161-1 init_#res := init_~tmp~0; 180#L230 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 181#L277 assume !(0 == main_~i2~0); 194#L277-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; 176#L285-2 [2020-11-29 19:27:12,251 INFO L796 eck$LassoCheckResult]: Loop: 176#L285-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 177#L57 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; 238#L61 assume !(node1_~m1~0 != ~nomsg~0); 188#L61-1 ~mode1~0 := 0; 202#L57-2 havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 239#L94 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 240#L97 assume !(node2_~m2~0 != ~nomsg~0); 179#L97-1 ~mode2~0 := 0; 208#L94-2 havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 216#L128 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 200#L131 assume !(node3_~m3~0 != ~nomsg~0); 199#L131-1 ~mode3~0 := 0; 185#L128-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; 186#L238 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 213#L238-1 check_#res := check_~tmp~1; 222#L250 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 230#L309 assume !(0 == assert_~arg % 256); 225#L304 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 176#L285-2 [2020-11-29 19:27:12,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:27:12,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2020-11-29 19:27:12,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:27:12,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438632960] [2020-11-29 19:27:12,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:27:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:27:12,352 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 19:27:12,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438632960] [2020-11-29 19:27:12,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:27:12,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:27:12,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227279231] [2020-11-29 19:27:12,354 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:27:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:27:12,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1437480252, now seen corresponding path program 2 times [2020-11-29 19:27:12,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:27:12,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331710316] [2020-11-29 19:27:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:27:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:27:12,526 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 19:27:12,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331710316] [2020-11-29 19:27:12,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:27:12,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:27:12,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550646727] [2020-11-29 19:27:12,527 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 19:27:12,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:27:12,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:27:12,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:27:12,529 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. cyclomatic complexity: 48 Second operand 5 states. [2020-11-29 19:27:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:27:12,680 INFO L93 Difference]: Finished difference Result 126 states and 202 transitions. [2020-11-29 19:27:12,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:27:12,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 202 transitions. [2020-11-29 19:27:12,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-11-29 19:27:12,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 123 states and 183 transitions. [2020-11-29 19:27:12,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2020-11-29 19:27:12,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2020-11-29 19:27:12,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 183 transitions. [2020-11-29 19:27:12,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:27:12,695 INFO L691 BuchiCegarLoop]: Abstraction has 123 states and 183 transitions. [2020-11-29 19:27:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 183 transitions. [2020-11-29 19:27:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 73. [2020-11-29 19:27:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-29 19:27:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2020-11-29 19:27:12,707 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2020-11-29 19:27:12,707 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2020-11-29 19:27:12,707 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 19:27:12,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 103 transitions. [2020-11-29 19:27:12,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-11-29 19:27:12,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:27:12,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:27:12,711 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, 1] [2020-11-29 19:27:12,711 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 19:27:12,712 INFO L794 eck$LassoCheckResult]: Stem: 432#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(49);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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 403#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive3~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 404#L161 assume 0 == ~r1~0; 433#L162 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 449#L163 assume ~id1~0 >= 0; 416#L164 assume 0 == ~st1~0; 417#L165 assume ~send1~0 == ~id1~0; 419#L166 assume 0 == ~mode1~0 % 256; 445#L167 assume ~id2~0 >= 0; 396#L168 assume 0 == ~st2~0; 397#L169 assume ~send2~0 == ~id2~0; 428#L170 assume 0 == ~mode2~0 % 256; 408#L171 assume ~id3~0 >= 0; 409#L172 assume 0 == ~st3~0; 434#L173 assume ~send3~0 == ~id3~0; 450#L174 assume 0 == ~mode3~0 % 256; 382#L175 assume ~id1~0 != ~id2~0; 383#L176 assume ~id1~0 != ~id3~0; 420#L177 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 429#L161-1 init_#res := init_~tmp~0; 391#L230 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 392#L277 assume !(0 == main_~i2~0); 405#L277-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; 389#L285-2 [2020-11-29 19:27:12,712 INFO L796 eck$LassoCheckResult]: Loop: 389#L285-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 390#L57 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#L61 assume !(node1_~m1~0 != ~nomsg~0); 399#L61-1 ~mode1~0 := 0; 415#L57-2 havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 453#L94 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 454#L97 assume !(node2_~m2~0 != ~nomsg~0); 394#L97-1 ~mode2~0 := 0; 422#L94-2 havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 430#L128 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 413#L131 assume !(node3_~m3~0 != ~nomsg~0); 412#L131-1 ~mode3~0 := 0; 401#L128-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; 402#L238 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 426#L238-1 check_#res := check_~tmp~1; 438#L250 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 444#L309 assume !(0 == assert_~arg % 256); 439#L304 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 389#L285-2 [2020-11-29 19:27:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:27:12,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2020-11-29 19:27:12,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:27:12,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901367617] [2020-11-29 19:27:12,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:27:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:27:12,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:27:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:27:12,856 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:27:12,904 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:27:12,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:27:12,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1437480252, now seen corresponding path program 3 times [2020-11-29 19:27:12,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:27:12,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61150401] [2020-11-29 19:27:12,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:27:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:27:13,039 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 19:27:13,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61150401] [2020-11-29 19:27:13,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:27:13,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:27:13,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643684792] [2020-11-29 19:27:13,041 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 19:27:13,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:27:13,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:27:13,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:27:13,042 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. cyclomatic complexity: 31 Second operand 5 states. [2020-11-29 19:27:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:27:13,114 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2020-11-29 19:27:13,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:27:13,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 105 transitions. [2020-11-29 19:27:13,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-11-29 19:27:13,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 73 states and 101 transitions. [2020-11-29 19:27:13,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2020-11-29 19:27:13,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2020-11-29 19:27:13,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 101 transitions. [2020-11-29 19:27:13,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:27:13,121 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-11-29 19:27:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 101 transitions. [2020-11-29 19:27:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-11-29 19:27:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-29 19:27:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2020-11-29 19:27:13,127 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-11-29 19:27:13,127 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-11-29 19:27:13,127 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 19:27:13,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 101 transitions. [2020-11-29 19:27:13,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-11-29 19:27:13,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:27:13,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:27:13,132 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, 1] [2020-11-29 19:27:13,132 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] [2020-11-29 19:27:13,132 INFO L794 eck$LassoCheckResult]: Stem: 592#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(49);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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 564#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive3~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 565#L161 assume 0 == ~r1~0; 594#L162 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 610#L163 assume ~id1~0 >= 0; 577#L164 assume 0 == ~st1~0; 578#L165 assume ~send1~0 == ~id1~0; 580#L166 assume 0 == ~mode1~0 % 256; 606#L167 assume ~id2~0 >= 0; 557#L168 assume 0 == ~st2~0; 558#L169 assume ~send2~0 == ~id2~0; 589#L170 assume 0 == ~mode2~0 % 256; 569#L171 assume ~id3~0 >= 0; 570#L172 assume 0 == ~st3~0; 595#L173 assume ~send3~0 == ~id3~0; 611#L174 assume 0 == ~mode3~0 % 256; 543#L175 assume ~id1~0 != ~id2~0; 544#L176 assume ~id1~0 != ~id3~0; 581#L177 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 593#L161-1 init_#res := init_~tmp~0; 554#L230 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 555#L277 assume !(0 == main_~i2~0); 568#L277-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; 550#L285-2 [2020-11-29 19:27:13,133 INFO L796 eck$LassoCheckResult]: Loop: 550#L285-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 551#L57 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; 613#L61 assume !(node1_~m1~0 != ~nomsg~0); 562#L61-1 ~mode1~0 := 0; 576#L57-2 havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 614#L94 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 615#L97 assume !(node2_~m2~0 != ~nomsg~0); 553#L97-1 ~mode2~0 := 0; 583#L94-2 havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 590#L128 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 574#L131 assume !(node3_~m3~0 != ~nomsg~0); 571#L131-1 ~mode3~0 := 0; 559#L128-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; 560#L238 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 601#L239 assume ~r1~0 < 3;check_~tmp~1 := 1; 585#L238-1 check_#res := check_~tmp~1; 597#L250 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 605#L309 assume !(0 == assert_~arg % 256); 600#L304 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 550#L285-2 [2020-11-29 19:27:13,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:27:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2020-11-29 19:27:13,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:27:13,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020420071] [2020-11-29 19:27:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:27:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:27:13,170 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:27:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:27:13,209 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:27:13,228 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:27:13,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:27:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1995544032, now seen corresponding path program 1 times [2020-11-29 19:27:13,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:27:13,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084498222] [2020-11-29 19:27:13,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:27:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:27:13,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:27:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:27:13,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:27:13,286 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:27:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:27:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash 964547747, now seen corresponding path program 1 times [2020-11-29 19:27:13,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:27:13,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926108338] [2020-11-29 19:27:13,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:27:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:27:13,386 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 19:27:13,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926108338] [2020-11-29 19:27:13,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:27:13,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:27:13,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550889917] [2020-11-29 19:27:13,777 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2020-11-29 19:27:14,170 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2020-11-29 19:27:14,186 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:27:14,186 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:27:14,187 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:27:14,187 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:27:14,187 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-29 19:27:14,187 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:27:14,187 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:27:14,188 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:27:14,188 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-29 19:27:14,188 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:27:14,188 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:27:14,220 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 19:27:14,236 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 19:27:14,243 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 19:27:14,247 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 19:27:14,258 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 19:27:14,269 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 19:27:14,274 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 19:27:14,280 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 19:27:14,284 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 19:27:14,298 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 19:27:14,304 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 19:27:14,315 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 19:27:14,355 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 19:27:14,366 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 19:27:14,377 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 19:27:14,382 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 19:27:14,440 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 19:27:15,190 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:27:15,192 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:27:15,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 19:27:15,214 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/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 19:27:15,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-29 19:27:15,273 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 19:27:15,331 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-29 19:27:15,333 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:27:15,333 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:27:15,333 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:27:15,334 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:27:15,334 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:27:15,334 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:27:15,334 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:27:15,334 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:27:15,334 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-29 19:27:15,334 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:27:15,334 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:27:15,339 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 19:27:15,353 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 19:27:15,357 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 19:27:15,367 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 19:27:15,371 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 19:27:15,382 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 19:27:15,386 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 19:27:15,399 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 19:27:15,404 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 19:27:15,408 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 19:27:15,412 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 19:27:15,423 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 19:27:15,433 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 19:27:15,460 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 19:27:15,464 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 19:27:15,506 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 19:27:15,511 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 19:27:15,939 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-11-29 19:27:16,274 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:27:16,284 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/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-29 19:27:16,291 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 19:27:16,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:27:16,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:27:16,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:27:16,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:27:16,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:27:16,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:27:16,299 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-29 19:27:16,304 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:27:16,339 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-29 19:27:16,339 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_1e421a2d-3569-4fd3-b8f8-adef330e4b9f/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:27:16,357 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 19:27:16,357 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-29 19:27:16,358 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:27:16,359 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2020-11-29 19:27:16,408 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-29 19:27:16,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:27:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:27:16,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 19:27:16,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:27:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:27:16,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 19:27:16,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:27:16,642 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 19:27:16,646 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 19:27:16,647 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29 Second operand 3 states. [2020-11-29 19:27:16,733 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 123 states and 180 transitions. Complement of second has 4 states. [2020-11-29 19:27:16,734 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 19:27:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 19:27:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2020-11-29 19:27:16,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 19 letters. [2020-11-29 19:27:16,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:27:16,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 42 letters. Loop has 19 letters. [2020-11-29 19:27:16,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:27:16,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 38 letters. [2020-11-29 19:27:16,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:27:16,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 180 transitions. [2020-11-29 19:27:16,745 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 19:27:16,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 0 states and 0 transitions. [2020-11-29 19:27:16,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 19:27:16,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 19:27:16,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 19:27:16,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:27:16,746 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:27:16,746 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:27:16,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:27:16,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:27:16,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:27:16,748 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-11-29 19:27:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:27:16,748 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-11-29 19:27:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 19:27:16,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-11-29 19:27:16,749 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 19:27:16,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 19:27:16,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 19:27:16,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 19:27:16,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 19:27:16,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:27:16,750 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:27:16,750 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:27:16,750 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:27:16,750 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 19:27:16,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-29 19:27:16,751 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 19:27:16,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-29 19:27:16,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 07:27:16 BoogieIcfgContainer [2020-11-29 19:27:16,758 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 19:27:16,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:27:16,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:27:16,759 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:27:16,759 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:27:11" (3/4) ... [2020-11-29 19:27:16,763 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 19:27:16,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:27:16,765 INFO L168 Benchmark]: Toolchain (without parser) took 6840.78 ms. Allocated memory was 113.2 MB in the beginning and 169.9 MB in the end (delta: 56.6 MB). Free memory was 88.5 MB in the beginning and 136.8 MB in the end (delta: -48.3 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2020-11-29 19:27:16,765 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 83.9 MB. Free memory is still 48.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:27:16,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.02 ms. Allocated memory is still 113.2 MB. Free memory was 88.0 MB in the beginning and 86.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 19:27:16,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.57 ms. Allocated memory is still 113.2 MB. Free memory was 86.1 MB in the beginning and 83.9 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:27:16,768 INFO L168 Benchmark]: Boogie Preprocessor took 52.20 ms. Allocated memory is still 113.2 MB. Free memory was 83.9 MB in the beginning and 82.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 19:27:16,769 INFO L168 Benchmark]: RCFGBuilder took 918.61 ms. Allocated memory is still 113.2 MB. Free memory was 82.3 MB in the beginning and 88.2 MB in the end (delta: -5.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 16.1 GB. [2020-11-29 19:27:16,770 INFO L168 Benchmark]: BuchiAutomizer took 5227.55 ms. Allocated memory was 113.2 MB in the beginning and 169.9 MB in the end (delta: 56.6 MB). Free memory was 88.0 MB in the beginning and 136.8 MB in the end (delta: -48.8 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. [2020-11-29 19:27:16,770 INFO L168 Benchmark]: Witness Printer took 4.75 ms. Allocated memory is still 169.9 MB. Free memory is still 136.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:27:16,774 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.36 ms. Allocated memory is still 83.9 MB. Free memory is still 48.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 538.02 ms. Allocated memory is still 113.2 MB. Free memory was 88.0 MB in the beginning and 86.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 90.57 ms. Allocated memory is still 113.2 MB. Free memory was 86.1 MB in the beginning and 83.9 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.20 ms. Allocated memory is still 113.2 MB. Free memory was 83.9 MB in the beginning and 82.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 918.61 ms. Allocated memory is still 113.2 MB. Free memory was 82.3 MB in the beginning and 88.2 MB in the end (delta: -5.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 5227.55 ms. Allocated memory was 113.2 MB in the beginning and 169.9 MB in the end (delta: 56.6 MB). Free memory was 88.0 MB in the beginning and 136.8 MB in the end (delta: -48.8 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. * Witness Printer took 4.75 ms. Allocated memory is still 169.9 MB. Free memory is still 136.8 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 5.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. 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, 50 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 73 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 441 SDtfs, 260 SDslu, 699 SDs, 0 SdLazy, 35 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf99 lsp31 ukn100 mio100 lsp100 div168 bol100 ite100 ukn100 eq153 hnf75 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 72ms 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...