./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD --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 5d3b64744a19af136ca9c439b2264a15465f658e2e3d4a576a98d96e4b8aff92 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 00:02:45,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 00:02:45,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 00:02:45,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 00:02:45,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 00:02:45,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 00:02:45,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 00:02:45,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 00:02:45,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 00:02:45,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 00:02:45,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 00:02:45,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 00:02:45,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 00:02:45,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 00:02:45,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 00:02:45,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 00:02:45,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 00:02:45,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 00:02:45,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 00:02:45,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 00:02:45,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 00:02:45,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 00:02:45,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 00:02:45,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 00:02:45,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 00:02:45,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 00:02:45,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 00:02:45,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 00:02:45,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 00:02:45,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 00:02:45,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 00:02:45,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 00:02:45,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 00:02:45,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 00:02:45,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 00:02:45,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 00:02:45,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 00:02:45,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 00:02:45,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 00:02:45,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 00:02:45,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 00:02:45,361 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-29 00:02:45,396 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 00:02:45,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 00:02:45,405 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-29 00:02:45,405 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-29 00:02:45,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 00:02:45,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 00:02:45,407 INFO L138 SettingsManager]: * Use SBE=true [2021-10-29 00:02:45,407 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-29 00:02:45,408 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-29 00:02:45,416 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-29 00:02:45,417 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-29 00:02:45,417 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-29 00:02:45,418 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-29 00:02:45,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 00:02:45,418 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 00:02:45,418 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-29 00:02:45,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 00:02:45,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 00:02:45,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 00:02:45,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-29 00:02:45,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-29 00:02:45,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-29 00:02:45,420 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 00:02:45,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 00:02:45,421 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-29 00:02:45,421 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 00:02:45,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-29 00:02:45,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 00:02:45,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-29 00:02:45,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 00:02:45,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-29 00:02:45,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 00:02:45,424 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-29 00:02:45,425 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_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/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_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD 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 -> 5d3b64744a19af136ca9c439b2264a15465f658e2e3d4a576a98d96e4b8aff92 [2021-10-29 00:02:45,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 00:02:45,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 00:02:45,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 00:02:45,778 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 00:02:45,779 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 00:02:45,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2021-10-29 00:02:45,842 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/data/626bbeae2/eafee83c911b465a82df2dd2f49526da/FLAG8522cd6ec [2021-10-29 00:02:46,330 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 00:02:46,331 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2021-10-29 00:02:46,350 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/data/626bbeae2/eafee83c911b465a82df2dd2f49526da/FLAG8522cd6ec [2021-10-29 00:02:46,646 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/data/626bbeae2/eafee83c911b465a82df2dd2f49526da [2021-10-29 00:02:46,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 00:02:46,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 00:02:46,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 00:02:46,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 00:02:46,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 00:02:46,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 12:02:46" (1/1) ... [2021-10-29 00:02:46,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a86848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:46, skipping insertion in model container [2021-10-29 00:02:46,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 12:02:46" (1/1) ... [2021-10-29 00:02:46,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 00:02:46,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 00:02:46,971 WARN L228 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_1b28692a-fc1f-4784-b6b7-e846c89a6d55/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c[8246,8259] [2021-10-29 00:02:46,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 00:02:46,981 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 00:02:47,023 WARN L228 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_1b28692a-fc1f-4784-b6b7-e846c89a6d55/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c[8246,8259] [2021-10-29 00:02:47,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 00:02:47,039 INFO L208 MainTranslator]: Completed translation [2021-10-29 00:02:47,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:47 WrapperNode [2021-10-29 00:02:47,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 00:02:47,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 00:02:47,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 00:02:47,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 00:02:47,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:47" (1/1) ... [2021-10-29 00:02:47,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:47" (1/1) ... [2021-10-29 00:02:47,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 00:02:47,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 00:02:47,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 00:02:47,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 00:02:47,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:47" (1/1) ... [2021-10-29 00:02:47,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:47" (1/1) ... [2021-10-29 00:02:47,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:47" (1/1) ... [2021-10-29 00:02:47,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:47" (1/1) ... [2021-10-29 00:02:47,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:47" (1/1) ... [2021-10-29 00:02:47,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:47" (1/1) ... [2021-10-29 00:02:47,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:47" (1/1) ... [2021-10-29 00:02:47,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 00:02:47,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 00:02:47,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 00:02:47,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 00:02:47,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:47" (1/1) ... [2021-10-29 00:02:47,197 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-29 00:02:47,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:02:47,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-29 00:02:47,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-29 00:02:47,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 00:02:47,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 00:02:47,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 00:02:47,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 00:02:47,766 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 00:02:47,766 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-10-29 00:02:47,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 12:02:47 BoogieIcfgContainer [2021-10-29 00:02:47,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 00:02:47,770 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-29 00:02:47,770 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-29 00:02:47,772 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-29 00:02:47,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-29 00:02:47,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.10 12:02:46" (1/3) ... [2021-10-29 00:02:47,774 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16e84fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.10 12:02:47, skipping insertion in model container [2021-10-29 00:02:47,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-29 00:02:47,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:02:47" (2/3) ... [2021-10-29 00:02:47,775 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16e84fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.10 12:02:47, skipping insertion in model container [2021-10-29 00:02:47,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-29 00:02:47,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 12:02:47" (3/3) ... [2021-10-29 00:02:47,777 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2021-10-29 00:02:47,823 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-29 00:02:47,823 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-29 00:02:47,823 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-29 00:02:47,823 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-29 00:02:47,824 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-29 00:02:47,824 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-29 00:02:47,824 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-29 00:02:47,824 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-29 00:02:47,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:02:47,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-10-29 00:02:47,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-29 00:02:47,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-29 00:02:47,874 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:02:47,874 INFO L843 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-29 00:02:47,874 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-29 00:02:47,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:02:47,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-10-29 00:02:47,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-29 00:02:47,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-29 00:02:47,883 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:02:47,884 INFO L843 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-29 00:02:47,891 INFO L791 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 48#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; 61#L163true assume !(0 == ~r1~0);init_~tmp~0 := 0; 25#L163-1true init_#res := init_~tmp~0; 59#L256true main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 71#L312true assume !(0 == main_~i2~0); 17#L312-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; 11#L322-2true [2021-10-29 00:02:47,892 INFO L793 eck$LassoCheckResult]: Loop: 11#L322-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 8#L61true assume !(0 != ~mode1~0 % 256); 15#L77true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 52#L77-2true ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 58#L61-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 9#L89true assume !(0 != ~mode2~0 % 256); 57#L102true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 55#L102-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; 21#L89-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 62#L114true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 13#L117true assume !(node3_~m3~0 != ~nomsg~0); 34#L117-1true ~mode3~0 := 0; 49#L114-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 37#L139true assume !(0 != ~mode4~0 % 256); 40#L152true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 23#L152-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; 22#L139-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; 73#L264true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 20#L264-1true check_#res := check_~tmp~1; 74#L284true 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; 26#L349true assume !(0 == assert_~arg % 256); 39#L344true main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 11#L322-2true [2021-10-29 00:02:47,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:02:47,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2021-10-29 00:02:47,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:02:47,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620537658] [2021-10-29 00:02:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:02:47,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:02:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:02:48,166 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-29 00:02:48,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:02:48,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620537658] [2021-10-29 00:02:48,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620537658] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:02:48,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:02:48,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 00:02:48,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552301106] [2021-10-29 00:02:48,175 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-29 00:02:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:02:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1135428887, now seen corresponding path program 1 times [2021-10-29 00:02:48,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:02:48,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463545108] [2021-10-29 00:02:48,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:02:48,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:02:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:02:48,345 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-29 00:02:48,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:02:48,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463545108] [2021-10-29 00:02:48,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463545108] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:02:48,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:02:48,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 00:02:48,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201603323] [2021-10-29 00:02:48,348 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-29 00:02:48,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:02:48,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 00:02:48,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 00:02:48,367 INFO L87 Difference]: Start difference. First operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:02:48,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:02:48,463 INFO L93 Difference]: Finished difference Result 122 states and 194 transitions. [2021-10-29 00:02:48,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 00:02:48,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 194 transitions. [2021-10-29 00:02:48,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-10-29 00:02:48,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 113 states and 163 transitions. [2021-10-29 00:02:48,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2021-10-29 00:02:48,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2021-10-29 00:02:48,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 163 transitions. [2021-10-29 00:02:48,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:02:48,493 INFO L681 BuchiCegarLoop]: Abstraction has 113 states and 163 transitions. [2021-10-29 00:02:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 163 transitions. [2021-10-29 00:02:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2021-10-29 00:02:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.352112676056338) internal successors, (96), 70 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:02:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2021-10-29 00:02:48,526 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2021-10-29 00:02:48,526 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2021-10-29 00:02:48,526 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-29 00:02:48,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 96 transitions. [2021-10-29 00:02:48,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-10-29 00:02:48,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-29 00:02:48,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-29 00:02:48,535 INFO L842 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-29 00:02:48,535 INFO L843 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-29 00:02:48,536 INFO L791 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 272#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; 273#L163 assume 0 == ~r1~0; 251#L164 assume ~id1~0 >= 0; 238#L165 assume 0 == ~st1~0; 239#L166 assume ~send1~0 == ~id1~0; 256#L167 assume 0 == ~mode1~0 % 256; 230#L168 assume ~id2~0 >= 0; 231#L169 assume 0 == ~st2~0; 285#L170 assume ~send2~0 == ~id2~0; 276#L171 assume 0 == ~mode2~0 % 256; 274#L172 assume ~id3~0 >= 0; 275#L173 assume 0 == ~st3~0; 284#L174 assume ~send3~0 == ~id3~0; 221#L175 assume 0 == ~mode3~0 % 256; 222#L176 assume ~id4~0 >= 0; 278#L177 assume 0 == ~st4~0; 262#L178 assume ~send4~0 == ~id4~0; 263#L179 assume 0 == ~mode4~0 % 256; 216#L180 assume ~id1~0 != ~id2~0; 217#L181 assume ~id1~0 != ~id3~0; 259#L182 assume ~id1~0 != ~id4~0; 260#L183 assume ~id2~0 != ~id3~0; 243#L184 assume ~id2~0 != ~id4~0; 244#L185 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 252#L163-1 init_#res := init_~tmp~0; 253#L256 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 280#L312 assume !(0 == main_~i2~0); 240#L312-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; 229#L322-2 [2021-10-29 00:02:48,536 INFO L793 eck$LassoCheckResult]: Loop: 229#L322-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 223#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; 224#L65 assume !(node1_~m1~0 != ~nomsg~0); 242#L65-1 ~mode1~0 := 0; 277#L61-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 226#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 227#L92 assume !(node2_~m2~0 != ~nomsg~0); 269#L92-1 ~mode2~0 := 0; 247#L89-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 248#L114 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 232#L117 assume !(node3_~m3~0 != ~nomsg~0); 233#L117-1 ~mode3~0 := 0; 261#L114-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 264#L139 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 265#L142 assume !(node4_~m4~0 != ~nomsg~0); 235#L142-1 ~mode4~0 := 0; 236#L139-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; 249#L264 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 245#L264-1 check_#res := check_~tmp~1; 246#L284 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; 254#L349 assume !(0 == assert_~arg % 256); 255#L344 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 229#L322-2 [2021-10-29 00:02:48,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:02:48,537 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2021-10-29 00:02:48,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:02:48,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204642602] [2021-10-29 00:02:48,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:02:48,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:02:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 00:02:48,595 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 00:02:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 00:02:48,673 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-29 00:02:48,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:02:48,674 INFO L85 PathProgramCache]: Analyzing trace with hash -843208267, now seen corresponding path program 1 times [2021-10-29 00:02:48,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:02:48,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60079378] [2021-10-29 00:02:48,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:02:48,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:02:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:02:48,828 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-29 00:02:48,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:02:48,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60079378] [2021-10-29 00:02:48,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60079378] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:02:48,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:02:48,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 00:02:48,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843648947] [2021-10-29 00:02:48,835 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-29 00:02:48,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:02:48,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 00:02:48,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 00:02:48,842 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:02:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:02:48,889 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2021-10-29 00:02:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 00:02:48,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2021-10-29 00:02:48,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-10-29 00:02:48,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 93 transitions. [2021-10-29 00:02:48,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-10-29 00:02:48,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-10-29 00:02:48,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 93 transitions. [2021-10-29 00:02:48,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:02:48,896 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-29 00:02:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 93 transitions. [2021-10-29 00:02:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-10-29 00:02:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:02:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2021-10-29 00:02:48,903 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-29 00:02:48,903 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-29 00:02:48,903 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-29 00:02:48,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2021-10-29 00:02:48,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2021-10-29 00:02:48,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-29 00:02:48,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-29 00:02:48,907 INFO L842 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-29 00:02:48,907 INFO L843 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-29 00:02:48,908 INFO L791 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 429#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; 430#L163 assume 0 == ~r1~0; 408#L164 assume ~id1~0 >= 0; 395#L165 assume 0 == ~st1~0; 396#L166 assume ~send1~0 == ~id1~0; 413#L167 assume 0 == ~mode1~0 % 256; 387#L168 assume ~id2~0 >= 0; 388#L169 assume 0 == ~st2~0; 442#L170 assume ~send2~0 == ~id2~0; 433#L171 assume 0 == ~mode2~0 % 256; 431#L172 assume ~id3~0 >= 0; 432#L173 assume 0 == ~st3~0; 441#L174 assume ~send3~0 == ~id3~0; 378#L175 assume 0 == ~mode3~0 % 256; 379#L176 assume ~id4~0 >= 0; 435#L177 assume 0 == ~st4~0; 419#L178 assume ~send4~0 == ~id4~0; 420#L179 assume 0 == ~mode4~0 % 256; 373#L180 assume ~id1~0 != ~id2~0; 374#L181 assume ~id1~0 != ~id3~0; 416#L182 assume ~id1~0 != ~id4~0; 417#L183 assume ~id2~0 != ~id3~0; 400#L184 assume ~id2~0 != ~id4~0; 401#L185 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 409#L163-1 init_#res := init_~tmp~0; 410#L256 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 437#L312 assume !(0 == main_~i2~0); 397#L312-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; 386#L322-2 [2021-10-29 00:02:48,908 INFO L793 eck$LassoCheckResult]: Loop: 386#L322-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 380#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; 381#L65 assume !(node1_~m1~0 != ~nomsg~0); 399#L65-1 ~mode1~0 := 0; 434#L61-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 383#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 384#L92 assume !(node2_~m2~0 != ~nomsg~0); 426#L92-1 ~mode2~0 := 0; 404#L89-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 405#L114 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 389#L117 assume !(node3_~m3~0 != ~nomsg~0); 390#L117-1 ~mode3~0 := 0; 418#L114-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 421#L139 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 422#L142 assume !(node4_~m4~0 != ~nomsg~0); 392#L142-1 ~mode4~0 := 0; 393#L139-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; 406#L264 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 375#L265 assume ~r1~0 >= 4; 376#L269 assume ~r1~0 < 4;check_~tmp~1 := 1; 402#L264-1 check_#res := check_~tmp~1; 403#L284 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; 411#L349 assume !(0 == assert_~arg % 256); 412#L344 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 386#L322-2 [2021-10-29 00:02:48,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:02:48,909 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2021-10-29 00:02:48,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:02:48,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979603222] [2021-10-29 00:02:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:02:48,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:02:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 00:02:48,935 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 00:02:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 00:02:48,972 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-29 00:02:48,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:02:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash 9853125, now seen corresponding path program 1 times [2021-10-29 00:02:48,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:02:48,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309208049] [2021-10-29 00:02:48,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:02:48,974 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:02:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:02:49,005 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-29 00:02:49,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:02:49,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309208049] [2021-10-29 00:02:49,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309208049] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:02:49,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:02:49,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:02:49,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428007108] [2021-10-29 00:02:49,007 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-29 00:02:49,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:02:49,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:02:49,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:02:49,009 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:02:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:02:49,033 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2021-10-29 00:02:49,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:02:49,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 146 transitions. [2021-10-29 00:02:49,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2021-10-29 00:02:49,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 146 transitions. [2021-10-29 00:02:49,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2021-10-29 00:02:49,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2021-10-29 00:02:49,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 146 transitions. [2021-10-29 00:02:49,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:02:49,040 INFO L681 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2021-10-29 00:02:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 146 transitions. [2021-10-29 00:02:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-10-29 00:02:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 106 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:02:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2021-10-29 00:02:49,049 INFO L704 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2021-10-29 00:02:49,049 INFO L587 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2021-10-29 00:02:49,049 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-29 00:02:49,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. [2021-10-29 00:02:49,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2021-10-29 00:02:49,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-29 00:02:49,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-29 00:02:49,052 INFO L842 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-29 00:02:49,052 INFO L843 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-29 00:02:49,053 INFO L791 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 615#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; 616#L163 assume 0 == ~r1~0; 594#L164 assume ~id1~0 >= 0; 578#L165 assume 0 == ~st1~0; 579#L166 assume ~send1~0 == ~id1~0; 598#L167 assume 0 == ~mode1~0 % 256; 570#L168 assume ~id2~0 >= 0; 571#L169 assume 0 == ~st2~0; 629#L170 assume ~send2~0 == ~id2~0; 619#L171 assume 0 == ~mode2~0 % 256; 617#L172 assume ~id3~0 >= 0; 618#L173 assume 0 == ~st3~0; 628#L174 assume ~send3~0 == ~id3~0; 567#L175 assume 0 == ~mode3~0 % 256; 568#L176 assume ~id4~0 >= 0; 622#L177 assume 0 == ~st4~0; 605#L178 assume ~send4~0 == ~id4~0; 606#L179 assume 0 == ~mode4~0 % 256; 557#L180 assume ~id1~0 != ~id2~0; 558#L181 assume ~id1~0 != ~id3~0; 602#L182 assume ~id1~0 != ~id4~0; 604#L183 assume ~id2~0 != ~id3~0; 586#L184 assume ~id2~0 != ~id4~0; 587#L185 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 595#L163-1 init_#res := init_~tmp~0; 596#L256 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 623#L312 assume !(0 == main_~i2~0); 580#L312-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; 581#L322-2 [2021-10-29 00:02:49,053 INFO L793 eck$LassoCheckResult]: Loop: 581#L322-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 659#L61 assume !(0 != ~mode1~0 % 256); 658#L77 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 657#L77-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; 627#L61-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 656#L89 assume !(0 != ~mode2~0 % 256); 652#L102 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 651#L102-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 649#L89-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 647#L114 assume !(0 != ~mode3~0 % 256); 646#L127 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 645#L127-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; 643#L114-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 642#L139 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 640#L142 assume !(node4_~m4~0 != ~nomsg~0); 637#L142-1 ~mode4~0 := 0; 635#L139-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; 634#L264 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 633#L265 assume !(~r1~0 >= 4); 599#L268 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 600#L269 assume ~r1~0 < 4;check_~tmp~1 := 1; 584#L264-1 check_#res := check_~tmp~1; 585#L284 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; 632#L349 assume !(0 == assert_~arg % 256); 660#L344 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 581#L322-2 [2021-10-29 00:02:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:02:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2021-10-29 00:02:49,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:02:49,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780347806] [2021-10-29 00:02:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:02:49,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:02:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 00:02:49,082 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 00:02:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 00:02:49,162 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-29 00:02:49,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:02:49,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1926820423, now seen corresponding path program 1 times [2021-10-29 00:02:49,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:02:49,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134580263] [2021-10-29 00:02:49,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:02:49,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:02:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 00:02:49,222 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 00:02:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 00:02:49,240 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-29 00:02:49,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:02:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1410036755, now seen corresponding path program 1 times [2021-10-29 00:02:49,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:02:49,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53262185] [2021-10-29 00:02:49,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:02:49,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:02:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:02:49,349 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-29 00:02:49,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:02:49,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53262185] [2021-10-29 00:02:49,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53262185] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:02:49,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:02:49,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:02:49,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61026303] [2021-10-29 00:02:50,483 INFO L210 LassoAnalysis]: Preferences: [2021-10-29 00:02:50,484 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-29 00:02:50,484 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-29 00:02:50,485 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-29 00:02:50,485 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-10-29 00:02:50,485 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-29 00:02:50,485 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-29 00:02:50,485 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-29 00:02:50,486 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.1.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2021-10-29 00:02:50,486 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-29 00:02:50,486 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-29 00:02:50,508 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-29 00:02:50,515 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-29 00:02:50,517 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-29 00:02:50,522 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-29 00:02:50,527 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-29 00:02:50,529 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-29 00:02:50,531 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-29 00:02:50,533 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-29 00:02:50,539 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-29 00:02:50,541 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-29 00:02:50,546 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-29 00:02:50,550 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-29 00:02:50,553 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-29 00:02:50,558 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-29 00:02:50,560 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-29 00:02:50,764 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-29 00:02:51,113 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2021-10-29 00:03:23,091 WARN L207 SmtUtils]: Spent 31.68 s on a formula simplification. DAG size of input: 621 DAG size of output: 173 [2021-10-29 00:03:23,196 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-29 00:03:23,197 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-10-29 00:03:23,199 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-29 00:03:23,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:03:23,206 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-29 00:03:23,211 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-29 00:03:23,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-29 00:03:23,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-10-29 00:03:23,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-10-29 00:03:23,284 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-29 00:03:23,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:03:23,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-29 00:03:23,293 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-10-29 00:03:23,293 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-29 00:03:23,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-10-29 00:03:23,356 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-10-29 00:03:23,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-10-29 00:03:23,364 INFO L210 LassoAnalysis]: Preferences: [2021-10-29 00:03:23,364 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-29 00:03:23,364 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-29 00:03:23,364 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-29 00:03:23,364 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-29 00:03:23,365 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-29 00:03:23,365 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-29 00:03:23,365 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-29 00:03:23,365 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.1.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2021-10-29 00:03:23,365 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-29 00:03:23,365 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-29 00:03:23,370 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-29 00:03:23,377 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-29 00:03:23,383 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-29 00:03:23,385 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-29 00:03:23,390 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-29 00:03:23,392 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-29 00:03:23,394 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-29 00:03:23,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-29 00:03:23,398 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-29 00:03:23,403 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-29 00:03:23,408 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-29 00:03:23,411 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-29 00:03:23,416 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-29 00:03:23,421 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-29 00:03:23,635 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-29 00:03:23,638 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-29 00:03:24,041 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2021-10-29 00:03:55,792 WARN L207 SmtUtils]: Spent 31.51 s on a formula simplification. DAG size of input: 621 DAG size of output: 173 [2021-10-29 00:03:55,821 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-29 00:03:55,826 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-29 00:03:55,827 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-29 00:03:55,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:03:55,846 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-29 00:03:55,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-10-29 00:03:55,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-29 00:03:55,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-29 00:03:55,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-29 00:03:55,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-29 00:03:55,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-29 00:03:55,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-29 00:03:55,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-29 00:03:55,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-29 00:03:55,876 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-29 00:03:55,881 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-10-29 00:03:55,881 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-10-29 00:03:55,882 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-29 00:03:55,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:03:55,884 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-29 00:03:55,890 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-29 00:03:55,890 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-10-29 00:03:55,890 INFO L513 LassoAnalysis]: Proved termination. [2021-10-29 00:03:55,891 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2021-10-29 00:03:55,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-10-29 00:03:55,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-10-29 00:03:55,952 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-10-29 00:03:55,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:56,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-29 00:03:56,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 00:03:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:56,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-29 00:03:56,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 00:03:56,405 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-29 00:03:56,409 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-29 00:03:56,410 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:56,473 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 184 states and 263 transitions. Complement of second has 4 states. [2021-10-29 00:03:56,473 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-29 00:03:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2021-10-29 00:03:56,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 25 letters. [2021-10-29 00:03:56,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-29 00:03:56,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 54 letters. Loop has 25 letters. [2021-10-29 00:03:56,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-29 00:03:56,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 50 letters. [2021-10-29 00:03:56,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-29 00:03:56,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 263 transitions. [2021-10-29 00:03:56,490 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-29 00:03:56,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 0 states and 0 transitions. [2021-10-29 00:03:56,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-29 00:03:56,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-29 00:03:56,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-29 00:03:56,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:03:56,496 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 00:03:56,496 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 00:03:56,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:56,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:56,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:56,497 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:56,501 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-10-29 00:03:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-29 00:03:56,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-10-29 00:03:56,502 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-29 00:03:56,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 00:03:56,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-29 00:03:56,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-29 00:03:56,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-29 00:03:56,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:03:56,503 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 00:03:56,503 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 00:03:56,503 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 00:03:56,503 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-29 00:03:56,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-10-29 00:03:56,503 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-29 00:03:56,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-10-29 00:03:56,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.10 12:03:56 BoogieIcfgContainer [2021-10-29 00:03:56,509 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-29 00:03:56,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 00:03:56,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 00:03:56,510 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 00:03:56,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 12:02:47" (3/4) ... [2021-10-29 00:03:56,513 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-29 00:03:56,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 00:03:56,515 INFO L168 Benchmark]: Toolchain (without parser) took 69864.21 ms. Allocated memory was 98.6 MB in the beginning and 251.7 MB in the end (delta: 153.1 MB). Free memory was 54.1 MB in the beginning and 116.5 MB in the end (delta: -62.5 MB). Peak memory consumption was 92.8 MB. Max. memory is 16.1 GB. [2021-10-29 00:03:56,515 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 98.6 MB. Free memory is still 70.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 00:03:56,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.47 ms. Allocated memory is still 98.6 MB. Free memory was 53.8 MB in the beginning and 69.3 MB in the end (delta: -15.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-29 00:03:56,517 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.46 ms. Allocated memory is still 98.6 MB. Free memory was 69.3 MB in the beginning and 67.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 00:03:56,521 INFO L168 Benchmark]: Boogie Preprocessor took 63.06 ms. Allocated memory is still 98.6 MB. Free memory was 67.2 MB in the beginning and 65.6 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 00:03:56,522 INFO L168 Benchmark]: RCFGBuilder took 581.81 ms. Allocated memory is still 98.6 MB. Free memory was 65.5 MB in the beginning and 48.4 MB in the end (delta: 17.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-29 00:03:56,523 INFO L168 Benchmark]: BuchiAutomizer took 68739.59 ms. Allocated memory was 98.6 MB in the beginning and 251.7 MB in the end (delta: 153.1 MB). Free memory was 48.0 MB in the beginning and 116.5 MB in the end (delta: -68.5 MB). Peak memory consumption was 86.3 MB. Max. memory is 16.1 GB. [2021-10-29 00:03:56,524 INFO L168 Benchmark]: Witness Printer took 3.70 ms. Allocated memory is still 251.7 MB. Free memory is still 116.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 00:03:56,532 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 98.6 MB. Free memory is still 70.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 385.47 ms. Allocated memory is still 98.6 MB. Free memory was 53.8 MB in the beginning and 69.3 MB in the end (delta: -15.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.46 ms. Allocated memory is still 98.6 MB. Free memory was 69.3 MB in the beginning and 67.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.06 ms. Allocated memory is still 98.6 MB. Free memory was 67.2 MB in the beginning and 65.6 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 581.81 ms. Allocated memory is still 98.6 MB. Free memory was 65.5 MB in the beginning and 48.4 MB in the end (delta: 17.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 68739.59 ms. Allocated memory was 98.6 MB in the beginning and 251.7 MB in the end (delta: 153.1 MB). Free memory was 48.0 MB in the beginning and 116.5 MB in the end (delta: -68.5 MB). Peak memory consumption was 86.3 MB. Max. memory is 16.1 GB. * Witness Printer took 3.70 ms. Allocated memory is still 251.7 MB. Free memory is still 116.5 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 15 + -2 * i2 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 68.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 67.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. 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, 278 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: inital194 mio100 ax100 hnf100 lsp101 ukn63 mio100 lsp100 div174 bol100 ite100 ukn100 eq165 hnf67 smp100 dnf38929 smp11 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 63ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-10-29 00:03:56,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-10-29 00:03:56,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b28692a-fc1f-4784-b6b7-e846c89a6d55/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...