./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.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_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/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 6e60a670bf9177c8f4a58c3a9ceae7cb61aebc56 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 03:15:15,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:15:15,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:15:15,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:15:15,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:15:15,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:15:15,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:15:15,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:15:15,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:15:15,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:15:15,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:15:15,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:15:15,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:15:15,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:15:15,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:15:15,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:15:15,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:15:15,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:15:15,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:15:15,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:15:15,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:15:15,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:15:15,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:15:15,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:15:15,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:15:15,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:15:15,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:15:15,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:15:15,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:15:15,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:15:15,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:15:15,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:15:15,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:15:15,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:15:15,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:15:15,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:15:15,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:15:15,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:15:15,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:15:15,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:15:15,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:15:15,371 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:15:15,406 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:15:15,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:15:15,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:15:15,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:15:15,410 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:15:15,410 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:15:15,411 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:15:15,411 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:15:15,412 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:15:15,412 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:15:15,412 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:15:15,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:15:15,413 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:15:15,414 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:15:15,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:15:15,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:15:15,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:15:15,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:15:15,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:15:15,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:15:15,416 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:15:15,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:15:15,417 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:15:15,417 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:15:15,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:15:15,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:15:15,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:15:15,418 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:15:15,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:15:15,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:15:15,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:15:15,419 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:15:15,421 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:15:15,423 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_5df53559-7f34-43e0-b239-fd65fc833a49/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_5df53559-7f34-43e0-b239-fd65fc833a49/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 -> 6e60a670bf9177c8f4a58c3a9ceae7cb61aebc56 [2020-11-28 03:15:15,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:15:15,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:15:15,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:15:15,821 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:15:15,822 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:15:15,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2020-11-28 03:15:15,919 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/data/c383db1bd/cde440967be24f22bdd91b56cb000a36/FLAG3c7245686 [2020-11-28 03:15:16,538 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:15:16,539 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2020-11-28 03:15:16,556 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/data/c383db1bd/cde440967be24f22bdd91b56cb000a36/FLAG3c7245686 [2020-11-28 03:15:16,855 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/data/c383db1bd/cde440967be24f22bdd91b56cb000a36 [2020-11-28 03:15:16,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:15:16,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:15:16,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:15:16,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:15:16,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:15:16,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:15:16" (1/1) ... [2020-11-28 03:15:16,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9cec0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:16, skipping insertion in model container [2020-11-28 03:15:16,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:15:16" (1/1) ... [2020-11-28 03:15:16,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:15:16,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:15:17,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:15:17,213 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:15:17,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:15:17,315 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:15:17,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:17 WrapperNode [2020-11-28 03:15:17,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:15:17,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:15:17,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:15:17,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:15:17,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:17" (1/1) ... [2020-11-28 03:15:17,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:17" (1/1) ... [2020-11-28 03:15:17,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:15:17,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:15:17,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:15:17,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:15:17,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:17" (1/1) ... [2020-11-28 03:15:17,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:17" (1/1) ... [2020-11-28 03:15:17,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:17" (1/1) ... [2020-11-28 03:15:17,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:17" (1/1) ... [2020-11-28 03:15:17,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:17" (1/1) ... [2020-11-28 03:15:17,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:17" (1/1) ... [2020-11-28 03:15:17,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:17" (1/1) ... [2020-11-28 03:15:17,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:15:17,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:15:17,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:15:17,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:15:17,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:15:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:15:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:15:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:15:17,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:15:18,323 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:15:18,324 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-11-28 03:15:18,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:15:18 BoogieIcfgContainer [2020-11-28 03:15:18,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:15:18,332 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:15:18,332 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:15:18,336 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:15:18,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:15:18,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:15:16" (1/3) ... [2020-11-28 03:15:18,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57aeb69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:15:18, skipping insertion in model container [2020-11-28 03:15:18,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:15:18,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:17" (2/3) ... [2020-11-28 03:15:18,341 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57aeb69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:15:18, skipping insertion in model container [2020-11-28 03:15:18,342 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:15:18,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:15:18" (3/3) ... [2020-11-28 03:15:18,344 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2020-11-28 03:15:18,421 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:15:18,421 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:15:18,421 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:15:18,421 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:15:18,422 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:15:18,422 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:15:18,422 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:15:18,422 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:15:18,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2020-11-28 03:15:18,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2020-11-28 03:15:18,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:15:18,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:15:18,481 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:15:18,482 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:15:18,482 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:15:18,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2020-11-28 03:15:18,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2020-11-28 03:15:18,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:15:18,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:15:18,491 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:15:18,491 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:15:18,500 INFO L794 eck$LassoCheckResult]: Stem: 34#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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 8#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 4#L157true assume !(0 == ~r1~0);init_~tmp~0 := 0; 3#L157-1true init_#res := init_~tmp~0; 19#L226true main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 63#L273true assume 0 == main_~i2~0;assume false; 61#L273-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; 17#L281-2true [2020-11-28 03:15:18,501 INFO L796 eck$LassoCheckResult]: Loop: 17#L281-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 77#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; 66#L61true assume !(node1_~m1~0 != ~nomsg~0); 64#L61-1true ~mode1~0 := 0; 74#L57-2true havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 60#L89true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 28#L92true assume !(node2_~m2~0 != ~nomsg~0); 27#L92-1true ~mode2~0 := 0; 55#L89-2true havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 62#L123true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 48#L126true assume !(node3_~m3~0 != ~nomsg~0); 47#L126-1true ~mode3~0 := 0; 78#L123-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; 33#L234true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 7#L234-1true check_#res := check_~tmp~1; 53#L246true main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 57#L305true assume !(0 == assert_~arg % 256); 39#L300true main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 17#L281-2true [2020-11-28 03:15:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:15:18,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2020-11-28 03:15:18,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:15:18,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428690226] [2020-11-28 03:15:18,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:15:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:15:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:15:18,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428690226] [2020-11-28 03:15:18,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:15:18,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:15:18,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091871419] [2020-11-28 03:15:18,710 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:15:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:15:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1181507516, now seen corresponding path program 1 times [2020-11-28 03:15:18,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:15:18,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117969150] [2020-11-28 03:15:18,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:15:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:15:19,030 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2020-11-28 03:15:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:15:19,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117969150] [2020-11-28 03:15:19,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:15:19,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:15:19,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413503431] [2020-11-28 03:15:19,037 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:15:19,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:15:19,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-28 03:15:19,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-28 03:15:19,062 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2020-11-28 03:15:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:15:19,091 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2020-11-28 03:15:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-28 03:15:19,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 120 transitions. [2020-11-28 03:15:19,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-11-28 03:15:19,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 115 transitions. [2020-11-28 03:15:19,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2020-11-28 03:15:19,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2020-11-28 03:15:19,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 115 transitions. [2020-11-28 03:15:19,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:15:19,118 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 115 transitions. [2020-11-28 03:15:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 115 transitions. [2020-11-28 03:15:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-28 03:15:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-28 03:15:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 115 transitions. [2020-11-28 03:15:19,177 INFO L714 BuchiCegarLoop]: Abstraction has 70 states and 115 transitions. [2020-11-28 03:15:19,177 INFO L594 BuchiCegarLoop]: Abstraction has 70 states and 115 transitions. [2020-11-28 03:15:19,177 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:15:19,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 115 transitions. [2020-11-28 03:15:19,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-11-28 03:15:19,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:15:19,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:15:19,189 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:15:19,189 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:15:19,192 INFO L794 eck$LassoCheckResult]: Stem: 208#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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 176#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 164#L157 assume !(0 == ~r1~0);init_~tmp~0 := 0; 162#L157-1 init_#res := init_~tmp~0; 163#L226 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 188#L273 assume !(0 == main_~i2~0); 227#L273-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; 186#L281-2 [2020-11-28 03:15:19,193 INFO L796 eck$LassoCheckResult]: Loop: 186#L281-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 187#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; 228#L61 assume !(node1_~m1~0 != ~nomsg~0); 169#L61-1 ~mode1~0 := 0; 220#L57-2 havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 226#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 199#L92 assume !(node2_~m2~0 != ~nomsg~0); 198#L92-1 ~mode2~0 := 0; 182#L89-2 havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 224#L123 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 219#L126 assume !(node3_~m3~0 != ~nomsg~0); 174#L126-1 ~mode3~0 := 0; 214#L123-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; 204#L234 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 171#L234-1 check_#res := check_~tmp~1; 172#L246 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 221#L305 assume !(0 == assert_~arg % 256); 212#L300 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 186#L281-2 [2020-11-28 03:15:19,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:15:19,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2020-11-28 03:15:19,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:15:19,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898124790] [2020-11-28 03:15:19,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:15:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:15:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:15:19,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898124790] [2020-11-28 03:15:19,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:15:19,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:15:19,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100401103] [2020-11-28 03:15:19,329 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:15:19,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:15:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1181507516, now seen corresponding path program 2 times [2020-11-28 03:15:19,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:15:19,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788449012] [2020-11-28 03:15:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:15:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:15:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:15:19,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788449012] [2020-11-28 03:15:19,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:15:19,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:15:19,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406147231] [2020-11-28 03:15:19,458 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:15:19,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:15:19,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:15:19,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:15:19,460 INFO L87 Difference]: Start difference. First operand 70 states and 115 transitions. cyclomatic complexity: 46 Second operand 5 states. [2020-11-28 03:15:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:15:19,600 INFO L93 Difference]: Finished difference Result 120 states and 192 transitions. [2020-11-28 03:15:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:15:19,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 192 transitions. [2020-11-28 03:15:19,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-11-28 03:15:19,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 117 states and 173 transitions. [2020-11-28 03:15:19,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2020-11-28 03:15:19,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2020-11-28 03:15:19,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 173 transitions. [2020-11-28 03:15:19,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:15:19,613 INFO L691 BuchiCegarLoop]: Abstraction has 117 states and 173 transitions. [2020-11-28 03:15:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 173 transitions. [2020-11-28 03:15:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 70. [2020-11-28 03:15:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-28 03:15:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2020-11-28 03:15:19,631 INFO L714 BuchiCegarLoop]: Abstraction has 70 states and 98 transitions. [2020-11-28 03:15:19,631 INFO L594 BuchiCegarLoop]: Abstraction has 70 states and 98 transitions. [2020-11-28 03:15:19,632 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:15:19,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 98 transitions. [2020-11-28 03:15:19,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-11-28 03:15:19,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:15:19,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:15:19,639 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-28 03:15:19,639 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:15:19,639 INFO L794 eck$LassoCheckResult]: Stem: 413#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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 381#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 369#L157 assume 0 == ~r1~0; 370#L158 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 406#L159 assume ~id1~0 >= 0; 384#L160 assume 0 == ~st1~0; 385#L161 assume ~send1~0 == ~id1~0; 414#L162 assume 0 == ~mode1~0 % 256; 430#L163 assume ~id2~0 >= 0; 397#L164 assume 0 == ~st2~0; 398#L165 assume ~send2~0 == ~id2~0; 402#L166 assume 0 == ~mode2~0 % 256; 422#L167 assume ~id3~0 >= 0; 371#L168 assume 0 == ~st3~0; 372#L169 assume ~send3~0 == ~id3~0; 407#L170 assume 0 == ~mode3~0 % 256; 386#L171 assume ~id1~0 != ~id2~0; 387#L172 assume ~id1~0 != ~id3~0; 415#L173 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 367#L157-1 init_#res := init_~tmp~0; 368#L226 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 393#L273 assume !(0 == main_~i2~0); 432#L273-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; 391#L281-2 [2020-11-28 03:15:19,639 INFO L796 eck$LassoCheckResult]: Loop: 391#L281-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 392#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; 433#L61 assume !(node1_~m1~0 != ~nomsg~0); 374#L61-1 ~mode1~0 := 0; 425#L57-2 havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 431#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 404#L92 assume !(node2_~m2~0 != ~nomsg~0); 403#L92-1 ~mode2~0 := 0; 389#L89-2 havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 429#L123 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 424#L126 assume !(node3_~m3~0 != ~nomsg~0); 379#L126-1 ~mode3~0 := 0; 419#L123-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; 411#L234 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 376#L234-1 check_#res := check_~tmp~1; 377#L246 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 426#L305 assume !(0 == assert_~arg % 256); 417#L300 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 391#L281-2 [2020-11-28 03:15:19,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:15:19,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2020-11-28 03:15:19,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:15:19,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420015643] [2020-11-28 03:15:19,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:15:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:15:19,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:15:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:15:19,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:15:19,802 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:15:19,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:15:19,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1181507516, now seen corresponding path program 3 times [2020-11-28 03:15:19,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:15:19,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515402836] [2020-11-28 03:15:19,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:15:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:15:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:15:19,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515402836] [2020-11-28 03:15:19,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:15:19,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:15:19,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585330326] [2020-11-28 03:15:19,951 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:15:19,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:15:19,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:15:19,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:15:19,953 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. cyclomatic complexity: 29 Second operand 5 states. [2020-11-28 03:15:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:15:20,042 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2020-11-28 03:15:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:15:20,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 100 transitions. [2020-11-28 03:15:20,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-11-28 03:15:20,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 70 states and 96 transitions. [2020-11-28 03:15:20,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2020-11-28 03:15:20,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2020-11-28 03:15:20,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 96 transitions. [2020-11-28 03:15:20,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:15:20,047 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 96 transitions. [2020-11-28 03:15:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 96 transitions. [2020-11-28 03:15:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-28 03:15:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-28 03:15:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2020-11-28 03:15:20,062 INFO L714 BuchiCegarLoop]: Abstraction has 70 states and 96 transitions. [2020-11-28 03:15:20,062 INFO L594 BuchiCegarLoop]: Abstraction has 70 states and 96 transitions. [2020-11-28 03:15:20,062 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:15:20,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 96 transitions. [2020-11-28 03:15:20,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-11-28 03:15:20,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:15:20,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:15:20,065 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-28 03:15:20,065 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-28 03:15:20,066 INFO L794 eck$LassoCheckResult]: Stem: 568#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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 533#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 524#L157 assume 0 == ~r1~0; 525#L158 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 561#L159 assume ~id1~0 >= 0; 539#L160 assume 0 == ~st1~0; 540#L161 assume ~send1~0 == ~id1~0; 569#L162 assume 0 == ~mode1~0 % 256; 585#L163 assume ~id2~0 >= 0; 552#L164 assume 0 == ~st2~0; 553#L165 assume ~send2~0 == ~id2~0; 557#L166 assume 0 == ~mode2~0 % 256; 577#L167 assume ~id3~0 >= 0; 526#L168 assume 0 == ~st3~0; 527#L169 assume ~send3~0 == ~id3~0; 562#L170 assume 0 == ~mode3~0 % 256; 541#L171 assume ~id1~0 != ~id2~0; 542#L172 assume ~id1~0 != ~id3~0; 571#L173 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 522#L157-1 init_#res := init_~tmp~0; 523#L226 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 548#L273 assume !(0 == main_~i2~0); 587#L273-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; 546#L281-2 [2020-11-28 03:15:20,066 INFO L796 eck$LassoCheckResult]: Loop: 546#L281-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 547#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; 588#L61 assume !(node1_~m1~0 != ~nomsg~0); 529#L61-1 ~mode1~0 := 0; 580#L57-2 havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 586#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 559#L92 assume !(node2_~m2~0 != ~nomsg~0); 558#L92-1 ~mode2~0 := 0; 544#L89-2 havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 584#L123 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 579#L126 assume !(node3_~m3~0 != ~nomsg~0); 535#L126-1 ~mode3~0 := 0; 574#L123-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; 566#L234 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 567#L235 assume ~r1~0 < 3;check_~tmp~1 := 1; 531#L234-1 check_#res := check_~tmp~1; 532#L246 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 581#L305 assume !(0 == assert_~arg % 256); 570#L300 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 546#L281-2 [2020-11-28 03:15:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:15:20,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2020-11-28 03:15:20,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:15:20,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128444914] [2020-11-28 03:15:20,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:15:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:15:20,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:15:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:15:20,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:15:20,225 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:15:20,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:15:20,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1644643476, now seen corresponding path program 1 times [2020-11-28 03:15:20,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:15:20,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610868546] [2020-11-28 03:15:20,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:15:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:15:20,246 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:15:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:15:20,265 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:15:20,278 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:15:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:15:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash 309767959, now seen corresponding path program 1 times [2020-11-28 03:15:20,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:15:20,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79060292] [2020-11-28 03:15:20,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:15:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:15:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:15:20,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79060292] [2020-11-28 03:15:20,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:15:20,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:15:20,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688509580] [2020-11-28 03:15:20,916 WARN L193 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2020-11-28 03:15:21,315 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2020-11-28 03:15:21,329 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:15:21,331 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:15:21,331 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:15:21,331 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:15:21,331 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-28 03:15:21,332 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:15:21,332 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:15:21,332 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:15:21,332 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-28 03:15:21,332 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:15:21,333 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:15:21,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,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-28 03:15:21,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:21,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,052 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-11-28 03:15:22,329 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2020-11-28 03:15:22,451 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-11-28 03:15:22,503 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:15:22,505 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:15:22,512 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-28 03:15:22,513 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/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-28 03:15:22,570 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-28 03:15:22,571 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-28 03:15:22,615 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-28 03:15:22,618 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:15:22,618 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:15:22,618 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:15:22,618 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:15:22,619 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:15:22,619 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:15:22,619 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:15:22,619 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:15:22,619 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-11-28 03:15:22,619 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:15:22,619 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:15:22,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:22,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:15:23,611 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:15:23,621 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:15:23,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:15:23,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:15:23,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:15:23,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:15:23,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:15:23,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:15:23,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:15:23,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:15:23,649 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:15:23,701 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-28 03:15:23,701 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_5df53559-7f34-43e0-b239-fd65fc833a49/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:15:23,721 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-28 03:15:23,722 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-28 03:15:23,722 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:15:23,723 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:15:23,758 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-28 03:15:23,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:15:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:15:23,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:15:23,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:15:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:15:23,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 03:15:23,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:15:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:15:23,977 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-28 03:15:23,978 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 96 transitions. cyclomatic complexity: 27 Second operand 3 states. [2020-11-28 03:15:24,026 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 96 transitions. cyclomatic complexity: 27. Second operand 3 states. Result 117 states and 170 transitions. Complement of second has 4 states. [2020-11-28 03:15:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-28 03:15:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 03:15:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2020-11-28 03:15:24,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 96 transitions. Stem has 23 letters. Loop has 19 letters. [2020-11-28 03:15:24,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:15:24,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 96 transitions. Stem has 42 letters. Loop has 19 letters. [2020-11-28 03:15:24,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:15:24,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 96 transitions. Stem has 23 letters. Loop has 38 letters. [2020-11-28 03:15:24,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:15:24,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 170 transitions. [2020-11-28 03:15:24,035 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:15:24,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 0 states and 0 transitions. [2020-11-28 03:15:24,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-28 03:15:24,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-28 03:15:24,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-28 03:15:24,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:15:24,036 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:15:24,036 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:15:24,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:15:24,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:15:24,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:15:24,037 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-11-28 03:15:24,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:15:24,037 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-11-28 03:15:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-28 03:15:24,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-11-28 03:15:24,038 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:15:24,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-11-28 03:15:24,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-28 03:15:24,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-28 03:15:24,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-28 03:15:24,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:15:24,039 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:15:24,039 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:15:24,039 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:15:24,039 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:15:24,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-28 03:15:24,039 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:15:24,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-28 03:15:24,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:15:24 BoogieIcfgContainer [2020-11-28 03:15:24,045 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:15:24,046 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:15:24,046 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:15:24,046 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:15:24,047 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:15:18" (3/4) ... [2020-11-28 03:15:24,050 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-28 03:15:24,050 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:15:24,051 INFO L168 Benchmark]: Toolchain (without parser) took 7190.54 ms. Allocated memory was 119.5 MB in the beginning and 192.9 MB in the end (delta: 73.4 MB). Free memory was 86.3 MB in the beginning and 144.1 MB in the end (delta: -57.8 MB). Peak memory consumption was 16.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:15:24,052 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 75.5 MB. Free memory was 33.5 MB in the beginning and 33.5 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:15:24,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.60 ms. Allocated memory is still 119.5 MB. Free memory was 86.0 MB in the beginning and 92.6 MB in the end (delta: -6.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:15:24,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.66 ms. Allocated memory is still 119.5 MB. Free memory was 92.6 MB in the beginning and 90.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:15:24,054 INFO L168 Benchmark]: Boogie Preprocessor took 38.55 ms. Allocated memory is still 119.5 MB. Free memory was 90.5 MB in the beginning and 88.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:15:24,055 INFO L168 Benchmark]: RCFGBuilder took 915.74 ms. Allocated memory is still 119.5 MB. Free memory was 88.6 MB in the beginning and 57.1 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:15:24,056 INFO L168 Benchmark]: BuchiAutomizer took 5713.42 ms. Allocated memory was 119.5 MB in the beginning and 192.9 MB in the end (delta: 73.4 MB). Free memory was 57.0 MB in the beginning and 145.1 MB in the end (delta: -88.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:15:24,056 INFO L168 Benchmark]: Witness Printer took 3.97 ms. Allocated memory is still 192.9 MB. Free memory is still 145.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:15:24,060 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.31 ms. Allocated memory is still 75.5 MB. Free memory was 33.5 MB in the beginning and 33.5 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 448.60 ms. Allocated memory is still 119.5 MB. Free memory was 86.0 MB in the beginning and 92.6 MB in the end (delta: -6.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.66 ms. Allocated memory is still 119.5 MB. Free memory was 92.6 MB in the beginning and 90.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.55 ms. Allocated memory is still 119.5 MB. Free memory was 90.5 MB in the beginning and 88.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 915.74 ms. Allocated memory is still 119.5 MB. Free memory was 88.6 MB in the beginning and 57.1 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 5713.42 ms. Allocated memory was 119.5 MB in the beginning and 192.9 MB in the end (delta: 73.4 MB). Free memory was 57.0 MB in the beginning and 145.1 MB in the end (delta: -88.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 3.97 ms. Allocated memory is still 192.9 MB. Free memory is still 145.1 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.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. 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, 47 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 70 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 421 SDtfs, 173 SDslu, 664 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 ax129 hnf106 lsp22 ukn100 mio100 lsp100 div168 bol100 ite100 ukn100 eq153 hnf75 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 100ms 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...