./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:54:21,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:54:21,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:54:21,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:54:21,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:54:21,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:54:21,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:54:21,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:54:21,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:54:21,419 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:54:21,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:54:21,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:54:21,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:54:21,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:54:21,422 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:54:21,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:54:21,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:54:21,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:54:21,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:54:21,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:54:21,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:54:21,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:54:21,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:54:21,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:54:21,424 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:54:21,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:54:21,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:54:21,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:54:21,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:54:21,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:54:21,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:54:21,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:54:21,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:54:21,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:54:21,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:54:21,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:54:21,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:54:21,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:54:21,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:54:21,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:54:21,427 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:54:21,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:54:21,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:54:21,427 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:54:21,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:54:21,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:54:21,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:54:21,649 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:54:21,649 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:54:21,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-27 22:54:21,749 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:54:21,750 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:54:21,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:54:22,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:54:22,965 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:54:22,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:54:22,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5142a3fac/2f606b28616c46958dd3e8e4bb160eac/FLAG8f0418021 [2024-06-27 22:54:23,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5142a3fac/2f606b28616c46958dd3e8e4bb160eac [2024-06-27 22:54:23,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:54:23,008 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:54:23,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:54:23,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:54:23,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:54:23,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:54:21" (1/2) ... [2024-06-27 22:54:23,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29dfd900 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:23, skipping insertion in model container [2024-06-27 22:54:23,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:54:21" (1/2) ... [2024-06-27 22:54:23,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1f1d33fd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:23, skipping insertion in model container [2024-06-27 22:54:23,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:54:23" (2/2) ... [2024-06-27 22:54:23,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29dfd900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23, skipping insertion in model container [2024-06-27 22:54:23,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:54:23" (2/2) ... [2024-06-27 22:54:23,034 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:54:23,059 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:54:23,060 INFO L97 edCorrectnessWitness]: Location invariant before [L852-L852] ! multithreaded || ((((((((((((0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:54:23,061 INFO L97 edCorrectnessWitness]: Location invariant before [L855-L855] ! multithreaded || ((((((((((((0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:54:23,061 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] ! multithreaded || ((((((((((((0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:54:23,061 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:54:23,061 INFO L106 edCorrectnessWitness]: ghost_update [L850-L850] multithreaded = 1; [2024-06-27 22:54:23,101 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:54:23,232 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-06-27 22:54:23,381 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:54:23,401 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:54:23,440 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:54:23,549 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:54:23,591 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:54:23,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23 WrapperNode [2024-06-27 22:54:23,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:54:23,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:54:23,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:54:23,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:54:23,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (1/1) ... [2024-06-27 22:54:23,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (1/1) ... [2024-06-27 22:54:23,655 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2024-06-27 22:54:23,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:54:23,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:54:23,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:54:23,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:54:23,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (1/1) ... [2024-06-27 22:54:23,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (1/1) ... [2024-06-27 22:54:23,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (1/1) ... [2024-06-27 22:54:23,685 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:54:23,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (1/1) ... [2024-06-27 22:54:23,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (1/1) ... [2024-06-27 22:54:23,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (1/1) ... [2024-06-27 22:54:23,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (1/1) ... [2024-06-27 22:54:23,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (1/1) ... [2024-06-27 22:54:23,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (1/1) ... [2024-06-27 22:54:23,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:54:23,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:54:23,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:54:23,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:54:23,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (1/1) ... [2024-06-27 22:54:23,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:54:23,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:54:23,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:54:23,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:54:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:54:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:54:23,794 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:54:23,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:54:23,795 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:54:23,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:54:23,795 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:54:23,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:54:23,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:54:23,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:54:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:54:23,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:54:23,797 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:54:23,937 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:54:23,940 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:54:24,290 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:54:24,290 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:54:24,449 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:54:24,449 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:54:24,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:54:24 BoogieIcfgContainer [2024-06-27 22:54:24,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:54:24,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:54:24,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:54:24,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:54:24,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:54:21" (1/4) ... [2024-06-27 22:54:24,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4445da8c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:54:24, skipping insertion in model container [2024-06-27 22:54:24,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:54:23" (2/4) ... [2024-06-27 22:54:24,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4445da8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:54:24, skipping insertion in model container [2024-06-27 22:54:24,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:23" (3/4) ... [2024-06-27 22:54:24,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4445da8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:54:24, skipping insertion in model container [2024-06-27 22:54:24,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:54:24" (4/4) ... [2024-06-27 22:54:24,468 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:54:24,482 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:54:24,482 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:54:24,482 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:54:24,515 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:54:24,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 108 flow [2024-06-27 22:54:24,569 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-06-27 22:54:24,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:54:24,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-06-27 22:54:24,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 48 transitions, 108 flow [2024-06-27 22:54:24,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 45 transitions, 99 flow [2024-06-27 22:54:24,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:54:24,598 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@dd913ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:54:24,598 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:54:24,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:54:24,602 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:54:24,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:54:24,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:24,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:54:24,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:24,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash 426542501, now seen corresponding path program 1 times [2024-06-27 22:54:24,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:24,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208289120] [2024-06-27 22:54:24,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:24,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:25,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208289120] [2024-06-27 22:54:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208289120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:25,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:25,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:54:25,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35706919] [2024-06-27 22:54:25,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:25,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:54:25,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:25,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:54:25,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:54:25,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:54:25,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2024-06-27 22:54:25,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:25,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:54:25,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:25,565 INFO L124 PetriNetUnfolderBase]: 1040/1863 cut-off events. [2024-06-27 22:54:25,566 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-06-27 22:54:25,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3466 conditions, 1863 events. 1040/1863 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12245 event pairs, 392 based on Foata normal form. 75/1844 useless extension candidates. Maximal degree in co-relation 3454. Up to 1189 conditions per place. [2024-06-27 22:54:25,580 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 32 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-06-27 22:54:25,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 187 flow [2024-06-27 22:54:25,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:54:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:54:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-06-27 22:54:25,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2024-06-27 22:54:25,590 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 99 flow. Second operand 3 states and 102 transitions. [2024-06-27 22:54:25,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 187 flow [2024-06-27 22:54:25,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:25,595 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 94 flow [2024-06-27 22:54:25,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-06-27 22:54:25,598 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2024-06-27 22:54:25,599 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 94 flow [2024-06-27 22:54:25,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2024-06-27 22:54:25,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:25,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:25,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:54:25,600 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:25,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:25,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2078635498, now seen corresponding path program 1 times [2024-06-27 22:54:25,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:25,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891307106] [2024-06-27 22:54:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:25,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:25,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:25,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891307106] [2024-06-27 22:54:25,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891307106] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:25,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:25,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:54:25,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541073599] [2024-06-27 22:54:25,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:25,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:54:25,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:25,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:54:25,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:54:25,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:54:25,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2024-06-27 22:54:25,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:25,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:54:25,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:26,286 INFO L124 PetriNetUnfolderBase]: 1102/2017 cut-off events. [2024-06-27 22:54:26,286 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2024-06-27 22:54:26,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3932 conditions, 2017 events. 1102/2017 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13343 event pairs, 254 based on Foata normal form. 15/1952 useless extension candidates. Maximal degree in co-relation 3920. Up to 1131 conditions per place. [2024-06-27 22:54:26,295 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 37 selfloop transitions, 9 changer transitions 0/63 dead transitions. [2024-06-27 22:54:26,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 232 flow [2024-06-27 22:54:26,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:54:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:54:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-06-27 22:54:26,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2024-06-27 22:54:26,297 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 94 flow. Second operand 4 states and 127 transitions. [2024-06-27 22:54:26,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 232 flow [2024-06-27 22:54:26,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:26,299 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 146 flow [2024-06-27 22:54:26,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2024-06-27 22:54:26,300 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2024-06-27 22:54:26,300 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 146 flow [2024-06-27 22:54:26,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2024-06-27 22:54:26,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:26,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:26,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:54:26,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:26,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash -408859819, now seen corresponding path program 1 times [2024-06-27 22:54:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:26,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864655846] [2024-06-27 22:54:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:26,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:26,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:26,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864655846] [2024-06-27 22:54:26,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864655846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:26,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:26,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:26,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599900164] [2024-06-27 22:54:26,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:26,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:26,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:26,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:26,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:26,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:54:26,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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) [2024-06-27 22:54:26,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:26,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:54:26,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:27,182 INFO L124 PetriNetUnfolderBase]: 1406/2640 cut-off events. [2024-06-27 22:54:27,183 INFO L125 PetriNetUnfolderBase]: For 755/764 co-relation queries the response was YES. [2024-06-27 22:54:27,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6325 conditions, 2640 events. 1406/2640 cut-off events. For 755/764 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18972 event pairs, 359 based on Foata normal form. 30/2560 useless extension candidates. Maximal degree in co-relation 6312. Up to 1092 conditions per place. [2024-06-27 22:54:27,200 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 49 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2024-06-27 22:54:27,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 342 flow [2024-06-27 22:54:27,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2024-06-27 22:54:27,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6625 [2024-06-27 22:54:27,205 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 146 flow. Second operand 5 states and 159 transitions. [2024-06-27 22:54:27,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 342 flow [2024-06-27 22:54:27,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:27,209 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 157 flow [2024-06-27 22:54:27,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-27 22:54:27,210 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2024-06-27 22:54:27,210 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 157 flow [2024-06-27 22:54:27,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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) [2024-06-27 22:54:27,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:27,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:27,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:54:27,211 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:27,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:27,211 INFO L85 PathProgramCache]: Analyzing trace with hash 209941640, now seen corresponding path program 1 times [2024-06-27 22:54:27,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:27,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096765241] [2024-06-27 22:54:27,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:27,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:27,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:27,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096765241] [2024-06-27 22:54:27,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096765241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:27,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:27,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:27,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983033376] [2024-06-27 22:54:27,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:27,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:27,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:27,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:27,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:27,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:54:27,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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) [2024-06-27 22:54:27,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:27,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:54:27,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:27,973 INFO L124 PetriNetUnfolderBase]: 1524/2832 cut-off events. [2024-06-27 22:54:27,974 INFO L125 PetriNetUnfolderBase]: For 1349/1358 co-relation queries the response was YES. [2024-06-27 22:54:27,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6924 conditions, 2832 events. 1524/2832 cut-off events. For 1349/1358 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 20312 event pairs, 249 based on Foata normal form. 12/2760 useless extension candidates. Maximal degree in co-relation 6910. Up to 1613 conditions per place. [2024-06-27 22:54:27,992 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 42 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2024-06-27 22:54:27,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 329 flow [2024-06-27 22:54:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:54:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:54:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-06-27 22:54:27,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2024-06-27 22:54:27,994 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 157 flow. Second operand 4 states and 127 transitions. [2024-06-27 22:54:27,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 329 flow [2024-06-27 22:54:28,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 312 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:28,001 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 195 flow [2024-06-27 22:54:28,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-06-27 22:54:28,002 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2024-06-27 22:54:28,002 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 195 flow [2024-06-27 22:54:28,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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) [2024-06-27 22:54:28,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:28,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:28,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:54:28,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:28,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2088422188, now seen corresponding path program 1 times [2024-06-27 22:54:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:28,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518837571] [2024-06-27 22:54:28,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:28,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:28,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:28,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518837571] [2024-06-27 22:54:28,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518837571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:28,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:28,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:28,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918059373] [2024-06-27 22:54:28,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:28,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:28,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:28,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:28,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:28,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:54:28,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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) [2024-06-27 22:54:28,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:28,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:54:28,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:28,740 INFO L124 PetriNetUnfolderBase]: 1560/2926 cut-off events. [2024-06-27 22:54:28,741 INFO L125 PetriNetUnfolderBase]: For 2287/2296 co-relation queries the response was YES. [2024-06-27 22:54:28,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7942 conditions, 2926 events. 1560/2926 cut-off events. For 2287/2296 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 21187 event pairs, 238 based on Foata normal form. 46/2893 useless extension candidates. Maximal degree in co-relation 7927. Up to 1730 conditions per place. [2024-06-27 22:54:28,759 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 41 selfloop transitions, 14 changer transitions 0/72 dead transitions. [2024-06-27 22:54:28,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 375 flow [2024-06-27 22:54:28,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-06-27 22:54:28,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6125 [2024-06-27 22:54:28,761 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 195 flow. Second operand 5 states and 147 transitions. [2024-06-27 22:54:28,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 375 flow [2024-06-27 22:54:28,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 361 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:28,768 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 254 flow [2024-06-27 22:54:28,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=254, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2024-06-27 22:54:28,770 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2024-06-27 22:54:28,774 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 254 flow [2024-06-27 22:54:28,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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) [2024-06-27 22:54:28,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:28,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:28,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:54:28,775 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:28,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash -482847267, now seen corresponding path program 1 times [2024-06-27 22:54:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553811997] [2024-06-27 22:54:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:29,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:29,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553811997] [2024-06-27 22:54:29,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553811997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:29,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:29,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788602385] [2024-06-27 22:54:29,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:29,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:29,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:29,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:29,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-06-27 22:54:29,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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) [2024-06-27 22:54:29,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:29,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-06-27 22:54:29,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:30,529 INFO L124 PetriNetUnfolderBase]: 6179/9988 cut-off events. [2024-06-27 22:54:30,529 INFO L125 PetriNetUnfolderBase]: For 11186/11192 co-relation queries the response was YES. [2024-06-27 22:54:30,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30244 conditions, 9988 events. 6179/9988 cut-off events. For 11186/11192 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 73582 event pairs, 1615 based on Foata normal form. 0/9719 useless extension candidates. Maximal degree in co-relation 30230. Up to 4668 conditions per place. [2024-06-27 22:54:30,579 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 65 selfloop transitions, 25 changer transitions 156/259 dead transitions. [2024-06-27 22:54:30,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 259 transitions, 1906 flow [2024-06-27 22:54:30,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:54:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:54:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 365 transitions. [2024-06-27 22:54:30,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6336805555555556 [2024-06-27 22:54:30,581 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 254 flow. Second operand 12 states and 365 transitions. [2024-06-27 22:54:30,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 259 transitions, 1906 flow [2024-06-27 22:54:30,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 259 transitions, 1897 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:30,589 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 638 flow [2024-06-27 22:54:30,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=638, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2024-06-27 22:54:30,591 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2024-06-27 22:54:30,591 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 638 flow [2024-06-27 22:54:30,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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) [2024-06-27 22:54:30,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:30,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:30,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:54:30,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:30,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:30,593 INFO L85 PathProgramCache]: Analyzing trace with hash -657664482, now seen corresponding path program 1 times [2024-06-27 22:54:30,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:30,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532833103] [2024-06-27 22:54:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:30,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:30,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:30,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532833103] [2024-06-27 22:54:30,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532833103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:30,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:30,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310619305] [2024-06-27 22:54:30,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:30,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:30,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:30,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:30,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:30,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-06-27 22:54:30,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 638 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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) [2024-06-27 22:54:30,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:30,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-06-27 22:54:30,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:31,684 INFO L124 PetriNetUnfolderBase]: 3233/5569 cut-off events. [2024-06-27 22:54:31,684 INFO L125 PetriNetUnfolderBase]: For 29884/30082 co-relation queries the response was YES. [2024-06-27 22:54:31,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27163 conditions, 5569 events. 3233/5569 cut-off events. For 29884/30082 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 40926 event pairs, 612 based on Foata normal form. 347/5826 useless extension candidates. Maximal degree in co-relation 27140. Up to 2743 conditions per place. [2024-06-27 22:54:31,732 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 97 selfloop transitions, 13 changer transitions 88/216 dead transitions. [2024-06-27 22:54:31,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 216 transitions, 2517 flow [2024-06-27 22:54:31,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2024-06-27 22:54:31,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6369047619047619 [2024-06-27 22:54:31,734 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 638 flow. Second operand 7 states and 214 transitions. [2024-06-27 22:54:31,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 216 transitions, 2517 flow [2024-06-27 22:54:31,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 216 transitions, 2371 flow, removed 73 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:31,783 INFO L231 Difference]: Finished difference. Result has 69 places, 84 transitions, 705 flow [2024-06-27 22:54:31,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=705, PETRI_PLACES=69, PETRI_TRANSITIONS=84} [2024-06-27 22:54:31,784 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2024-06-27 22:54:31,785 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 84 transitions, 705 flow [2024-06-27 22:54:31,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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) [2024-06-27 22:54:31,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:31,785 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-27 22:54:31,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:54:31,786 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:31,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:31,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1356383084, now seen corresponding path program 1 times [2024-06-27 22:54:31,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:31,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011132103] [2024-06-27 22:54:31,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:31,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:32,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:32,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011132103] [2024-06-27 22:54:32,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011132103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:32,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:32,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:32,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17384467] [2024-06-27 22:54:32,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:32,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:32,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:32,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:32,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:32,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:54:32,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 84 transitions, 705 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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) [2024-06-27 22:54:32,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:32,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:54:32,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:33,187 INFO L124 PetriNetUnfolderBase]: 3907/6902 cut-off events. [2024-06-27 22:54:33,187 INFO L125 PetriNetUnfolderBase]: For 27114/27253 co-relation queries the response was YES. [2024-06-27 22:54:33,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30959 conditions, 6902 events. 3907/6902 cut-off events. For 27114/27253 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 53280 event pairs, 374 based on Foata normal form. 215/7075 useless extension candidates. Maximal degree in co-relation 30936. Up to 4720 conditions per place. [2024-06-27 22:54:33,227 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 86 selfloop transitions, 8 changer transitions 59/170 dead transitions. [2024-06-27 22:54:33,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 170 transitions, 1748 flow [2024-06-27 22:54:33,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:54:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:54:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions. [2024-06-27 22:54:33,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6223958333333334 [2024-06-27 22:54:33,229 INFO L175 Difference]: Start difference. First operand has 69 places, 84 transitions, 705 flow. Second operand 8 states and 239 transitions. [2024-06-27 22:54:33,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 170 transitions, 1748 flow [2024-06-27 22:54:33,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 170 transitions, 1748 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 22:54:33,245 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 817 flow [2024-06-27 22:54:33,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=817, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2024-06-27 22:54:33,247 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 28 predicate places. [2024-06-27 22:54:33,247 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 817 flow [2024-06-27 22:54:33,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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) [2024-06-27 22:54:33,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:33,248 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-27 22:54:33,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:54:33,248 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:33,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:33,248 INFO L85 PathProgramCache]: Analyzing trace with hash 68369406, now seen corresponding path program 2 times [2024-06-27 22:54:33,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:33,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532530358] [2024-06-27 22:54:33,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:33,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:33,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:33,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532530358] [2024-06-27 22:54:33,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532530358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:33,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:33,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:54:33,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038328466] [2024-06-27 22:54:33,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:33,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:33,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:33,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:33,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:33,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:54:33,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 817 flow. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 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) [2024-06-27 22:54:33,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:33,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:54:33,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:34,911 INFO L124 PetriNetUnfolderBase]: 4161/7306 cut-off events. [2024-06-27 22:54:34,911 INFO L125 PetriNetUnfolderBase]: For 35599/35763 co-relation queries the response was YES. [2024-06-27 22:54:34,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35046 conditions, 7306 events. 4161/7306 cut-off events. For 35599/35763 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 57208 event pairs, 460 based on Foata normal form. 249/7509 useless extension candidates. Maximal degree in co-relation 35015. Up to 4426 conditions per place. [2024-06-27 22:54:34,972 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 87 selfloop transitions, 11 changer transitions 91/206 dead transitions. [2024-06-27 22:54:34,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 206 transitions, 2273 flow [2024-06-27 22:54:34,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:54:34,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:54:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 300 transitions. [2024-06-27 22:54:34,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-06-27 22:54:34,974 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 817 flow. Second operand 10 states and 300 transitions. [2024-06-27 22:54:34,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 206 transitions, 2273 flow [2024-06-27 22:54:35,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 206 transitions, 2209 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:35,033 INFO L231 Difference]: Finished difference. Result has 89 places, 94 transitions, 894 flow [2024-06-27 22:54:35,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=894, PETRI_PLACES=89, PETRI_TRANSITIONS=94} [2024-06-27 22:54:35,034 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places. [2024-06-27 22:54:35,034 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 894 flow [2024-06-27 22:54:35,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 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) [2024-06-27 22:54:35,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:35,034 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-27 22:54:35,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:54:35,035 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:35,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:35,035 INFO L85 PathProgramCache]: Analyzing trace with hash -214349347, now seen corresponding path program 1 times [2024-06-27 22:54:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:35,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090208966] [2024-06-27 22:54:35,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:35,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:35,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:35,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090208966] [2024-06-27 22:54:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090208966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:35,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:35,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:54:35,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979523475] [2024-06-27 22:54:35,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:35,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:54:35,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:35,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:54:35,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:54:35,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-06-27 22:54:35,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 894 flow. Second operand has 11 states, 11 states have (on average 19.818181818181817) internal successors, (218), 11 states have internal predecessors, (218), 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) [2024-06-27 22:54:35,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:35,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-06-27 22:54:35,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:36,947 INFO L124 PetriNetUnfolderBase]: 4099/7108 cut-off events. [2024-06-27 22:54:36,947 INFO L125 PetriNetUnfolderBase]: For 48489/48671 co-relation queries the response was YES. [2024-06-27 22:54:36,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36803 conditions, 7108 events. 4099/7108 cut-off events. For 48489/48671 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 54036 event pairs, 517 based on Foata normal form. 186/7250 useless extension candidates. Maximal degree in co-relation 36767. Up to 4545 conditions per place. [2024-06-27 22:54:36,997 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 89 selfloop transitions, 10 changer transitions 81/195 dead transitions. [2024-06-27 22:54:36,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 195 transitions, 2328 flow [2024-06-27 22:54:36,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:54:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:54:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 290 transitions. [2024-06-27 22:54:36,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5492424242424242 [2024-06-27 22:54:36,999 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 894 flow. Second operand 11 states and 290 transitions. [2024-06-27 22:54:36,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 195 transitions, 2328 flow [2024-06-27 22:54:37,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 195 transitions, 2241 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:37,065 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 946 flow [2024-06-27 22:54:37,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=946, PETRI_PLACES=96, PETRI_TRANSITIONS=97} [2024-06-27 22:54:37,066 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 42 predicate places. [2024-06-27 22:54:37,066 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 946 flow [2024-06-27 22:54:37,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.818181818181817) internal successors, (218), 11 states have internal predecessors, (218), 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) [2024-06-27 22:54:37,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:37,067 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-27 22:54:37,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:54:37,067 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:37,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1361078330, now seen corresponding path program 1 times [2024-06-27 22:54:37,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:37,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064167655] [2024-06-27 22:54:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:37,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:37,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:37,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064167655] [2024-06-27 22:54:37,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064167655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:37,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:37,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:37,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250913217] [2024-06-27 22:54:37,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:37,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:37,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:37,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:37,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:37,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-06-27 22:54:37,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 946 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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) [2024-06-27 22:54:37,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:37,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-06-27 22:54:37,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:38,324 INFO L124 PetriNetUnfolderBase]: 5366/9352 cut-off events. [2024-06-27 22:54:38,324 INFO L125 PetriNetUnfolderBase]: For 69909/70013 co-relation queries the response was YES. [2024-06-27 22:54:38,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49004 conditions, 9352 events. 5366/9352 cut-off events. For 69909/70013 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 75253 event pairs, 1362 based on Foata normal form. 137/9377 useless extension candidates. Maximal degree in co-relation 48963. Up to 3632 conditions per place. [2024-06-27 22:54:38,382 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 83 selfloop transitions, 4 changer transitions 64/167 dead transitions. [2024-06-27 22:54:38,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 167 transitions, 2082 flow [2024-06-27 22:54:38,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-06-27 22:54:38,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6279761904761905 [2024-06-27 22:54:38,384 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 946 flow. Second operand 7 states and 211 transitions. [2024-06-27 22:54:38,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 167 transitions, 2082 flow [2024-06-27 22:54:38,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 167 transitions, 1949 flow, removed 63 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:38,611 INFO L231 Difference]: Finished difference. Result has 93 places, 86 transitions, 786 flow [2024-06-27 22:54:38,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=786, PETRI_PLACES=93, PETRI_TRANSITIONS=86} [2024-06-27 22:54:38,612 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places. [2024-06-27 22:54:38,612 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 86 transitions, 786 flow [2024-06-27 22:54:38,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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) [2024-06-27 22:54:38,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:38,612 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-27 22:54:38,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:54:38,612 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:38,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:38,613 INFO L85 PathProgramCache]: Analyzing trace with hash -377317812, now seen corresponding path program 1 times [2024-06-27 22:54:38,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:38,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062568017] [2024-06-27 22:54:38,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:38,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:38,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:38,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062568017] [2024-06-27 22:54:38,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062568017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:38,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:38,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:54:38,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651509783] [2024-06-27 22:54:38,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:38,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:38,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:38,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:38,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:39,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2024-06-27 22:54:39,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 86 transitions, 786 flow. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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) [2024-06-27 22:54:39,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:39,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2024-06-27 22:54:39,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:39,955 INFO L124 PetriNetUnfolderBase]: 4175/7385 cut-off events. [2024-06-27 22:54:39,956 INFO L125 PetriNetUnfolderBase]: For 51439/51562 co-relation queries the response was YES. [2024-06-27 22:54:39,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36756 conditions, 7385 events. 4175/7385 cut-off events. For 51439/51562 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 57044 event pairs, 552 based on Foata normal form. 163/7449 useless extension candidates. Maximal degree in co-relation 36716. Up to 5201 conditions per place. [2024-06-27 22:54:39,999 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 79 selfloop transitions, 25 changer transitions 24/143 dead transitions. [2024-06-27 22:54:40,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 143 transitions, 1517 flow [2024-06-27 22:54:40,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:54:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:54:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-06-27 22:54:40,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515625 [2024-06-27 22:54:40,002 INFO L175 Difference]: Start difference. First operand has 93 places, 86 transitions, 786 flow. Second operand 8 states and 198 transitions. [2024-06-27 22:54:40,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 143 transitions, 1517 flow [2024-06-27 22:54:40,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 143 transitions, 1471 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-27 22:54:40,054 INFO L231 Difference]: Finished difference. Result has 87 places, 96 transitions, 971 flow [2024-06-27 22:54:40,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=971, PETRI_PLACES=87, PETRI_TRANSITIONS=96} [2024-06-27 22:54:40,055 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places. [2024-06-27 22:54:40,055 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 971 flow [2024-06-27 22:54:40,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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) [2024-06-27 22:54:40,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:40,056 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-27 22:54:40,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:54:40,056 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:40,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1303893602, now seen corresponding path program 2 times [2024-06-27 22:54:40,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:40,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941144258] [2024-06-27 22:54:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:40,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941144258] [2024-06-27 22:54:40,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941144258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:40,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:40,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658560130] [2024-06-27 22:54:40,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:40,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:54:40,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:40,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:54:40,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:54:40,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-06-27 22:54:40,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 96 transitions, 971 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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) [2024-06-27 22:54:40,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:40,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-06-27 22:54:40,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:41,222 INFO L124 PetriNetUnfolderBase]: 6714/10684 cut-off events. [2024-06-27 22:54:41,223 INFO L125 PetriNetUnfolderBase]: For 90032/90517 co-relation queries the response was YES. [2024-06-27 22:54:41,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50798 conditions, 10684 events. 6714/10684 cut-off events. For 90032/90517 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 73002 event pairs, 703 based on Foata normal form. 933/11521 useless extension candidates. Maximal degree in co-relation 50761. Up to 5302 conditions per place. [2024-06-27 22:54:41,288 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 142 selfloop transitions, 5 changer transitions 21/185 dead transitions. [2024-06-27 22:54:41,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 185 transitions, 2316 flow [2024-06-27 22:54:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:54:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:54:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-06-27 22:54:41,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6927083333333334 [2024-06-27 22:54:41,290 INFO L175 Difference]: Start difference. First operand has 87 places, 96 transitions, 971 flow. Second operand 4 states and 133 transitions. [2024-06-27 22:54:41,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 185 transitions, 2316 flow [2024-06-27 22:54:41,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 185 transitions, 2212 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:41,328 INFO L231 Difference]: Finished difference. Result has 85 places, 94 transitions, 881 flow [2024-06-27 22:54:41,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=881, PETRI_PLACES=85, PETRI_TRANSITIONS=94} [2024-06-27 22:54:41,329 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2024-06-27 22:54:41,329 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 94 transitions, 881 flow [2024-06-27 22:54:41,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 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) [2024-06-27 22:54:41,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:41,330 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-27 22:54:41,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:54:41,330 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:41,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:41,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1153297399, now seen corresponding path program 1 times [2024-06-27 22:54:41,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:41,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594372963] [2024-06-27 22:54:41,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:41,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:42,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:42,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594372963] [2024-06-27 22:54:42,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594372963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:42,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:42,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:54:42,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180158536] [2024-06-27 22:54:42,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:42,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:54:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:42,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:54:42,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:54:42,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-06-27 22:54:42,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 94 transitions, 881 flow. Second operand has 11 states, 11 states have (on average 17.90909090909091) internal successors, (197), 11 states have internal predecessors, (197), 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) [2024-06-27 22:54:42,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:42,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-06-27 22:54:42,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:43,206 INFO L124 PetriNetUnfolderBase]: 4395/7902 cut-off events. [2024-06-27 22:54:43,206 INFO L125 PetriNetUnfolderBase]: For 52977/53421 co-relation queries the response was YES. [2024-06-27 22:54:43,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38455 conditions, 7902 events. 4395/7902 cut-off events. For 52977/53421 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 61423 event pairs, 1227 based on Foata normal form. 222/7729 useless extension candidates. Maximal degree in co-relation 38417. Up to 5271 conditions per place. [2024-06-27 22:54:43,268 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 71 selfloop transitions, 54 changer transitions 38/183 dead transitions. [2024-06-27 22:54:43,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 183 transitions, 2049 flow [2024-06-27 22:54:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:54:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:54:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 298 transitions. [2024-06-27 22:54:43,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2024-06-27 22:54:43,270 INFO L175 Difference]: Start difference. First operand has 85 places, 94 transitions, 881 flow. Second operand 12 states and 298 transitions. [2024-06-27 22:54:43,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 183 transitions, 2049 flow [2024-06-27 22:54:43,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 183 transitions, 2043 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 22:54:43,306 INFO L231 Difference]: Finished difference. Result has 101 places, 115 transitions, 1371 flow [2024-06-27 22:54:43,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1371, PETRI_PLACES=101, PETRI_TRANSITIONS=115} [2024-06-27 22:54:43,306 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 47 predicate places. [2024-06-27 22:54:43,306 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 115 transitions, 1371 flow [2024-06-27 22:54:43,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.90909090909091) internal successors, (197), 11 states have internal predecessors, (197), 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) [2024-06-27 22:54:43,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:43,307 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-27 22:54:43,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:54:43,307 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:43,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash 488729377, now seen corresponding path program 2 times [2024-06-27 22:54:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:43,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112795345] [2024-06-27 22:54:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:44,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112795345] [2024-06-27 22:54:44,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112795345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:44,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:44,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:54:44,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80782654] [2024-06-27 22:54:44,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:44,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:54:44,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:44,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:54:44,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:54:44,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-06-27 22:54:44,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 115 transitions, 1371 flow. Second operand has 11 states, 11 states have (on average 19.90909090909091) internal successors, (219), 11 states have internal predecessors, (219), 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) [2024-06-27 22:54:44,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:44,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-06-27 22:54:44,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:45,655 INFO L124 PetriNetUnfolderBase]: 5456/9718 cut-off events. [2024-06-27 22:54:45,655 INFO L125 PetriNetUnfolderBase]: For 100496/101090 co-relation queries the response was YES. [2024-06-27 22:54:45,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52399 conditions, 9718 events. 5456/9718 cut-off events. For 100496/101090 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 76829 event pairs, 1343 based on Foata normal form. 262/9535 useless extension candidates. Maximal degree in co-relation 52353. Up to 6634 conditions per place. [2024-06-27 22:54:45,720 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 101 selfloop transitions, 47 changer transitions 42/209 dead transitions. [2024-06-27 22:54:45,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 209 transitions, 2780 flow [2024-06-27 22:54:45,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:54:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:54:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 343 transitions. [2024-06-27 22:54:45,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5496794871794872 [2024-06-27 22:54:45,722 INFO L175 Difference]: Start difference. First operand has 101 places, 115 transitions, 1371 flow. Second operand 13 states and 343 transitions. [2024-06-27 22:54:45,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 209 transitions, 2780 flow [2024-06-27 22:54:45,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 209 transitions, 2650 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-27 22:54:45,833 INFO L231 Difference]: Finished difference. Result has 110 places, 131 transitions, 1711 flow [2024-06-27 22:54:45,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1711, PETRI_PLACES=110, PETRI_TRANSITIONS=131} [2024-06-27 22:54:45,834 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 56 predicate places. [2024-06-27 22:54:45,834 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 131 transitions, 1711 flow [2024-06-27 22:54:45,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.90909090909091) internal successors, (219), 11 states have internal predecessors, (219), 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) [2024-06-27 22:54:45,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:45,834 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-27 22:54:45,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:54:45,834 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:45,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1977403841, now seen corresponding path program 3 times [2024-06-27 22:54:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:45,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782840759] [2024-06-27 22:54:45,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:46,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:46,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782840759] [2024-06-27 22:54:46,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782840759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:46,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:46,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:54:46,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552204146] [2024-06-27 22:54:46,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:46,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:46,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:46,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:46,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:46,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-06-27 22:54:46,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 131 transitions, 1711 flow. Second operand has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 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) [2024-06-27 22:54:46,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:46,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-06-27 22:54:46,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:48,488 INFO L124 PetriNetUnfolderBase]: 6739/12035 cut-off events. [2024-06-27 22:54:48,488 INFO L125 PetriNetUnfolderBase]: For 163909/164579 co-relation queries the response was YES. [2024-06-27 22:54:48,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70494 conditions, 12035 events. 6739/12035 cut-off events. For 163909/164579 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 100823 event pairs, 1743 based on Foata normal form. 442/11825 useless extension candidates. Maximal degree in co-relation 70443. Up to 5420 conditions per place. [2024-06-27 22:54:48,575 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 118 selfloop transitions, 39 changer transitions 36/213 dead transitions. [2024-06-27 22:54:48,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 213 transitions, 3267 flow [2024-06-27 22:54:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:54:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:54:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 263 transitions. [2024-06-27 22:54:48,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4981060606060606 [2024-06-27 22:54:48,577 INFO L175 Difference]: Start difference. First operand has 110 places, 131 transitions, 1711 flow. Second operand 11 states and 263 transitions. [2024-06-27 22:54:48,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 213 transitions, 3267 flow [2024-06-27 22:54:49,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 213 transitions, 3037 flow, removed 91 selfloop flow, removed 7 redundant places. [2024-06-27 22:54:49,008 INFO L231 Difference]: Finished difference. Result has 115 places, 134 transitions, 1888 flow [2024-06-27 22:54:49,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1888, PETRI_PLACES=115, PETRI_TRANSITIONS=134} [2024-06-27 22:54:49,009 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 61 predicate places. [2024-06-27 22:54:49,009 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 134 transitions, 1888 flow [2024-06-27 22:54:49,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 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) [2024-06-27 22:54:49,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:49,009 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-27 22:54:49,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:54:49,009 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:49,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:49,010 INFO L85 PathProgramCache]: Analyzing trace with hash -894202184, now seen corresponding path program 1 times [2024-06-27 22:54:49,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:49,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784739774] [2024-06-27 22:54:49,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:49,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:49,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:49,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784739774] [2024-06-27 22:54:49,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784739774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:49,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:49,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:49,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622003015] [2024-06-27 22:54:49,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:49,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:49,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:49,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:49,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:49,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-06-27 22:54:49,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 134 transitions, 1888 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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) [2024-06-27 22:54:49,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:49,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-06-27 22:54:49,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:50,651 INFO L124 PetriNetUnfolderBase]: 8435/13713 cut-off events. [2024-06-27 22:54:50,652 INFO L125 PetriNetUnfolderBase]: For 246211/246834 co-relation queries the response was YES. [2024-06-27 22:54:50,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78215 conditions, 13713 events. 8435/13713 cut-off events. For 246211/246834 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 99818 event pairs, 721 based on Foata normal form. 1124/14736 useless extension candidates. Maximal degree in co-relation 78163. Up to 4261 conditions per place. [2024-06-27 22:54:50,741 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 130 selfloop transitions, 8 changer transitions 74/229 dead transitions. [2024-06-27 22:54:50,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 229 transitions, 3769 flow [2024-06-27 22:54:50,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-06-27 22:54:50,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7041666666666667 [2024-06-27 22:54:50,742 INFO L175 Difference]: Start difference. First operand has 115 places, 134 transitions, 1888 flow. Second operand 5 states and 169 transitions. [2024-06-27 22:54:50,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 229 transitions, 3769 flow [2024-06-27 22:54:51,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 229 transitions, 3542 flow, removed 58 selfloop flow, removed 9 redundant places. [2024-06-27 22:54:51,086 INFO L231 Difference]: Finished difference. Result has 112 places, 106 transitions, 1296 flow [2024-06-27 22:54:51,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1594, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1296, PETRI_PLACES=112, PETRI_TRANSITIONS=106} [2024-06-27 22:54:51,086 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 58 predicate places. [2024-06-27 22:54:51,086 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 1296 flow [2024-06-27 22:54:51,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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) [2024-06-27 22:54:51,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:51,087 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1] [2024-06-27 22:54:51,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:54:51,087 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:51,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1380598721, now seen corresponding path program 1 times [2024-06-27 22:54:51,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:51,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671132634] [2024-06-27 22:54:51,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:51,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671132634] [2024-06-27 22:54:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671132634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:51,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445307702] [2024-06-27 22:54:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:51,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:51,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:51,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:51,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:51,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-06-27 22:54:51,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 1296 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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) [2024-06-27 22:54:51,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:51,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-06-27 22:54:51,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:52,439 INFO L124 PetriNetUnfolderBase]: 6589/10829 cut-off events. [2024-06-27 22:54:52,440 INFO L125 PetriNetUnfolderBase]: For 194262/194896 co-relation queries the response was YES. [2024-06-27 22:54:52,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63573 conditions, 10829 events. 6589/10829 cut-off events. For 194262/194896 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 78538 event pairs, 656 based on Foata normal form. 764/11495 useless extension candidates. Maximal degree in co-relation 63523. Up to 4024 conditions per place. [2024-06-27 22:54:52,514 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 117 selfloop transitions, 11 changer transitions 34/179 dead transitions. [2024-06-27 22:54:52,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 179 transitions, 2647 flow [2024-06-27 22:54:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2024-06-27 22:54:52,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6284722222222222 [2024-06-27 22:54:52,515 INFO L175 Difference]: Start difference. First operand has 112 places, 106 transitions, 1296 flow. Second operand 6 states and 181 transitions. [2024-06-27 22:54:52,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 179 transitions, 2647 flow [2024-06-27 22:54:52,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 179 transitions, 2422 flow, removed 80 selfloop flow, removed 11 redundant places. [2024-06-27 22:54:52,908 INFO L231 Difference]: Finished difference. Result has 104 places, 102 transitions, 1151 flow [2024-06-27 22:54:52,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1151, PETRI_PLACES=104, PETRI_TRANSITIONS=102} [2024-06-27 22:54:52,909 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 50 predicate places. [2024-06-27 22:54:52,909 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 102 transitions, 1151 flow [2024-06-27 22:54:52,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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) [2024-06-27 22:54:52,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:52,910 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:52,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:54:52,911 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:52,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:52,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1806377727, now seen corresponding path program 1 times [2024-06-27 22:54:52,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:52,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737145748] [2024-06-27 22:54:52,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:52,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:53,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:53,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737145748] [2024-06-27 22:54:53,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737145748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:53,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:53,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:54:53,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015354649] [2024-06-27 22:54:53,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:53,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:54:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:53,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:54:53,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:54:53,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:54:53,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 102 transitions, 1151 flow. Second operand has 9 states, 9 states have (on average 22.333333333333332) internal successors, (201), 9 states have internal predecessors, (201), 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) [2024-06-27 22:54:53,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:53,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:54:53,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:54,553 INFO L124 PetriNetUnfolderBase]: 4175/8344 cut-off events. [2024-06-27 22:54:54,554 INFO L125 PetriNetUnfolderBase]: For 67018/67785 co-relation queries the response was YES. [2024-06-27 22:54:54,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37803 conditions, 8344 events. 4175/8344 cut-off events. For 67018/67785 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 77060 event pairs, 1164 based on Foata normal form. 212/7647 useless extension candidates. Maximal degree in co-relation 37759. Up to 3764 conditions per place. [2024-06-27 22:54:54,608 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 53 selfloop transitions, 31 changer transitions 38/148 dead transitions. [2024-06-27 22:54:54,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 148 transitions, 1779 flow [2024-06-27 22:54:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:54:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:54:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 260 transitions. [2024-06-27 22:54:54,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2024-06-27 22:54:54,609 INFO L175 Difference]: Start difference. First operand has 104 places, 102 transitions, 1151 flow. Second operand 9 states and 260 transitions. [2024-06-27 22:54:54,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 148 transitions, 1779 flow [2024-06-27 22:54:54,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 148 transitions, 1564 flow, removed 98 selfloop flow, removed 10 redundant places. [2024-06-27 22:54:54,788 INFO L231 Difference]: Finished difference. Result has 107 places, 104 transitions, 1151 flow [2024-06-27 22:54:54,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1151, PETRI_PLACES=107, PETRI_TRANSITIONS=104} [2024-06-27 22:54:54,789 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 53 predicate places. [2024-06-27 22:54:54,789 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 104 transitions, 1151 flow [2024-06-27 22:54:54,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.333333333333332) internal successors, (201), 9 states have internal predecessors, (201), 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) [2024-06-27 22:54:54,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:54,790 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:54,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:54:54,790 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:54,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:54,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1375644649, now seen corresponding path program 2 times [2024-06-27 22:54:54,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:54,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302233872] [2024-06-27 22:54:54,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:54,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:55,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:55,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302233872] [2024-06-27 22:54:55,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302233872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:55,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:55,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:54:55,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204142556] [2024-06-27 22:54:55,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:55,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:55,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:55,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:55,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:55,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:54:55,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 104 transitions, 1151 flow. Second operand has 10 states, 10 states have (on average 22.1) internal successors, (221), 10 states have internal predecessors, (221), 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) [2024-06-27 22:54:55,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:55,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:54:55,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:56,524 INFO L124 PetriNetUnfolderBase]: 3551/7110 cut-off events. [2024-06-27 22:54:56,525 INFO L125 PetriNetUnfolderBase]: For 32278/32785 co-relation queries the response was YES. [2024-06-27 22:54:56,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28625 conditions, 7110 events. 3551/7110 cut-off events. For 32278/32785 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 63843 event pairs, 711 based on Foata normal form. 210/6606 useless extension candidates. Maximal degree in co-relation 28583. Up to 1783 conditions per place. [2024-06-27 22:54:56,571 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 67 selfloop transitions, 36 changer transitions 44/173 dead transitions. [2024-06-27 22:54:56,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 173 transitions, 2020 flow [2024-06-27 22:54:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:54:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:54:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 331 transitions. [2024-06-27 22:54:56,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5746527777777778 [2024-06-27 22:54:56,572 INFO L175 Difference]: Start difference. First operand has 107 places, 104 transitions, 1151 flow. Second operand 12 states and 331 transitions. [2024-06-27 22:54:56,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 173 transitions, 2020 flow [2024-06-27 22:54:56,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 173 transitions, 1878 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-06-27 22:54:56,683 INFO L231 Difference]: Finished difference. Result has 113 places, 102 transitions, 1191 flow [2024-06-27 22:54:56,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1191, PETRI_PLACES=113, PETRI_TRANSITIONS=102} [2024-06-27 22:54:56,684 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 59 predicate places. [2024-06-27 22:54:56,684 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 102 transitions, 1191 flow [2024-06-27 22:54:56,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.1) internal successors, (221), 10 states have internal predecessors, (221), 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) [2024-06-27 22:54:56,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:56,684 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:56,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:54:56,685 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:56,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:56,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1314667307, now seen corresponding path program 3 times [2024-06-27 22:54:56,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:56,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122662532] [2024-06-27 22:54:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:56,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:57,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:57,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122662532] [2024-06-27 22:54:57,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122662532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:57,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:57,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:54:57,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540557742] [2024-06-27 22:54:57,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:57,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:54:57,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:57,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:54:57,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:54:57,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:54:57,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 102 transitions, 1191 flow. Second operand has 11 states, 11 states have (on average 21.90909090909091) internal successors, (241), 11 states have internal predecessors, (241), 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) [2024-06-27 22:54:57,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:57,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:54:57,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:58,493 INFO L124 PetriNetUnfolderBase]: 2622/5567 cut-off events. [2024-06-27 22:54:58,493 INFO L125 PetriNetUnfolderBase]: For 27616/27943 co-relation queries the response was YES. [2024-06-27 22:54:58,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22517 conditions, 5567 events. 2622/5567 cut-off events. For 27616/27943 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 49204 event pairs, 579 based on Foata normal form. 140/5209 useless extension candidates. Maximal degree in co-relation 22473. Up to 2289 conditions per place. [2024-06-27 22:54:58,528 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 61 selfloop transitions, 30 changer transitions 34/151 dead transitions. [2024-06-27 22:54:58,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 151 transitions, 1782 flow [2024-06-27 22:54:58,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:54:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:54:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 300 transitions. [2024-06-27 22:54:58,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-06-27 22:54:58,529 INFO L175 Difference]: Start difference. First operand has 113 places, 102 transitions, 1191 flow. Second operand 11 states and 300 transitions. [2024-06-27 22:54:58,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 151 transitions, 1782 flow [2024-06-27 22:54:58,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 151 transitions, 1704 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-27 22:54:58,593 INFO L231 Difference]: Finished difference. Result has 119 places, 100 transitions, 1222 flow [2024-06-27 22:54:58,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1222, PETRI_PLACES=119, PETRI_TRANSITIONS=100} [2024-06-27 22:54:58,594 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 65 predicate places. [2024-06-27 22:54:58,594 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 100 transitions, 1222 flow [2024-06-27 22:54:58,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.90909090909091) internal successors, (241), 11 states have internal predecessors, (241), 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) [2024-06-27 22:54:58,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:58,595 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:58,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:54:58,595 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:58,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash 410396023, now seen corresponding path program 4 times [2024-06-27 22:54:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:58,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034175001] [2024-06-27 22:54:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:58,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:59,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:59,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034175001] [2024-06-27 22:54:59,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034175001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:59,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:59,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:54:59,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964154313] [2024-06-27 22:54:59,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:59,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:54:59,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:59,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:54:59,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:54:59,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:54:59,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 100 transitions, 1222 flow. Second operand has 10 states, 10 states have (on average 22.1) internal successors, (221), 10 states have internal predecessors, (221), 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) [2024-06-27 22:54:59,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:59,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:54:59,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:00,131 INFO L124 PetriNetUnfolderBase]: 2134/4530 cut-off events. [2024-06-27 22:55:00,131 INFO L125 PetriNetUnfolderBase]: For 26358/26632 co-relation queries the response was YES. [2024-06-27 22:55:00,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19106 conditions, 4530 events. 2134/4530 cut-off events. For 26358/26632 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 38771 event pairs, 622 based on Foata normal form. 108/4226 useless extension candidates. Maximal degree in co-relation 19061. Up to 1420 conditions per place. [2024-06-27 22:55:00,159 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 44 selfloop transitions, 13 changer transitions 53/136 dead transitions. [2024-06-27 22:55:00,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 136 transitions, 1677 flow [2024-06-27 22:55:00,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:55:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:55:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 250 transitions. [2024-06-27 22:55:00,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5787037037037037 [2024-06-27 22:55:00,161 INFO L175 Difference]: Start difference. First operand has 119 places, 100 transitions, 1222 flow. Second operand 9 states and 250 transitions. [2024-06-27 22:55:00,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 136 transitions, 1677 flow [2024-06-27 22:55:00,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 136 transitions, 1587 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-27 22:55:00,215 INFO L231 Difference]: Finished difference. Result has 120 places, 81 transitions, 829 flow [2024-06-27 22:55:00,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=829, PETRI_PLACES=120, PETRI_TRANSITIONS=81} [2024-06-27 22:55:00,215 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 66 predicate places. [2024-06-27 22:55:00,215 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 81 transitions, 829 flow [2024-06-27 22:55:00,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.1) internal successors, (221), 10 states have internal predecessors, (221), 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) [2024-06-27 22:55:00,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:00,216 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:00,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:55:00,216 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:00,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1426831509, now seen corresponding path program 5 times [2024-06-27 22:55:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191156471] [2024-06-27 22:55:00,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:01,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:01,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191156471] [2024-06-27 22:55:01,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191156471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:01,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:01,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-27 22:55:01,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235067549] [2024-06-27 22:55:01,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:01,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 22:55:01,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:01,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 22:55:01,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-27 22:55:01,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-06-27 22:55:01,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 81 transitions, 829 flow. Second operand has 13 states, 13 states have (on average 20.76923076923077) internal successors, (270), 13 states have internal predecessors, (270), 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) [2024-06-27 22:55:01,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:01,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-06-27 22:55:01,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:02,047 INFO L124 PetriNetUnfolderBase]: 1800/3795 cut-off events. [2024-06-27 22:55:02,047 INFO L125 PetriNetUnfolderBase]: For 21214/21411 co-relation queries the response was YES. [2024-06-27 22:55:02,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15256 conditions, 3795 events. 1800/3795 cut-off events. For 21214/21411 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 31574 event pairs, 439 based on Foata normal form. 100/3521 useless extension candidates. Maximal degree in co-relation 15209. Up to 1120 conditions per place. [2024-06-27 22:55:02,067 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 49 selfloop transitions, 20 changer transitions 27/121 dead transitions. [2024-06-27 22:55:02,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 1300 flow [2024-06-27 22:55:02,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:55:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:55:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 278 transitions. [2024-06-27 22:55:02,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265151515151515 [2024-06-27 22:55:02,068 INFO L175 Difference]: Start difference. First operand has 120 places, 81 transitions, 829 flow. Second operand 11 states and 278 transitions. [2024-06-27 22:55:02,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 1300 flow [2024-06-27 22:55:02,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 121 transitions, 1185 flow, removed 34 selfloop flow, removed 12 redundant places. [2024-06-27 22:55:02,098 INFO L231 Difference]: Finished difference. Result has 113 places, 83 transitions, 847 flow [2024-06-27 22:55:02,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=847, PETRI_PLACES=113, PETRI_TRANSITIONS=83} [2024-06-27 22:55:02,098 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 59 predicate places. [2024-06-27 22:55:02,099 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 83 transitions, 847 flow [2024-06-27 22:55:02,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 20.76923076923077) internal successors, (270), 13 states have internal predecessors, (270), 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) [2024-06-27 22:55:02,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:02,099 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:02,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:55:02,099 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:02,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:02,100 INFO L85 PathProgramCache]: Analyzing trace with hash 27934689, now seen corresponding path program 6 times [2024-06-27 22:55:02,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:02,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115922685] [2024-06-27 22:55:02,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:02,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:02,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:02,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115922685] [2024-06-27 22:55:02,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115922685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:02,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:02,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 22:55:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763660924] [2024-06-27 22:55:02,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:02,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:55:02,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:02,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:55:02,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:55:03,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-06-27 22:55:03,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 83 transitions, 847 flow. Second operand has 12 states, 12 states have (on average 17.916666666666668) internal successors, (215), 12 states have internal predecessors, (215), 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) [2024-06-27 22:55:03,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:03,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-06-27 22:55:03,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:03,641 INFO L124 PetriNetUnfolderBase]: 1691/3643 cut-off events. [2024-06-27 22:55:03,641 INFO L125 PetriNetUnfolderBase]: For 16754/16939 co-relation queries the response was YES. [2024-06-27 22:55:03,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14341 conditions, 3643 events. 1691/3643 cut-off events. For 16754/16939 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 30502 event pairs, 631 based on Foata normal form. 93/3359 useless extension candidates. Maximal degree in co-relation 14295. Up to 1710 conditions per place. [2024-06-27 22:55:03,665 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 43 selfloop transitions, 12 changer transitions 32/112 dead transitions. [2024-06-27 22:55:03,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 112 transitions, 1168 flow [2024-06-27 22:55:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:55:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:55:03,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 223 transitions. [2024-06-27 22:55:03,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46458333333333335 [2024-06-27 22:55:03,667 INFO L175 Difference]: Start difference. First operand has 113 places, 83 transitions, 847 flow. Second operand 10 states and 223 transitions. [2024-06-27 22:55:03,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 112 transitions, 1168 flow [2024-06-27 22:55:03,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 112 transitions, 1096 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-27 22:55:03,698 INFO L231 Difference]: Finished difference. Result has 113 places, 78 transitions, 728 flow [2024-06-27 22:55:03,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=728, PETRI_PLACES=113, PETRI_TRANSITIONS=78} [2024-06-27 22:55:03,699 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 59 predicate places. [2024-06-27 22:55:03,699 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 78 transitions, 728 flow [2024-06-27 22:55:03,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.916666666666668) internal successors, (215), 12 states have internal predecessors, (215), 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) [2024-06-27 22:55:03,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:03,699 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:03,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:55:03,700 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:03,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -123048431, now seen corresponding path program 7 times [2024-06-27 22:55:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:03,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374953601] [2024-06-27 22:55:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:03,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:04,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:04,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374953601] [2024-06-27 22:55:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374953601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:04,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:04,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:55:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391960193] [2024-06-27 22:55:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:04,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:55:04,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:04,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:55:04,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:55:04,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:55:04,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 78 transitions, 728 flow. Second operand has 9 states, 9 states have (on average 22.333333333333332) internal successors, (201), 9 states have internal predecessors, (201), 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) [2024-06-27 22:55:04,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:04,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:55:04,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:04,801 INFO L124 PetriNetUnfolderBase]: 1493/3294 cut-off events. [2024-06-27 22:55:04,801 INFO L125 PetriNetUnfolderBase]: For 13494/13647 co-relation queries the response was YES. [2024-06-27 22:55:04,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12322 conditions, 3294 events. 1493/3294 cut-off events. For 13494/13647 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 27157 event pairs, 367 based on Foata normal form. 83/3084 useless extension candidates. Maximal degree in co-relation 12278. Up to 910 conditions per place. [2024-06-27 22:55:04,819 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 40 selfloop transitions, 13 changer transitions 32/111 dead transitions. [2024-06-27 22:55:04,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 111 transitions, 1094 flow [2024-06-27 22:55:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:55:04,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:55:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 243 transitions. [2024-06-27 22:55:04,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-06-27 22:55:04,820 INFO L175 Difference]: Start difference. First operand has 113 places, 78 transitions, 728 flow. Second operand 9 states and 243 transitions. [2024-06-27 22:55:04,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 111 transitions, 1094 flow [2024-06-27 22:55:04,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 111 transitions, 1044 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-27 22:55:04,843 INFO L231 Difference]: Finished difference. Result has 112 places, 71 transitions, 648 flow [2024-06-27 22:55:04,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=648, PETRI_PLACES=112, PETRI_TRANSITIONS=71} [2024-06-27 22:55:04,843 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 58 predicate places. [2024-06-27 22:55:04,843 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 71 transitions, 648 flow [2024-06-27 22:55:04,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.333333333333332) internal successors, (201), 9 states have internal predecessors, (201), 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) [2024-06-27 22:55:04,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:04,844 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:04,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:55:04,844 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:04,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash -798864965, now seen corresponding path program 8 times [2024-06-27 22:55:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017786840] [2024-06-27 22:55:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:05,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:05,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017786840] [2024-06-27 22:55:05,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017786840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:05,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:05,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:55:05,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229488426] [2024-06-27 22:55:05,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:05,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:55:05,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:05,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:55:05,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:55:05,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2024-06-27 22:55:05,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 71 transitions, 648 flow. Second operand has 10 states, 10 states have (on average 19.5) internal successors, (195), 10 states have internal predecessors, (195), 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) [2024-06-27 22:55:05,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:05,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2024-06-27 22:55:05,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:05,809 INFO L124 PetriNetUnfolderBase]: 1465/3092 cut-off events. [2024-06-27 22:55:05,809 INFO L125 PetriNetUnfolderBase]: For 11816/11907 co-relation queries the response was YES. [2024-06-27 22:55:05,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11566 conditions, 3092 events. 1465/3092 cut-off events. For 11816/11907 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 24035 event pairs, 623 based on Foata normal form. 41/2848 useless extension candidates. Maximal degree in co-relation 11522. Up to 1396 conditions per place. [2024-06-27 22:55:05,829 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 40 selfloop transitions, 24 changer transitions 44/128 dead transitions. [2024-06-27 22:55:05,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 128 transitions, 1193 flow [2024-06-27 22:55:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:55:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:55:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 292 transitions. [2024-06-27 22:55:05,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-06-27 22:55:05,831 INFO L175 Difference]: Start difference. First operand has 112 places, 71 transitions, 648 flow. Second operand 12 states and 292 transitions. [2024-06-27 22:55:05,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 128 transitions, 1193 flow [2024-06-27 22:55:05,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 128 transitions, 990 flow, removed 40 selfloop flow, removed 19 redundant places. [2024-06-27 22:55:05,853 INFO L231 Difference]: Finished difference. Result has 102 places, 74 transitions, 587 flow [2024-06-27 22:55:05,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=587, PETRI_PLACES=102, PETRI_TRANSITIONS=74} [2024-06-27 22:55:05,854 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 48 predicate places. [2024-06-27 22:55:05,854 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 74 transitions, 587 flow [2024-06-27 22:55:05,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.5) internal successors, (195), 10 states have internal predecessors, (195), 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) [2024-06-27 22:55:05,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:05,854 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:05,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:55:05,855 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:05,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash 350326155, now seen corresponding path program 9 times [2024-06-27 22:55:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:05,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902477322] [2024-06-27 22:55:05,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:05,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:06,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:06,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902477322] [2024-06-27 22:55:06,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902477322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:06,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:06,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 22:55:06,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907478362] [2024-06-27 22:55:06,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:06,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:55:06,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:06,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:55:06,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:55:06,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:55:06,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 74 transitions, 587 flow. Second operand has 12 states, 12 states have (on average 21.75) internal successors, (261), 12 states have internal predecessors, (261), 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) [2024-06-27 22:55:06,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:06,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:55:06,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:07,219 INFO L124 PetriNetUnfolderBase]: 818/1765 cut-off events. [2024-06-27 22:55:07,220 INFO L125 PetriNetUnfolderBase]: For 4616/4701 co-relation queries the response was YES. [2024-06-27 22:55:07,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6244 conditions, 1765 events. 818/1765 cut-off events. For 4616/4701 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12091 event pairs, 266 based on Foata normal form. 33/1632 useless extension candidates. Maximal degree in co-relation 6209. Up to 716 conditions per place. [2024-06-27 22:55:07,229 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 38 selfloop transitions, 7 changer transitions 44/115 dead transitions. [2024-06-27 22:55:07,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 115 transitions, 995 flow [2024-06-27 22:55:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:55:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:55:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 289 transitions. [2024-06-27 22:55:07,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5473484848484849 [2024-06-27 22:55:07,230 INFO L175 Difference]: Start difference. First operand has 102 places, 74 transitions, 587 flow. Second operand 11 states and 289 transitions. [2024-06-27 22:55:07,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 115 transitions, 995 flow [2024-06-27 22:55:07,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 115 transitions, 947 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-27 22:55:07,240 INFO L231 Difference]: Finished difference. Result has 109 places, 68 transitions, 528 flow [2024-06-27 22:55:07,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=528, PETRI_PLACES=109, PETRI_TRANSITIONS=68} [2024-06-27 22:55:07,241 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 55 predicate places. [2024-06-27 22:55:07,241 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 68 transitions, 528 flow [2024-06-27 22:55:07,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.75) internal successors, (261), 12 states have internal predecessors, (261), 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) [2024-06-27 22:55:07,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:07,241 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:07,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:55:07,241 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:07,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:07,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1492972679, now seen corresponding path program 10 times [2024-06-27 22:55:07,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:07,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280910854] [2024-06-27 22:55:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:07,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:07,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280910854] [2024-06-27 22:55:07,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280910854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:07,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:07,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:55:07,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303977120] [2024-06-27 22:55:07,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:07,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:55:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:07,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:55:07,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:55:07,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:55:07,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 68 transitions, 528 flow. Second operand has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 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) [2024-06-27 22:55:07,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:07,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:55:07,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:08,020 INFO L124 PetriNetUnfolderBase]: 544/1158 cut-off events. [2024-06-27 22:55:08,021 INFO L125 PetriNetUnfolderBase]: For 3241/3290 co-relation queries the response was YES. [2024-06-27 22:55:08,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4076 conditions, 1158 events. 544/1158 cut-off events. For 3241/3290 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7049 event pairs, 200 based on Foata normal form. 22/1067 useless extension candidates. Maximal degree in co-relation 4039. Up to 574 conditions per place. [2024-06-27 22:55:08,027 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 25 selfloop transitions, 7 changer transitions 25/82 dead transitions. [2024-06-27 22:55:08,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 82 transitions, 684 flow [2024-06-27 22:55:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:55:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:55:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-06-27 22:55:08,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-06-27 22:55:08,028 INFO L175 Difference]: Start difference. First operand has 109 places, 68 transitions, 528 flow. Second operand 7 states and 182 transitions. [2024-06-27 22:55:08,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 82 transitions, 684 flow [2024-06-27 22:55:08,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 82 transitions, 636 flow, removed 13 selfloop flow, removed 12 redundant places. [2024-06-27 22:55:08,035 INFO L231 Difference]: Finished difference. Result has 96 places, 54 transitions, 346 flow [2024-06-27 22:55:08,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=96, PETRI_TRANSITIONS=54} [2024-06-27 22:55:08,036 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 42 predicate places. [2024-06-27 22:55:08,036 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 54 transitions, 346 flow [2024-06-27 22:55:08,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 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) [2024-06-27 22:55:08,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:08,036 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:08,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:55:08,036 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:08,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash 100697973, now seen corresponding path program 11 times [2024-06-27 22:55:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765220925] [2024-06-27 22:55:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:08,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:55:08,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:08,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765220925] [2024-06-27 22:55:08,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765220925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:08,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:08,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:55:08,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309416210] [2024-06-27 22:55:08,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:08,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:55:08,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:08,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:55:08,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:55:08,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-06-27 22:55:08,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 54 transitions, 346 flow. Second operand has 11 states, 11 states have (on average 21.90909090909091) internal successors, (241), 11 states have internal predecessors, (241), 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) [2024-06-27 22:55:08,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:08,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-06-27 22:55:08,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:08,872 INFO L124 PetriNetUnfolderBase]: 416/898 cut-off events. [2024-06-27 22:55:08,873 INFO L125 PetriNetUnfolderBase]: For 1760/1793 co-relation queries the response was YES. [2024-06-27 22:55:08,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2993 conditions, 898 events. 416/898 cut-off events. For 1760/1793 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5177 event pairs, 248 based on Foata normal form. 17/844 useless extension candidates. Maximal degree in co-relation 2962. Up to 314 conditions per place. [2024-06-27 22:55:08,877 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 23 selfloop transitions, 5 changer transitions 24/75 dead transitions. [2024-06-27 22:55:08,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 75 transitions, 526 flow [2024-06-27 22:55:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:55:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:55:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 250 transitions. [2024-06-27 22:55:08,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-27 22:55:08,878 INFO L175 Difference]: Start difference. First operand has 96 places, 54 transitions, 346 flow. Second operand 10 states and 250 transitions. [2024-06-27 22:55:08,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 75 transitions, 526 flow [2024-06-27 22:55:08,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 75 transitions, 419 flow, removed 18 selfloop flow, removed 20 redundant places. [2024-06-27 22:55:08,881 INFO L231 Difference]: Finished difference. Result has 84 places, 47 transitions, 232 flow [2024-06-27 22:55:08,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=84, PETRI_TRANSITIONS=47} [2024-06-27 22:55:08,883 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places. [2024-06-27 22:55:08,884 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 47 transitions, 232 flow [2024-06-27 22:55:08,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.90909090909091) internal successors, (241), 11 states have internal predecessors, (241), 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) [2024-06-27 22:55:08,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:08,884 INFO L208 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:08,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:55:08,885 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:55:08,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:08,885 INFO L85 PathProgramCache]: Analyzing trace with hash -34874379, now seen corresponding path program 12 times [2024-06-27 22:55:08,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:08,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647505937] [2024-06-27 22:55:08,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:08,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:55:08,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:55:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:55:08,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:55:08,974 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:55:08,975 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-06-27 22:55:08,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-06-27 22:55:08,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 9 remaining) [2024-06-27 22:55:08,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-06-27 22:55:08,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 9 remaining) [2024-06-27 22:55:08,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-06-27 22:55:08,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-06-27 22:55:08,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2024-06-27 22:55:08,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-06-27 22:55:08,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:55:08,981 INFO L445 BasicCegarLoop]: Path program histogram: [12, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:08,985 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:55:08,986 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:55:09,053 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-27 22:55:09,053 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-27 22:55:09,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:55:09 BasicIcfg [2024-06-27 22:55:09,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:55:09,054 INFO L158 Benchmark]: Toolchain (without parser) took 46045.74ms. Allocated memory was 136.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 106.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 290.0MB. Max. memory is 16.1GB. [2024-06-27 22:55:09,054 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:55:09,054 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 136.3MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:55:09,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.87ms. Allocated memory is still 172.0MB. Free memory was 143.7MB in the beginning and 111.2MB in the end (delta: 32.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-06-27 22:55:09,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.56ms. Allocated memory is still 172.0MB. Free memory was 111.2MB in the beginning and 108.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:55:09,055 INFO L158 Benchmark]: Boogie Preprocessor took 70.65ms. Allocated memory is still 172.0MB. Free memory was 108.0MB in the beginning and 103.7MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:55:09,055 INFO L158 Benchmark]: RCFGBuilder took 721.92ms. Allocated memory is still 172.0MB. Free memory was 103.7MB in the beginning and 117.1MB in the end (delta: -13.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-06-27 22:55:09,055 INFO L158 Benchmark]: TraceAbstraction took 44602.81ms. Allocated memory was 172.0MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 117.1MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 264.3MB. Max. memory is 16.1GB. [2024-06-27 22:55:09,056 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.11ms. Allocated memory is still 136.3MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.87ms. Allocated memory is still 172.0MB. Free memory was 143.7MB in the beginning and 111.2MB in the end (delta: 32.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.56ms. Allocated memory is still 172.0MB. Free memory was 111.2MB in the beginning and 108.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.65ms. Allocated memory is still 172.0MB. Free memory was 108.0MB in the beginning and 103.7MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 721.92ms. Allocated memory is still 172.0MB. Free memory was 103.7MB in the beginning and 117.1MB in the end (delta: -13.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44602.81ms. Allocated memory was 172.0MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 117.1MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 264.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L852] 0 //@ assert (!multithreaded || ((((((((((((((0LL - (long long) x$r_buff0_thd3) + (long long) x$w_buff0) >= 0LL) && (((0LL - (long long) x$r_buff1_thd3) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd3) + (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff0_thd3 - (long long) x$r_buff1_thd3) >= 0LL)) && (((long long) x$r_buff0_thd3 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd3 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd3 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L854] 0 //@ assert (!multithreaded || ((((((((((((((0LL - (long long) x$r_buff0_thd3) + (long long) x$w_buff0) >= 0LL) && (((0LL - (long long) x$r_buff1_thd3) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd3) + (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff0_thd3 - (long long) x$r_buff1_thd3) >= 0LL)) && (((long long) x$r_buff0_thd3 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd3 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd3 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L855] 0 //@ assert (!multithreaded || ((((((((((((((0LL - (long long) x$r_buff0_thd3) + (long long) x$w_buff0) >= 0LL) && (((0LL - (long long) x$r_buff1_thd3) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd3) + (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff0_thd3 - (long long) x$r_buff1_thd3) >= 0LL)) && (((long long) x$r_buff0_thd3 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd3 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd3 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 75 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 44.4s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 29.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2279 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2088 mSDsluCounter, 1056 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 965 mSDsCounter, 430 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8423 IncrementalHoareTripleChecker+Invalid, 8853 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 430 mSolverCounterUnsat, 91 mSDtfsCounter, 8423 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1888occurred in iteration=16, InterpolantAutomatonStates: 246, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 818 NumberOfCodeBlocks, 818 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 754 ConstructedInterpolants, 0 QuantifiedInterpolants, 11324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 22:55:09,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE