./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC --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 908d5a30c025a627bef25d9bbdeea2e3c6386523 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 00:32:00,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:32:00,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:32:00,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:32:00,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:32:00,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:32:00,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:32:00,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:32:00,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:32:00,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:32:00,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:32:00,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:32:00,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:32:00,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:32:00,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:32:00,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:32:00,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:32:00,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:32:00,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:32:00,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:32:00,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:32:00,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:32:00,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:32:00,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:32:00,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:32:00,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:32:00,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:32:00,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:32:00,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:32:00,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:32:00,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:32:00,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:32:00,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:32:00,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:32:00,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:32:00,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:32:00,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:32:00,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:32:00,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:32:00,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:32:00,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:32:00,721 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-11 00:32:00,769 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:32:00,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:32:00,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:32:00,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:32:00,772 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:32:00,773 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-11 00:32:00,773 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-11 00:32:00,773 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-11 00:32:00,774 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-11 00:32:00,774 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-11 00:32:00,775 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-11 00:32:00,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:32:00,776 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:32:00,776 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-11 00:32:00,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:32:00,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:32:00,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:32:00,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-11 00:32:00,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-11 00:32:00,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-11 00:32:00,778 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:32:00,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:32:00,779 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-11 00:32:00,779 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:32:00,780 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-11 00:32:00,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:32:00,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:32:00,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:32:00,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:32:00,783 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:32:00,785 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-11 00:32:00,786 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_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/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_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC 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 -> 908d5a30c025a627bef25d9bbdeea2e3c6386523 [2021-10-11 00:32:01,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:32:01,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:32:01,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:32:01,165 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:32:01,166 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:32:01,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2021-10-11 00:32:01,245 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/data/3393d925d/cbe536341f3345cf909b84f9cea4181b/FLAGe595aeb13 [2021-10-11 00:32:01,864 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:32:01,864 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2021-10-11 00:32:01,875 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/data/3393d925d/cbe536341f3345cf909b84f9cea4181b/FLAGe595aeb13 [2021-10-11 00:32:02,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/data/3393d925d/cbe536341f3345cf909b84f9cea4181b [2021-10-11 00:32:02,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:32:02,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:32:02,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:32:02,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:32:02,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:32:02,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443f3058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02, skipping insertion in model container [2021-10-11 00:32:02,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:32:02,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:32:02,564 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c[8209,8222] [2021-10-11 00:32:02,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:32:02,575 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:32:02,618 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c[8209,8222] [2021-10-11 00:32:02,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:32:02,636 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:32:02,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02 WrapperNode [2021-10-11 00:32:02,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:32:02,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:32:02,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:32:02,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:32:02,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:32:02,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:32:02,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:32:02,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:32:02,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:32:02,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:32:02,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:32:02,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:32:02,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:32:02,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:32:02,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:32:02,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:32:02,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:32:03,311 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:32:03,311 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-10-11 00:32:03,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:32:03 BoogieIcfgContainer [2021-10-11 00:32:03,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:32:03,314 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-11 00:32:03,315 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-11 00:32:03,325 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-11 00:32:03,337 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:32:03,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 11.10 12:32:02" (1/3) ... [2021-10-11 00:32:03,338 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c9d2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:32:03, skipping insertion in model container [2021-10-11 00:32:03,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:32:03,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (2/3) ... [2021-10-11 00:32:03,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c9d2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:32:03, skipping insertion in model container [2021-10-11 00:32:03,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:32:03,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:32:03" (3/3) ... [2021-10-11 00:32:03,341 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c [2021-10-11 00:32:03,400 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-11 00:32:03,401 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-11 00:32:03,401 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-11 00:32:03,401 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:32:03,401 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:32:03,401 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-11 00:32:03,401 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:32:03,402 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-11 00:32:03,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2021-10-11 00:32:03,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-10-11 00:32:03,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:32:03,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:32:03,466 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:03,466 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:03,466 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-11 00:32:03,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2021-10-11 00:32:03,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-10-11 00:32:03,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:32:03,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:32:03,484 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:03,485 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:03,495 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 11#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~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~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 36#L161true assume !(0 == ~r1~0);init_~tmp~0 := 0; 33#L161-1true init_#res := init_~tmp~0; 46#L254true main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 7#L310true assume !(0 == main_~i2~0); 69#L310-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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 49#L320-2true [2021-10-11 00:32:03,496 INFO L796 eck$LassoCheckResult]: Loop: 49#L320-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 65#L61true 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 18#L65true assume !(node1_~m1~0 != ~nomsg~0); 15#L65-1true ~mode1~0 := 0; 61#L61-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 20#L87true assume !(0 != ~mode2~0 % 256); 57#L100true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 55#L100-2true ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 14#L87-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 60#L112true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 45#L115true assume !(node3_~m3~0 != ~nomsg~0); 44#L115-1true ~mode3~0 := 0; 77#L112-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 48#L137true assume !(0 != ~mode4~0 % 256); 35#L150true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 10#L150-2true ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 43#L137-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 62#L262true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 59#L262-1true check_#res := check_~tmp~1; 25#L282true 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; 21#L347true assume !(0 == assert_~arg % 256); 66#L342true main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 49#L320-2true [2021-10-11 00:32:03,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:03,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2021-10-11 00:32:03,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:03,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971058729] [2021-10-11 00:32:03,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:03,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971058729] [2021-10-11 00:32:03,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:03,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:03,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573937501] [2021-10-11 00:32:03,840 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:32:03,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:03,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1219507551, now seen corresponding path program 1 times [2021-10-11 00:32:03,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:03,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460659314] [2021-10-11 00:32:03,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:04,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460659314] [2021-10-11 00:32:04,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:04,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:04,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349104284] [2021-10-11 00:32:04,062 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:32:04,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:04,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:32:04,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:04,081 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2021-10-11 00:32:04,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:04,185 INFO L93 Difference]: Finished difference Result 122 states and 194 transitions. [2021-10-11 00:32:04,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:32:04,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 194 transitions. [2021-10-11 00:32:04,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-10-11 00:32:04,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 113 states and 163 transitions. [2021-10-11 00:32:04,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2021-10-11 00:32:04,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2021-10-11 00:32:04,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 163 transitions. [2021-10-11 00:32:04,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:32:04,203 INFO L692 BuchiCegarLoop]: Abstraction has 113 states and 163 transitions. [2021-10-11 00:32:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 163 transitions. [2021-10-11 00:32:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2021-10-11 00:32:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-10-11 00:32:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2021-10-11 00:32:04,238 INFO L715 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2021-10-11 00:32:04,239 INFO L595 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2021-10-11 00:32:04,239 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-11 00:32:04,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 96 transitions. [2021-10-11 00:32:04,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-10-11 00:32:04,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:32:04,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:32:04,243 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:04,243 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:04,244 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 234#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~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~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 235#L161 assume 0 == ~r1~0; 266#L162 assume ~id1~0 >= 0; 282#L163 assume 0 == ~st1~0; 251#L164 assume ~send1~0 == ~id1~0; 252#L165 assume 0 == ~mode1~0 % 256; 255#L166 assume ~id2~0 >= 0; 270#L167 assume 0 == ~st2~0; 228#L168 assume ~send2~0 == ~id2~0; 229#L169 assume 0 == ~mode2~0 % 256; 260#L170 assume ~id3~0 >= 0; 240#L171 assume 0 == ~st3~0; 241#L172 assume ~send3~0 == ~id3~0; 267#L173 assume 0 == ~mode3~0 % 256; 284#L174 assume ~id4~0 >= 0; 216#L175 assume 0 == ~st4~0; 217#L176 assume ~send4~0 == ~id4~0; 256#L177 assume 0 == ~mode4~0 % 256; 271#L178 assume ~id1~0 != ~id2~0; 230#L179 assume ~id1~0 != ~id3~0; 231#L180 assume ~id1~0 != ~id4~0; 261#L181 assume ~id2~0 != ~id3~0; 242#L182 assume ~id2~0 != ~id4~0; 243#L183 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 263#L161-1 init_#res := init_~tmp~0; 264#L254 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 226#L310 assume !(0 == main_~i2~0); 227#L310-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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 279#L320-2 [2021-10-11 00:32:04,244 INFO L796 eck$LassoCheckResult]: Loop: 279#L320-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 280#L61 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 244#L65 assume !(node1_~m1~0 != ~nomsg~0); 219#L65-1 ~mode1~0 := 0; 239#L61-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 246#L87 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 247#L90 assume !(node2_~m2~0 != ~nomsg~0); 221#L90-1 ~mode2~0 := 0; 237#L87-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 238#L112 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 274#L115 assume !(node3_~m3~0 != ~nomsg~0); 273#L115-1 ~mode3~0 := 0; 258#L112-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 277#L137 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 278#L140 assume !(node4_~m4~0 != ~nomsg~0); 269#L140-1 ~mode4~0 := 0; 233#L137-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 272#L262 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 236#L262-1 check_#res := check_~tmp~1; 254#L282 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; 249#L347 assume !(0 == assert_~arg % 256); 250#L342 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 279#L320-2 [2021-10-11 00:32:04,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,245 INFO L82 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2021-10-11 00:32:04,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154473862] [2021-10-11 00:32:04,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,317 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,362 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:32:04,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,363 INFO L82 PathProgramCache]: Analyzing trace with hash -843208267, now seen corresponding path program 1 times [2021-10-11 00:32:04,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660491736] [2021-10-11 00:32:04,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:04,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660491736] [2021-10-11 00:32:04,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:04,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:04,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811691006] [2021-10-11 00:32:04,476 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:32:04,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:04,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:32:04,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:04,477 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. cyclomatic complexity: 26 Second operand 5 states. [2021-10-11 00:32:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:04,540 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2021-10-11 00:32:04,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:32:04,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2021-10-11 00:32:04,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-10-11 00:32:04,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 93 transitions. [2021-10-11 00:32:04,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-10-11 00:32:04,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-10-11 00:32:04,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 93 transitions. [2021-10-11 00:32:04,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:32:04,563 INFO L692 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-11 00:32:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 93 transitions. [2021-10-11 00:32:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-10-11 00:32:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-10-11 00:32:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2021-10-11 00:32:04,572 INFO L715 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-11 00:32:04,572 INFO L595 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-11 00:32:04,572 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-11 00:32:04,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2021-10-11 00:32:04,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-10-11 00:32:04,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:32:04,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:32:04,583 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:04,584 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:04,584 INFO L794 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 391#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~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~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 392#L161 assume 0 == ~r1~0; 423#L162 assume ~id1~0 >= 0; 439#L163 assume 0 == ~st1~0; 407#L164 assume ~send1~0 == ~id1~0; 408#L165 assume 0 == ~mode1~0 % 256; 412#L166 assume ~id2~0 >= 0; 427#L167 assume 0 == ~st2~0; 385#L168 assume ~send2~0 == ~id2~0; 386#L169 assume 0 == ~mode2~0 % 256; 417#L170 assume ~id3~0 >= 0; 396#L171 assume 0 == ~st3~0; 397#L172 assume ~send3~0 == ~id3~0; 424#L173 assume 0 == ~mode3~0 % 256; 441#L174 assume ~id4~0 >= 0; 373#L175 assume 0 == ~st4~0; 374#L176 assume ~send4~0 == ~id4~0; 413#L177 assume 0 == ~mode4~0 % 256; 428#L178 assume ~id1~0 != ~id2~0; 387#L179 assume ~id1~0 != ~id3~0; 388#L180 assume ~id1~0 != ~id4~0; 418#L181 assume ~id2~0 != ~id3~0; 398#L182 assume ~id2~0 != ~id4~0; 399#L183 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 420#L161-1 init_#res := init_~tmp~0; 421#L254 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 383#L310 assume !(0 == main_~i2~0); 384#L310-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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 436#L320-2 [2021-10-11 00:32:04,584 INFO L796 eck$LassoCheckResult]: Loop: 436#L320-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 437#L61 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 400#L65 assume !(node1_~m1~0 != ~nomsg~0); 376#L65-1 ~mode1~0 := 0; 395#L61-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 402#L87 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 403#L90 assume !(node2_~m2~0 != ~nomsg~0); 378#L90-1 ~mode2~0 := 0; 393#L87-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 394#L112 assume !(0 != ~mode3~0 % 256); 416#L125 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 414#L125-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 415#L112-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 434#L137 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 435#L140 assume !(node4_~m4~0 != ~nomsg~0); 426#L140-1 ~mode4~0 := 0; 390#L137-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 429#L262 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 380#L263 assume ~r1~0 >= 4; 381#L267 assume ~r1~0 < 4;check_~tmp~1 := 1; 410#L262-1 check_#res := check_~tmp~1; 411#L282 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; 405#L347 assume !(0 == assert_~arg % 256); 406#L342 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 436#L320-2 [2021-10-11 00:32:04,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,585 INFO L82 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2021-10-11 00:32:04,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807903982] [2021-10-11 00:32:04,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,684 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:32:04,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1788451909, now seen corresponding path program 1 times [2021-10-11 00:32:04,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973285910] [2021-10-11 00:32:04,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:04,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973285910] [2021-10-11 00:32:04,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:04,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:32:04,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236380097] [2021-10-11 00:32:04,736 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:32:04,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:04,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:32:04,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:32:04,737 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. cyclomatic complexity: 23 Second operand 3 states. [2021-10-11 00:32:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:04,768 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2021-10-11 00:32:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:32:04,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 146 transitions. [2021-10-11 00:32:04,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2021-10-11 00:32:04,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 146 transitions. [2021-10-11 00:32:04,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2021-10-11 00:32:04,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2021-10-11 00:32:04,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 146 transitions. [2021-10-11 00:32:04,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:32:04,775 INFO L692 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2021-10-11 00:32:04,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 146 transitions. [2021-10-11 00:32:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-10-11 00:32:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2021-10-11 00:32:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2021-10-11 00:32:04,783 INFO L715 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2021-10-11 00:32:04,783 INFO L595 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2021-10-11 00:32:04,783 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-11 00:32:04,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. [2021-10-11 00:32:04,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2021-10-11 00:32:04,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:32:04,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:32:04,792 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:04,793 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:04,793 INFO L794 eck$LassoCheckResult]: Stem: 605#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 574#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~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~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~id3~0 := main_#t~nondet20;havoc main_#t~nondet20;~st3~0 := main_#t~nondet21;havoc main_#t~nondet21;~send3~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 575#L161 assume 0 == ~r1~0; 609#L162 assume ~id1~0 >= 0; 626#L163 assume 0 == ~st1~0; 592#L164 assume ~send1~0 == ~id1~0; 593#L165 assume 0 == ~mode1~0 % 256; 597#L166 assume ~id2~0 >= 0; 613#L167 assume 0 == ~st2~0; 568#L168 assume ~send2~0 == ~id2~0; 569#L169 assume 0 == ~mode2~0 % 256; 603#L170 assume ~id3~0 >= 0; 581#L171 assume 0 == ~st3~0; 582#L172 assume ~send3~0 == ~id3~0; 610#L173 assume 0 == ~mode3~0 % 256; 627#L174 assume ~id4~0 >= 0; 557#L175 assume 0 == ~st4~0; 558#L176 assume ~send4~0 == ~id4~0; 598#L177 assume 0 == ~mode4~0 % 256; 614#L178 assume ~id1~0 != ~id2~0; 570#L179 assume ~id1~0 != ~id3~0; 571#L180 assume ~id1~0 != ~id4~0; 604#L181 assume ~id2~0 != ~id3~0; 583#L182 assume ~id2~0 != ~id4~0; 584#L183 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 606#L161-1 init_#res := init_~tmp~0; 607#L254 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 566#L310 assume !(0 == main_~i2~0); 567#L310-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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 622#L320-2 [2021-10-11 00:32:04,793 INFO L796 eck$LassoCheckResult]: Loop: 622#L320-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 623#L61 assume !(0 != ~mode1~0 % 256); 630#L75 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 619#L75-2 ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 580#L61-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 587#L87 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 588#L90 assume !(node2_~m2~0 != ~nomsg~0); 562#L90-1 ~mode2~0 := 0; 578#L87-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 579#L112 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 629#L115 assume !(node3_~m3~0 != ~nomsg~0); 643#L115-1 ~mode3~0 := 0; 642#L112-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 641#L137 assume !(0 != ~mode4~0 % 256); 637#L150 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 635#L150-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 634#L137-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 633#L262 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 632#L263 assume !(~r1~0 >= 4); 576#L266 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 577#L267 assume ~r1~0 < 4;check_~tmp~1 := 1; 628#L262-1 check_#res := check_~tmp~1; 596#L282 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; 590#L347 assume !(0 == assert_~arg % 256); 591#L342 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 622#L320-2 [2021-10-11 00:32:04,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,795 INFO L82 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2021-10-11 00:32:04,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409702082] [2021-10-11 00:32:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,899 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:32:04,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,916 INFO L82 PathProgramCache]: Analyzing trace with hash 691938287, now seen corresponding path program 1 times [2021-10-11 00:32:04,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452301499] [2021-10-11 00:32:04,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,969 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,988 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:32:04,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,989 INFO L82 PathProgramCache]: Analyzing trace with hash -266171831, now seen corresponding path program 1 times [2021-10-11 00:32:04,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115194584] [2021-10-11 00:32:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:05,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115194584] [2021-10-11 00:32:05,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:05,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:32:05,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130999816] [2021-10-11 00:32:05,475 WARN L197 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 121 [2021-10-11 00:32:05,890 WARN L197 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2021-10-11 00:32:05,900 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:32:05,900 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:32:05,900 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:32:05,901 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:32:05,901 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-10-11 00:32:05,901 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:05,901 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:32:05,901 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:32:05,901 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2021-10-11 00:32:05,901 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:32:05,902 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:32:05,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:05,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:05,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:05,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:05,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:05,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:05,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:05,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:05,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:06,120 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-10-11 00:32:06,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:06,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:06,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:06,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:06,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:06,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:06,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:06,457 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-10-11 00:32:06,533 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-10-11 00:32:11,229 WARN L197 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 156 DAG size of output: 108 [2021-10-11 00:32:11,302 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:32:11,303 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:11,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-11 00:32:11,311 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:11,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-10-11 00:32:11,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-11 00:32:11,374 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-10-11 00:32:11,375 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:32:11,375 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:32:11,375 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:32:11,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:32:11,376 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-11 00:32:11,376 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:11,376 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:32:11,376 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:32:11,376 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2021-10-11 00:32:11,376 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:32:11,376 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:32:11,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,571 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-10-11 00:32:11,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:32:11,846 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-10-11 00:32:11,923 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-10-11 00:32:16,921 WARN L197 SmtUtils]: Spent 4.95 s on a formula simplification. DAG size of input: 156 DAG size of output: 108 [2021-10-11 00:32:17,001 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:32:17,006 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:32:17,016 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 [2021-10-11 00:32:17,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:32:17,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:32:17,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:32:17,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:32:17,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:32:17,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:32:17,022 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 [2021-10-11 00:32:17,031 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-11 00:32:17,054 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-10-11 00:32:17,054 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_worker_vcloud-master_on_vcloud-master/run_dir_b8b48c3f-7a77-4083-a1dc-d5103df5e3ab/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:32:17,063 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-11 00:32:17,063 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-10-11 00:32:17,064 INFO L510 LassoAnalysis]: Proved termination. [2021-10-11 00:32:17,064 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:17,088 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-10-11 00:32:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:17,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 00:32:17,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:32:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:17,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 00:32:17,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:32:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:17,361 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 [2021-10-11 00:32:17,362 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40 Second operand 3 states. [2021-10-11 00:32:17,434 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40. Second operand 3 states. Result 184 states and 263 transitions. Complement of second has 4 states. [2021-10-11 00:32:17,435 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 [2021-10-11 00:32:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-11 00:32:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2021-10-11 00:32:17,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 25 letters. [2021-10-11 00:32:17,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:32:17,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 54 letters. Loop has 25 letters. [2021-10-11 00:32:17,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:32:17,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 50 letters. [2021-10-11 00:32:17,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:32:17,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 263 transitions. [2021-10-11 00:32:17,450 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:32:17,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 0 states and 0 transitions. [2021-10-11 00:32:17,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-11 00:32:17,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-11 00:32:17,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-11 00:32:17,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:32:17,451 INFO L692 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:32:17,452 INFO L715 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:32:17,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:17,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:32:17,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:32:17,454 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2021-10-11 00:32:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:17,455 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-10-11 00:32:17,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-11 00:32:17,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-10-11 00:32:17,455 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:32:17,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 00:32:17,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-11 00:32:17,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-11 00:32:17,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-11 00:32:17,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:32:17,457 INFO L692 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:32:17,459 INFO L715 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:32:17,459 INFO L595 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:32:17,459 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-11 00:32:17,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-10-11 00:32:17,460 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:32:17,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-10-11 00:32:17,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 11.10 12:32:17 BoogieIcfgContainer [2021-10-11 00:32:17,466 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-11 00:32:17,466 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:32:17,466 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:32:17,467 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:32:17,467 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:32:03" (3/4) ... [2021-10-11 00:32:17,470 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-11 00:32:17,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:32:17,473 INFO L168 Benchmark]: Toolchain (without parser) took 15290.84 ms. Allocated memory was 111.1 MB in the beginning and 283.1 MB in the end (delta: 172.0 MB). Free memory was 74.9 MB in the beginning and 142.6 MB in the end (delta: -67.7 MB). Peak memory consumption was 104.0 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:17,474 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 111.1 MB. Free memory was 84.6 MB in the beginning and 84.5 MB in the end (delta: 21.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:32:17,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 452.57 ms. Allocated memory is still 111.1 MB. Free memory was 74.7 MB in the beginning and 83.2 MB in the end (delta: -8.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:17,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.69 ms. Allocated memory is still 111.1 MB. Free memory was 82.7 MB in the beginning and 80.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:17,481 INFO L168 Benchmark]: Boogie Preprocessor took 41.74 ms. Allocated memory is still 111.1 MB. Free memory was 80.6 MB in the beginning and 79.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:17,481 INFO L168 Benchmark]: RCFGBuilder took 557.91 ms. Allocated memory is still 111.1 MB. Free memory was 79.0 MB in the beginning and 46.5 MB in the end (delta: 32.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:17,482 INFO L168 Benchmark]: BuchiAutomizer took 14151.40 ms. Allocated memory was 111.1 MB in the beginning and 283.1 MB in the end (delta: 172.0 MB). Free memory was 46.5 MB in the beginning and 142.6 MB in the end (delta: -96.2 MB). Peak memory consumption was 77.4 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:17,483 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 283.1 MB. Free memory is still 142.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:32:17,492 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.28 ms. Allocated memory is still 111.1 MB. Free memory was 84.6 MB in the beginning and 84.5 MB in the end (delta: 21.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 452.57 ms. Allocated memory is still 111.1 MB. Free memory was 74.7 MB in the beginning and 83.2 MB in the end (delta: -8.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.69 ms. Allocated memory is still 111.1 MB. Free memory was 82.7 MB in the beginning and 80.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.74 ms. Allocated memory is still 111.1 MB. Free memory was 80.6 MB in the beginning and 79.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 557.91 ms. Allocated memory is still 111.1 MB. Free memory was 79.0 MB in the beginning and 46.5 MB in the end (delta: 32.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 14151.40 ms. Allocated memory was 111.1 MB in the beginning and 283.1 MB in the end (delta: 172.0 MB). Free memory was 46.5 MB in the beginning and 142.6 MB in the end (delta: -96.2 MB). Peak memory consumption was 77.4 MB. Max. memory is 16.1 GB. * Witness Printer took 4.24 ms. Allocated memory is still 283.1 MB. Free memory is still 142.6 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 + 15 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 14.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 13.2s. Construction of modules took 0.0s. 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, 42 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 107 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 443 SDtfs, 215 SDslu, 752 SDs, 0 SdLazy, 46 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital169 mio100 ax100 hnf100 lsp87 ukn67 mio100 lsp100 div162 bol100 ite100 ukn100 eq171 hnf69 smp100 dnf5114 smp24 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 56ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...