./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/protection/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.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 18:38:04,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:38:04,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:38:04,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:38:04,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:38:04,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:38:04,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:38:04,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:38:04,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:38:04,631 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:38:04,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:38:04,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:38:04,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:38:04,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:38:04,634 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:38:04,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:38:04,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:38:04,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:38:04,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:38:04,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:38:04,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:38:04,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:38:04,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:38:04,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:38:04,637 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:38:04,637 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:38:04,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:38:04,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:38:04,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:38:04,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:38:04,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:38:04,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:38:04,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:38:04,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:38:04,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:38:04,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:38:04,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:38:04,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:38:04,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:38:04,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:38:04,641 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:38:04,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:38:04,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:38:04,642 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 18:38:04,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:38:04,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:38:04,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:38:04,975 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:38:04,988 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:38:04,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-27 18:38:06,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:38:06,454 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:38:06,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-27 18:38:06,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38b1efdcb/77a62956ec4b445b8dc6d3a5976f960d/FLAG710b9e8d3 [2024-06-27 18:38:06,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38b1efdcb/77a62956ec4b445b8dc6d3a5976f960d [2024-06-27 18:38:06,488 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:38:06,488 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:38:06,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 18:38:06,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:38:06,624 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:38:06,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:38:06,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:38:06,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:38:06,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:38:06" (1/2) ... [2024-06-27 18:38:06,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372d1b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:38:06, skipping insertion in model container [2024-06-27 18:38:06,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:38:06" (1/2) ... [2024-06-27 18:38:06,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f1a74a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:38:06, skipping insertion in model container [2024-06-27 18:38:06,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:38:06" (2/2) ... [2024-06-27 18:38:06,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372d1b15 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:06, skipping insertion in model container [2024-06-27 18:38:06,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:38:06" (2/2) ... [2024-06-27 18:38:06,635 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:38:06,703 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:38:06,705 INFO L97 edCorrectnessWitness]: Location invariant before [L808-L808] (((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1)) [2024-06-27 18:38:06,705 INFO L97 edCorrectnessWitness]: Location invariant before [L809-L809] (((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1)) [2024-06-27 18:38:06,705 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:38:06,705 INFO L106 edCorrectnessWitness]: ghost_update [L806-L806] multithreaded = 1; [2024-06-27 18:38:06,754 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:38:06,951 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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2024-06-27 18:38:07,168 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:38:07,184 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 18:38:07,222 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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:38:07,296 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:38:07,330 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:38:07,330 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07 WrapperNode [2024-06-27 18:38:07,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:38:07,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:38:07,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:38:07,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:38:07,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (1/1) ... [2024-06-27 18:38:07,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (1/1) ... [2024-06-27 18:38:07,385 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 108 [2024-06-27 18:38:07,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:38:07,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:38:07,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:38:07,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:38:07,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (1/1) ... [2024-06-27 18:38:07,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (1/1) ... [2024-06-27 18:38:07,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (1/1) ... [2024-06-27 18:38:07,429 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 18:38:07,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (1/1) ... [2024-06-27 18:38:07,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (1/1) ... [2024-06-27 18:38:07,438 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (1/1) ... [2024-06-27 18:38:07,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (1/1) ... [2024-06-27 18:38:07,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (1/1) ... [2024-06-27 18:38:07,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (1/1) ... [2024-06-27 18:38:07,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:38:07,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:38:07,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:38:07,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:38:07,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (1/1) ... [2024-06-27 18:38:07,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:38:07,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:38:07,486 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 18:38:07,487 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 18:38:07,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:38:07,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:38:07,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 18:38:07,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 18:38:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 18:38:07,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 18:38:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:38:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:38:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:38:07,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:38:07,515 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 18:38:07,631 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:38:07,633 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:38:07,967 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:38:07,968 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:38:08,155 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:38:08,156 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 18:38:08,157 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:38:08 BoogieIcfgContainer [2024-06-27 18:38:08,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:38:08,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:38:08,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:38:08,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:38:08,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:38:06" (1/4) ... [2024-06-27 18:38:08,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f33ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:38:08, skipping insertion in model container [2024-06-27 18:38:08,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:38:06" (2/4) ... [2024-06-27 18:38:08,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f33ac1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:38:08, skipping insertion in model container [2024-06-27 18:38:08,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:38:07" (3/4) ... [2024-06-27 18:38:08,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f33ac1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:38:08, skipping insertion in model container [2024-06-27 18:38:08,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:38:08" (4/4) ... [2024-06-27 18:38:08,168 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-27 18:38:08,186 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:38:08,186 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 18:38:08,186 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:38:08,260 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:38:08,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 18:38:08,399 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-27 18:38:08,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:38:08,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-06-27 18:38:08,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 18:38:08,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 33 transitions, 72 flow [2024-06-27 18:38:08,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:38:08,422 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;@3bef9247, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:38:08,422 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 18:38:08,426 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:38:08,426 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 18:38:08,426 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:38:08,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:08,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:38:08,427 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:08,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash 305573774, now seen corresponding path program 1 times [2024-06-27 18:38:08,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:08,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263792123] [2024-06-27 18:38:08,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:08,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:08,808 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 18:38:08,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263792123] [2024-06-27 18:38:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263792123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:08,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:08,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:38:08,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501326892] [2024-06-27 18:38:08,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:08,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:38:08,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:38:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:38:08,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2024-06-27 18:38:08,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:38:08,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:08,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2024-06-27 18:38:08,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:09,047 INFO L124 PetriNetUnfolderBase]: 138/344 cut-off events. [2024-06-27 18:38:09,050 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 18:38:09,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 344 events. 138/344 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1691 event pairs, 95 based on Foata normal form. 16/340 useless extension candidates. Maximal degree in co-relation 594. Up to 205 conditions per place. [2024-06-27 18:38:09,055 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 23 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2024-06-27 18:38:09,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 147 flow [2024-06-27 18:38:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:38:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:38:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-06-27 18:38:09,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7714285714285715 [2024-06-27 18:38:09,071 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 81 transitions. [2024-06-27 18:38:09,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 147 flow [2024-06-27 18:38:09,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:38:09,076 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2024-06-27 18:38:09,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-27 18:38:09,083 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2024-06-27 18:38:09,083 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2024-06-27 18:38:09,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:38:09,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:09,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:38:09,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:38:09,085 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:09,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:09,086 INFO L85 PathProgramCache]: Analyzing trace with hash 305573616, now seen corresponding path program 1 times [2024-06-27 18:38:09,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:09,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856240367] [2024-06-27 18:38:09,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:09,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:09,642 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 18:38:09,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:09,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856240367] [2024-06-27 18:38:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856240367] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:09,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:09,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:38:09,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003788656] [2024-06-27 18:38:09,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:09,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:38:09,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:09,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:38:09,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:38:09,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 18:38:09,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 18:38:09,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:09,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 18:38:09,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:09,841 INFO L124 PetriNetUnfolderBase]: 342/590 cut-off events. [2024-06-27 18:38:09,841 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-06-27 18:38:09,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 590 events. 342/590 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2694 event pairs, 157 based on Foata normal form. 1/584 useless extension candidates. Maximal degree in co-relation 1216. Up to 573 conditions per place. [2024-06-27 18:38:09,849 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 27 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2024-06-27 18:38:09,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 150 flow [2024-06-27 18:38:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:38:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:38:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-06-27 18:38:09,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-06-27 18:38:09,855 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 65 transitions. [2024-06-27 18:38:09,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 150 flow [2024-06-27 18:38:09,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:38:09,858 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 85 flow [2024-06-27 18:38:09,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-06-27 18:38:09,859 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2024-06-27 18:38:09,859 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 85 flow [2024-06-27 18:38:09,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 18:38:09,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:09,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:09,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:38:09,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:09,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1598624388, now seen corresponding path program 1 times [2024-06-27 18:38:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644267195] [2024-06-27 18:38:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:10,336 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 18:38:10,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644267195] [2024-06-27 18:38:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644267195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:10,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:10,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:38:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351064221] [2024-06-27 18:38:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:10,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:38:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:38:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:38:10,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 18:38:10,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 18:38:10,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:10,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 18:38:10,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:10,529 INFO L124 PetriNetUnfolderBase]: 342/730 cut-off events. [2024-06-27 18:38:10,529 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2024-06-27 18:38:10,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 730 events. 342/730 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3821 event pairs, 218 based on Foata normal form. 2/696 useless extension candidates. Maximal degree in co-relation 1443. Up to 562 conditions per place. [2024-06-27 18:38:10,534 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 34 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2024-06-27 18:38:10,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 211 flow [2024-06-27 18:38:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:38:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:38:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-06-27 18:38:10,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 18:38:10,539 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 85 flow. Second operand 4 states and 84 transitions. [2024-06-27 18:38:10,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 211 flow [2024-06-27 18:38:10,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:38:10,541 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 131 flow [2024-06-27 18:38:10,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-27 18:38:10,542 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2024-06-27 18:38:10,543 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 131 flow [2024-06-27 18:38:10,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 18:38:10,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:10,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:10,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:38:10,544 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:10,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:10,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1982251077, now seen corresponding path program 1 times [2024-06-27 18:38:10,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:10,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123376620] [2024-06-27 18:38:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:10,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:10,955 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 18:38:10,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:10,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123376620] [2024-06-27 18:38:10,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123376620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:10,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:10,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:38:10,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907324460] [2024-06-27 18:38:10,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:10,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:38:10,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:10,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:38:10,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:38:10,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 18:38:10,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 18:38:10,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:10,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 18:38:10,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:11,228 INFO L124 PetriNetUnfolderBase]: 422/848 cut-off events. [2024-06-27 18:38:11,229 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2024-06-27 18:38:11,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897 conditions, 848 events. 422/848 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4580 event pairs, 154 based on Foata normal form. 5/814 useless extension candidates. Maximal degree in co-relation 1882. Up to 557 conditions per place. [2024-06-27 18:38:11,236 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 49 selfloop transitions, 13 changer transitions 0/71 dead transitions. [2024-06-27 18:38:11,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 351 flow [2024-06-27 18:38:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:38:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:38:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-06-27 18:38:11,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6514285714285715 [2024-06-27 18:38:11,240 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 131 flow. Second operand 5 states and 114 transitions. [2024-06-27 18:38:11,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 351 flow [2024-06-27 18:38:11,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 344 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 18:38:11,245 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 214 flow [2024-06-27 18:38:11,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2024-06-27 18:38:11,247 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2024-06-27 18:38:11,247 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 214 flow [2024-06-27 18:38:11,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 18:38:11,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:11,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:11,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:38:11,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:11,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:11,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1458768915, now seen corresponding path program 1 times [2024-06-27 18:38:11,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:11,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087099420] [2024-06-27 18:38:11,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:11,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:11,887 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 18:38:11,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:11,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087099420] [2024-06-27 18:38:11,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087099420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:11,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:11,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:38:11,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923030547] [2024-06-27 18:38:11,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:11,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:38:11,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:11,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:38:11,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:38:11,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 18:38:11,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 18:38:11,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:11,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 18:38:11,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:12,234 INFO L124 PetriNetUnfolderBase]: 432/782 cut-off events. [2024-06-27 18:38:12,239 INFO L125 PetriNetUnfolderBase]: For 802/802 co-relation queries the response was YES. [2024-06-27 18:38:12,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 782 events. 432/782 cut-off events. For 802/802 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3978 event pairs, 90 based on Foata normal form. 3/772 useless extension candidates. Maximal degree in co-relation 2294. Up to 597 conditions per place. [2024-06-27 18:38:12,248 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 60 selfloop transitions, 21 changer transitions 0/90 dead transitions. [2024-06-27 18:38:12,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 90 transitions, 546 flow [2024-06-27 18:38:12,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:38:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:38:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-06-27 18:38:12,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-06-27 18:38:12,250 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 214 flow. Second operand 6 states and 132 transitions. [2024-06-27 18:38:12,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 90 transitions, 546 flow [2024-06-27 18:38:12,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 90 transitions, 542 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 18:38:12,260 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 380 flow [2024-06-27 18:38:12,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2024-06-27 18:38:12,265 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2024-06-27 18:38:12,266 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 380 flow [2024-06-27 18:38:12,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 18:38:12,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:12,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:12,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:38:12,267 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:12,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:12,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2022209754, now seen corresponding path program 1 times [2024-06-27 18:38:12,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:12,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647727990] [2024-06-27 18:38:12,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:12,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:12,927 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 18:38:12,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:12,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647727990] [2024-06-27 18:38:12,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647727990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:12,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:12,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:38:12,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415399136] [2024-06-27 18:38:12,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:12,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:38:12,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:12,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:38:12,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:38:13,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 18:38:13,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 18:38:13,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:13,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 18:38:13,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:13,326 INFO L124 PetriNetUnfolderBase]: 442/800 cut-off events. [2024-06-27 18:38:13,326 INFO L125 PetriNetUnfolderBase]: For 1525/1525 co-relation queries the response was YES. [2024-06-27 18:38:13,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 800 events. 442/800 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4100 event pairs, 50 based on Foata normal form. 6/793 useless extension candidates. Maximal degree in co-relation 2784. Up to 565 conditions per place. [2024-06-27 18:38:13,333 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 63 selfloop transitions, 23 changer transitions 0/95 dead transitions. [2024-06-27 18:38:13,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 95 transitions, 668 flow [2024-06-27 18:38:13,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:38:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:38:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-27 18:38:13,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6040816326530613 [2024-06-27 18:38:13,335 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 380 flow. Second operand 7 states and 148 transitions. [2024-06-27 18:38:13,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 95 transitions, 668 flow [2024-06-27 18:38:13,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 95 transitions, 658 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-27 18:38:13,341 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 433 flow [2024-06-27 18:38:13,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=433, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2024-06-27 18:38:13,342 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2024-06-27 18:38:13,342 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 433 flow [2024-06-27 18:38:13,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 18:38:13,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:13,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:13,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:38:13,343 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:13,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2007226518, now seen corresponding path program 1 times [2024-06-27 18:38:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:13,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806332975] [2024-06-27 18:38:13,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:13,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:13,730 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 18:38:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806332975] [2024-06-27 18:38:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806332975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:13,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:13,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:38:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090997361] [2024-06-27 18:38:13,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:13,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:38:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:13,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:38:13,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:38:13,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:13,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 433 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 18:38:13,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:13,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:13,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:14,078 INFO L124 PetriNetUnfolderBase]: 515/1024 cut-off events. [2024-06-27 18:38:14,079 INFO L125 PetriNetUnfolderBase]: For 2206/2206 co-relation queries the response was YES. [2024-06-27 18:38:14,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3498 conditions, 1024 events. 515/1024 cut-off events. For 2206/2206 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5620 event pairs, 137 based on Foata normal form. 3/986 useless extension candidates. Maximal degree in co-relation 3469. Up to 815 conditions per place. [2024-06-27 18:38:14,090 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 59 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2024-06-27 18:38:14,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 615 flow [2024-06-27 18:38:14,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:38:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:38:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-27 18:38:14,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-06-27 18:38:14,093 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 433 flow. Second operand 5 states and 87 transitions. [2024-06-27 18:38:14,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 615 flow [2024-06-27 18:38:14,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 560 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 18:38:14,102 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 422 flow [2024-06-27 18:38:14,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2024-06-27 18:38:14,104 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2024-06-27 18:38:14,104 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 422 flow [2024-06-27 18:38:14,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 18:38:14,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:14,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:14,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:38:14,105 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:14,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:14,105 INFO L85 PathProgramCache]: Analyzing trace with hash -504118926, now seen corresponding path program 1 times [2024-06-27 18:38:14,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:14,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056568803] [2024-06-27 18:38:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:14,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:14,612 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 18:38:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056568803] [2024-06-27 18:38:14,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056568803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:14,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:14,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:38:14,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212978212] [2024-06-27 18:38:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:14,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:38:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:14,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:38:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:38:14,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:14,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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 18:38:14,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:14,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:14,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:14,940 INFO L124 PetriNetUnfolderBase]: 542/1051 cut-off events. [2024-06-27 18:38:14,941 INFO L125 PetriNetUnfolderBase]: For 2248/2248 co-relation queries the response was YES. [2024-06-27 18:38:14,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3575 conditions, 1051 events. 542/1051 cut-off events. For 2248/2248 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5651 event pairs, 123 based on Foata normal form. 6/1014 useless extension candidates. Maximal degree in co-relation 3544. Up to 683 conditions per place. [2024-06-27 18:38:14,951 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 66 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2024-06-27 18:38:14,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 706 flow [2024-06-27 18:38:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:38:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:38:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-06-27 18:38:14,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-27 18:38:14,953 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 422 flow. Second operand 6 states and 112 transitions. [2024-06-27 18:38:14,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 706 flow [2024-06-27 18:38:14,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 686 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 18:38:14,959 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 478 flow [2024-06-27 18:38:14,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-06-27 18:38:14,960 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 27 predicate places. [2024-06-27 18:38:14,960 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 478 flow [2024-06-27 18:38:14,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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 18:38:14,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:14,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:14,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:38:14,961 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:14,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash 504388884, now seen corresponding path program 2 times [2024-06-27 18:38:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:14,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832063905] [2024-06-27 18:38:14,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:14,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:15,411 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 18:38:15,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:15,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832063905] [2024-06-27 18:38:15,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832063905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:15,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:15,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:38:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741966917] [2024-06-27 18:38:15,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:15,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:38:15,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:38:15,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:38:15,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:15,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 478 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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 18:38:15,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:15,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:15,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:15,739 INFO L124 PetriNetUnfolderBase]: 531/1055 cut-off events. [2024-06-27 18:38:15,739 INFO L125 PetriNetUnfolderBase]: For 2543/2543 co-relation queries the response was YES. [2024-06-27 18:38:15,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 1055 events. 531/1055 cut-off events. For 2543/2543 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5858 event pairs, 165 based on Foata normal form. 3/1015 useless extension candidates. Maximal degree in co-relation 3623. Up to 834 conditions per place. [2024-06-27 18:38:15,748 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 64 selfloop transitions, 11 changer transitions 0/82 dead transitions. [2024-06-27 18:38:15,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 82 transitions, 671 flow [2024-06-27 18:38:15,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:38:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:38:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-27 18:38:15,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-27 18:38:15,750 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 478 flow. Second operand 6 states and 101 transitions. [2024-06-27 18:38:15,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 82 transitions, 671 flow [2024-06-27 18:38:15,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 648 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 18:38:15,757 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 483 flow [2024-06-27 18:38:15,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=483, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2024-06-27 18:38:15,758 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2024-06-27 18:38:15,758 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 483 flow [2024-06-27 18:38:15,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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 18:38:15,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:15,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:15,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 18:38:15,761 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:15,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash 214679785, now seen corresponding path program 1 times [2024-06-27 18:38:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:15,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550504767] [2024-06-27 18:38:15,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:16,586 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 18:38:16,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:16,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550504767] [2024-06-27 18:38:16,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550504767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:16,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:16,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:38:16,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224506157] [2024-06-27 18:38:16,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:16,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:38:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:16,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:38:16,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:38:16,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:16,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 483 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 18:38:16,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:16,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:16,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:17,056 INFO L124 PetriNetUnfolderBase]: 533/1059 cut-off events. [2024-06-27 18:38:17,056 INFO L125 PetriNetUnfolderBase]: For 2719/2719 co-relation queries the response was YES. [2024-06-27 18:38:17,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3657 conditions, 1059 events. 533/1059 cut-off events. For 2719/2719 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5873 event pairs, 139 based on Foata normal form. 2/1018 useless extension candidates. Maximal degree in co-relation 3624. Up to 831 conditions per place. [2024-06-27 18:38:17,065 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 70 selfloop transitions, 13 changer transitions 0/90 dead transitions. [2024-06-27 18:38:17,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 727 flow [2024-06-27 18:38:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:38:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:38:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-27 18:38:17,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2024-06-27 18:38:17,067 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 483 flow. Second operand 7 states and 116 transitions. [2024-06-27 18:38:17,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 727 flow [2024-06-27 18:38:17,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 90 transitions, 675 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 18:38:17,076 INFO L231 Difference]: Finished difference. Result has 71 places, 71 transitions, 510 flow [2024-06-27 18:38:17,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=510, PETRI_PLACES=71, PETRI_TRANSITIONS=71} [2024-06-27 18:38:17,076 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2024-06-27 18:38:17,077 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 510 flow [2024-06-27 18:38:17,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 18:38:17,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:17,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:17,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 18:38:17,077 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:17,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1758190160, now seen corresponding path program 1 times [2024-06-27 18:38:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:17,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031549833] [2024-06-27 18:38:17,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:18,124 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 18:38:18,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:18,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031549833] [2024-06-27 18:38:18,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031549833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:18,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:18,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:38:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097379910] [2024-06-27 18:38:18,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:18,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:38:18,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:18,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:38:18,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:38:18,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:18,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 510 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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 18:38:18,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:18,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:18,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:18,584 INFO L124 PetriNetUnfolderBase]: 530/1058 cut-off events. [2024-06-27 18:38:18,585 INFO L125 PetriNetUnfolderBase]: For 2606/2606 co-relation queries the response was YES. [2024-06-27 18:38:18,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3713 conditions, 1058 events. 530/1058 cut-off events. For 2606/2606 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5893 event pairs, 138 based on Foata normal form. 2/1015 useless extension candidates. Maximal degree in co-relation 3679. Up to 814 conditions per place. [2024-06-27 18:38:18,594 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 71 selfloop transitions, 15 changer transitions 0/93 dead transitions. [2024-06-27 18:38:18,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 93 transitions, 734 flow [2024-06-27 18:38:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:38:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:38:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-27 18:38:18,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-06-27 18:38:18,595 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 510 flow. Second operand 7 states and 117 transitions. [2024-06-27 18:38:18,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 93 transitions, 734 flow [2024-06-27 18:38:18,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 93 transitions, 695 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 18:38:18,603 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 506 flow [2024-06-27 18:38:18,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=506, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2024-06-27 18:38:18,604 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2024-06-27 18:38:18,604 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 506 flow [2024-06-27 18:38:18,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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 18:38:18,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:18,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:18,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 18:38:18,605 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:18,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:18,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1695430287, now seen corresponding path program 1 times [2024-06-27 18:38:18,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:18,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216959347] [2024-06-27 18:38:18,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:18,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:19,232 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 18:38:19,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:19,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216959347] [2024-06-27 18:38:19,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216959347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:19,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:19,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:38:19,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37753535] [2024-06-27 18:38:19,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:19,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:38:19,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:19,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:38:19,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:38:19,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:19,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 506 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 18:38:19,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:19,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:19,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:19,619 INFO L124 PetriNetUnfolderBase]: 541/964 cut-off events. [2024-06-27 18:38:19,619 INFO L125 PetriNetUnfolderBase]: For 2766/2766 co-relation queries the response was YES. [2024-06-27 18:38:19,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3641 conditions, 964 events. 541/964 cut-off events. For 2766/2766 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4894 event pairs, 90 based on Foata normal form. 1/949 useless extension candidates. Maximal degree in co-relation 3606. Up to 721 conditions per place. [2024-06-27 18:38:19,627 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 76 selfloop transitions, 21 changer transitions 0/104 dead transitions. [2024-06-27 18:38:19,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 104 transitions, 826 flow [2024-06-27 18:38:19,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:38:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:38:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-27 18:38:19,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-27 18:38:19,629 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 506 flow. Second operand 7 states and 128 transitions. [2024-06-27 18:38:19,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 104 transitions, 826 flow [2024-06-27 18:38:19,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 104 transitions, 777 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 18:38:19,636 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 532 flow [2024-06-27 18:38:19,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=68, 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=7, PETRI_FLOW=532, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2024-06-27 18:38:19,637 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 36 predicate places. [2024-06-27 18:38:19,637 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 532 flow [2024-06-27 18:38:19,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 18:38:19,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:19,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:19,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 18:38:19,638 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:19,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1566388385, now seen corresponding path program 2 times [2024-06-27 18:38:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:19,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102397235] [2024-06-27 18:38:19,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:19,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:20,255 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 18:38:20,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:20,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102397235] [2024-06-27 18:38:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102397235] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:20,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:20,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:38:20,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720959481] [2024-06-27 18:38:20,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:20,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:38:20,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:20,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:38:20,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:38:20,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:20,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 532 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 18:38:20,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:20,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:20,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:20,598 INFO L124 PetriNetUnfolderBase]: 542/958 cut-off events. [2024-06-27 18:38:20,599 INFO L125 PetriNetUnfolderBase]: For 2786/2786 co-relation queries the response was YES. [2024-06-27 18:38:20,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3729 conditions, 958 events. 542/958 cut-off events. For 2786/2786 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4830 event pairs, 80 based on Foata normal form. 1/944 useless extension candidates. Maximal degree in co-relation 3695. Up to 764 conditions per place. [2024-06-27 18:38:20,607 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 72 selfloop transitions, 23 changer transitions 0/102 dead transitions. [2024-06-27 18:38:20,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 102 transitions, 813 flow [2024-06-27 18:38:20,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:38:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:38:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-27 18:38:20,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-06-27 18:38:20,609 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 532 flow. Second operand 7 states and 124 transitions. [2024-06-27 18:38:20,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 102 transitions, 813 flow [2024-06-27 18:38:20,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 102 transitions, 785 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 18:38:20,618 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 586 flow [2024-06-27 18:38:20,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=586, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2024-06-27 18:38:20,618 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 41 predicate places. [2024-06-27 18:38:20,619 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 586 flow [2024-06-27 18:38:20,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 18:38:20,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:20,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:20,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 18:38:20,620 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:20,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash -613355444, now seen corresponding path program 1 times [2024-06-27 18:38:20,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:20,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662528687] [2024-06-27 18:38:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:20,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:21,328 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 18:38:21,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662528687] [2024-06-27 18:38:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662528687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:21,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:21,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:38:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643158798] [2024-06-27 18:38:21,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:21,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:38:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:21,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:38:21,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:38:21,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:21,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 586 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 18:38:21,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:21,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:21,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:21,736 INFO L124 PetriNetUnfolderBase]: 544/1023 cut-off events. [2024-06-27 18:38:21,736 INFO L125 PetriNetUnfolderBase]: For 3027/3027 co-relation queries the response was YES. [2024-06-27 18:38:21,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3929 conditions, 1023 events. 544/1023 cut-off events. For 3027/3027 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5468 event pairs, 106 based on Foata normal form. 2/991 useless extension candidates. Maximal degree in co-relation 3892. Up to 629 conditions per place. [2024-06-27 18:38:21,744 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 74 selfloop transitions, 26 changer transitions 0/107 dead transitions. [2024-06-27 18:38:21,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 107 transitions, 899 flow [2024-06-27 18:38:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:38:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:38:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-27 18:38:21,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-06-27 18:38:21,746 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 586 flow. Second operand 6 states and 116 transitions. [2024-06-27 18:38:21,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 107 transitions, 899 flow [2024-06-27 18:38:21,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 107 transitions, 856 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 18:38:21,755 INFO L231 Difference]: Finished difference. Result has 82 places, 79 transitions, 630 flow [2024-06-27 18:38:21,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=82, PETRI_TRANSITIONS=79} [2024-06-27 18:38:21,756 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 43 predicate places. [2024-06-27 18:38:21,756 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 630 flow [2024-06-27 18:38:21,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 18:38:21,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:21,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:21,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 18:38:21,757 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:21,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1176361970, now seen corresponding path program 1 times [2024-06-27 18:38:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:21,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716887564] [2024-06-27 18:38:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:21,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:22,397 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 18:38:22,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:22,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716887564] [2024-06-27 18:38:22,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716887564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:22,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:22,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:38:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456728555] [2024-06-27 18:38:22,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:22,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:38:22,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:22,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:38:22,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:38:22,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:22,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 630 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:22,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:22,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:22,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:22,864 INFO L124 PetriNetUnfolderBase]: 560/998 cut-off events. [2024-06-27 18:38:22,864 INFO L125 PetriNetUnfolderBase]: For 4012/4012 co-relation queries the response was YES. [2024-06-27 18:38:22,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4172 conditions, 998 events. 560/998 cut-off events. For 4012/4012 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5158 event pairs, 51 based on Foata normal form. 2/984 useless extension candidates. Maximal degree in co-relation 4134. Up to 638 conditions per place. [2024-06-27 18:38:22,882 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 84 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2024-06-27 18:38:22,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 116 transitions, 986 flow [2024-06-27 18:38:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 18:38:22,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2024-06-27 18:38:22,884 INFO L175 Difference]: Start difference. First operand has 82 places, 79 transitions, 630 flow. Second operand 8 states and 143 transitions. [2024-06-27 18:38:22,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 116 transitions, 986 flow [2024-06-27 18:38:22,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 116 transitions, 942 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 18:38:22,896 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 650 flow [2024-06-27 18:38:22,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=650, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2024-06-27 18:38:22,898 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2024-06-27 18:38:22,898 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 650 flow [2024-06-27 18:38:22,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:22,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:22,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:22,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 18:38:22,898 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:22,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1176364760, now seen corresponding path program 2 times [2024-06-27 18:38:22,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:22,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008253535] [2024-06-27 18:38:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:23,632 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 18:38:23,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:23,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008253535] [2024-06-27 18:38:23,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008253535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:23,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:23,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:38:23,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130549664] [2024-06-27 18:38:23,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:23,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:38:23,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:23,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:38:23,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:38:23,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:23,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 650 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:23,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:23,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:23,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:24,127 INFO L124 PetriNetUnfolderBase]: 576/1026 cut-off events. [2024-06-27 18:38:24,127 INFO L125 PetriNetUnfolderBase]: For 4284/4284 co-relation queries the response was YES. [2024-06-27 18:38:24,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4362 conditions, 1026 events. 576/1026 cut-off events. For 4284/4284 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5315 event pairs, 91 based on Foata normal form. 2/1012 useless extension candidates. Maximal degree in co-relation 4323. Up to 759 conditions per place. [2024-06-27 18:38:24,136 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 85 selfloop transitions, 23 changer transitions 0/115 dead transitions. [2024-06-27 18:38:24,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 115 transitions, 976 flow [2024-06-27 18:38:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 18:38:24,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2024-06-27 18:38:24,138 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 650 flow. Second operand 8 states and 143 transitions. [2024-06-27 18:38:24,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 115 transitions, 976 flow [2024-06-27 18:38:24,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 115 transitions, 919 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 18:38:24,152 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 657 flow [2024-06-27 18:38:24,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=657, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2024-06-27 18:38:24,153 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2024-06-27 18:38:24,153 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 657 flow [2024-06-27 18:38:24,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:24,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:24,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:24,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 18:38:24,154 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:24,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:24,154 INFO L85 PathProgramCache]: Analyzing trace with hash -12255260, now seen corresponding path program 1 times [2024-06-27 18:38:24,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:24,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668606199] [2024-06-27 18:38:24,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:24,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:25,038 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 18:38:25,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:25,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668606199] [2024-06-27 18:38:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668606199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:25,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:25,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:38:25,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082809921] [2024-06-27 18:38:25,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:25,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:38:25,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:25,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:38:25,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:38:25,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:25,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 657 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:25,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:25,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:25,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:25,556 INFO L124 PetriNetUnfolderBase]: 598/1092 cut-off events. [2024-06-27 18:38:25,556 INFO L125 PetriNetUnfolderBase]: For 4594/4594 co-relation queries the response was YES. [2024-06-27 18:38:25,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4468 conditions, 1092 events. 598/1092 cut-off events. For 4594/4594 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5847 event pairs, 85 based on Foata normal form. 2/1069 useless extension candidates. Maximal degree in co-relation 4428. Up to 512 conditions per place. [2024-06-27 18:38:25,565 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 86 selfloop transitions, 33 changer transitions 0/126 dead transitions. [2024-06-27 18:38:25,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 126 transitions, 1091 flow [2024-06-27 18:38:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 18:38:25,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5392857142857143 [2024-06-27 18:38:25,567 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 657 flow. Second operand 8 states and 151 transitions. [2024-06-27 18:38:25,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 126 transitions, 1091 flow [2024-06-27 18:38:25,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 126 transitions, 1045 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-27 18:38:25,586 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 758 flow [2024-06-27 18:38:25,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=758, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-06-27 18:38:25,587 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2024-06-27 18:38:25,587 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 758 flow [2024-06-27 18:38:25,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:25,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:25,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:25,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 18:38:25,588 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:25,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1179166044, now seen corresponding path program 2 times [2024-06-27 18:38:25,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:25,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769915702] [2024-06-27 18:38:25,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:25,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:26,551 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 18:38:26,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:26,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769915702] [2024-06-27 18:38:26,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769915702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:26,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:26,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:38:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392114355] [2024-06-27 18:38:26,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:26,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:38:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:26,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:38:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:38:26,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:26,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 758 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:26,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:26,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:26,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:27,051 INFO L124 PetriNetUnfolderBase]: 620/1168 cut-off events. [2024-06-27 18:38:27,051 INFO L125 PetriNetUnfolderBase]: For 5435/5435 co-relation queries the response was YES. [2024-06-27 18:38:27,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4906 conditions, 1168 events. 620/1168 cut-off events. For 5435/5435 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6441 event pairs, 121 based on Foata normal form. 2/1130 useless extension candidates. Maximal degree in co-relation 4864. Up to 791 conditions per place. [2024-06-27 18:38:27,060 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 96 selfloop transitions, 21 changer transitions 0/124 dead transitions. [2024-06-27 18:38:27,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 124 transitions, 1132 flow [2024-06-27 18:38:27,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 18:38:27,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 18:38:27,062 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 758 flow. Second operand 8 states and 144 transitions. [2024-06-27 18:38:27,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 124 transitions, 1132 flow [2024-06-27 18:38:27,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 124 transitions, 1098 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-27 18:38:27,081 INFO L231 Difference]: Finished difference. Result has 98 places, 90 transitions, 812 flow [2024-06-27 18:38:27,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=812, PETRI_PLACES=98, PETRI_TRANSITIONS=90} [2024-06-27 18:38:27,081 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2024-06-27 18:38:27,082 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 90 transitions, 812 flow [2024-06-27 18:38:27,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:27,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:27,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:27,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 18:38:27,082 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:27,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:27,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1179161394, now seen corresponding path program 3 times [2024-06-27 18:38:27,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:27,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096407000] [2024-06-27 18:38:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:27,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:27,885 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 18:38:27,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:27,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096407000] [2024-06-27 18:38:27,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096407000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:27,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:27,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:38:27,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377772583] [2024-06-27 18:38:27,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:27,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:38:27,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:27,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:38:27,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:38:27,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:27,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 90 transitions, 812 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:27,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:27,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:27,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:28,394 INFO L124 PetriNetUnfolderBase]: 660/1166 cut-off events. [2024-06-27 18:38:28,394 INFO L125 PetriNetUnfolderBase]: For 6199/6199 co-relation queries the response was YES. [2024-06-27 18:38:28,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5283 conditions, 1166 events. 660/1166 cut-off events. For 6199/6199 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6186 event pairs, 74 based on Foata normal form. 2/1149 useless extension candidates. Maximal degree in co-relation 5238. Up to 676 conditions per place. [2024-06-27 18:38:28,405 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 84 selfloop transitions, 42 changer transitions 0/133 dead transitions. [2024-06-27 18:38:28,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 133 transitions, 1248 flow [2024-06-27 18:38:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 18:38:28,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-27 18:38:28,408 INFO L175 Difference]: Start difference. First operand has 98 places, 90 transitions, 812 flow. Second operand 8 states and 149 transitions. [2024-06-27 18:38:28,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 133 transitions, 1248 flow [2024-06-27 18:38:28,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 133 transitions, 1197 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 18:38:28,427 INFO L231 Difference]: Finished difference. Result has 102 places, 97 transitions, 946 flow [2024-06-27 18:38:28,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=946, PETRI_PLACES=102, PETRI_TRANSITIONS=97} [2024-06-27 18:38:28,428 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 63 predicate places. [2024-06-27 18:38:28,428 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 97 transitions, 946 flow [2024-06-27 18:38:28,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:28,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:28,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:28,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 18:38:28,429 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:28,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1289983790, now seen corresponding path program 3 times [2024-06-27 18:38:28,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:28,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828196799] [2024-06-27 18:38:28,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:28,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:29,066 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 18:38:29,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:29,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828196799] [2024-06-27 18:38:29,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828196799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:29,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:29,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:38:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168952960] [2024-06-27 18:38:29,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:29,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:38:29,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:29,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:38:29,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:38:29,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:29,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 97 transitions, 946 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:29,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:29,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:29,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:29,550 INFO L124 PetriNetUnfolderBase]: 657/1145 cut-off events. [2024-06-27 18:38:29,550 INFO L125 PetriNetUnfolderBase]: For 6642/6642 co-relation queries the response was YES. [2024-06-27 18:38:29,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5410 conditions, 1145 events. 657/1145 cut-off events. For 6642/6642 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6004 event pairs, 87 based on Foata normal form. 2/1132 useless extension candidates. Maximal degree in co-relation 5363. Up to 929 conditions per place. [2024-06-27 18:38:29,560 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 96 selfloop transitions, 25 changer transitions 0/128 dead transitions. [2024-06-27 18:38:29,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 128 transitions, 1278 flow [2024-06-27 18:38:29,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-27 18:38:29,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 18:38:29,562 INFO L175 Difference]: Start difference. First operand has 102 places, 97 transitions, 946 flow. Second operand 8 states and 140 transitions. [2024-06-27 18:38:29,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 128 transitions, 1278 flow [2024-06-27 18:38:29,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 128 transitions, 1213 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-27 18:38:29,586 INFO L231 Difference]: Finished difference. Result has 107 places, 97 transitions, 935 flow [2024-06-27 18:38:29,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=935, PETRI_PLACES=107, PETRI_TRANSITIONS=97} [2024-06-27 18:38:29,586 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 68 predicate places. [2024-06-27 18:38:29,587 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 97 transitions, 935 flow [2024-06-27 18:38:29,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:29,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:29,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:29,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 18:38:29,587 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:29,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:29,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1294452564, now seen corresponding path program 4 times [2024-06-27 18:38:29,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:29,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406433936] [2024-06-27 18:38:29,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:29,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:30,348 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 18:38:30,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:30,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406433936] [2024-06-27 18:38:30,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406433936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:30,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:30,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:38:30,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432814354] [2024-06-27 18:38:30,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:30,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:38:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:30,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:38:30,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:38:30,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:30,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 97 transitions, 935 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:30,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:30,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:30,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:30,904 INFO L124 PetriNetUnfolderBase]: 679/1195 cut-off events. [2024-06-27 18:38:30,904 INFO L125 PetriNetUnfolderBase]: For 6410/6410 co-relation queries the response was YES. [2024-06-27 18:38:30,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5637 conditions, 1195 events. 679/1195 cut-off events. For 6410/6410 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6409 event pairs, 72 based on Foata normal form. 2/1178 useless extension candidates. Maximal degree in co-relation 5588. Up to 675 conditions per place. [2024-06-27 18:38:30,913 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 90 selfloop transitions, 46 changer transitions 0/143 dead transitions. [2024-06-27 18:38:30,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 143 transitions, 1411 flow [2024-06-27 18:38:30,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-27 18:38:30,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5607142857142857 [2024-06-27 18:38:30,915 INFO L175 Difference]: Start difference. First operand has 107 places, 97 transitions, 935 flow. Second operand 8 states and 157 transitions. [2024-06-27 18:38:30,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 143 transitions, 1411 flow [2024-06-27 18:38:30,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 143 transitions, 1352 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-27 18:38:30,938 INFO L231 Difference]: Finished difference. Result has 109 places, 101 transitions, 1052 flow [2024-06-27 18:38:30,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1052, PETRI_PLACES=109, PETRI_TRANSITIONS=101} [2024-06-27 18:38:30,938 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 70 predicate places. [2024-06-27 18:38:30,939 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 101 transitions, 1052 flow [2024-06-27 18:38:30,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:30,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:30,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:30,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 18:38:30,939 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:30,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash 105837070, now seen corresponding path program 5 times [2024-06-27 18:38:30,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:30,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803944465] [2024-06-27 18:38:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:30,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:31,827 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 18:38:31,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:31,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803944465] [2024-06-27 18:38:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803944465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:31,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:38:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039796304] [2024-06-27 18:38:31,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:31,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:38:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:31,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:38:31,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:38:31,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:31,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 101 transitions, 1052 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:31,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:31,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:31,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:32,377 INFO L124 PetriNetUnfolderBase]: 723/1358 cut-off events. [2024-06-27 18:38:32,377 INFO L125 PetriNetUnfolderBase]: For 7901/7901 co-relation queries the response was YES. [2024-06-27 18:38:32,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6427 conditions, 1358 events. 723/1358 cut-off events. For 7901/7901 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7830 event pairs, 133 based on Foata normal form. 2/1311 useless extension candidates. Maximal degree in co-relation 6376. Up to 936 conditions per place. [2024-06-27 18:38:32,387 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 111 selfloop transitions, 25 changer transitions 0/143 dead transitions. [2024-06-27 18:38:32,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 143 transitions, 1502 flow [2024-06-27 18:38:32,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 18:38:32,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-27 18:38:32,389 INFO L175 Difference]: Start difference. First operand has 109 places, 101 transitions, 1052 flow. Second operand 8 states and 148 transitions. [2024-06-27 18:38:32,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 143 transitions, 1502 flow [2024-06-27 18:38:32,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 143 transitions, 1381 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-27 18:38:32,415 INFO L231 Difference]: Finished difference. Result has 113 places, 106 transitions, 1069 flow [2024-06-27 18:38:32,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1069, PETRI_PLACES=113, PETRI_TRANSITIONS=106} [2024-06-27 18:38:32,416 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 74 predicate places. [2024-06-27 18:38:32,416 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 1069 flow [2024-06-27 18:38:32,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:32,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:32,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:32,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 18:38:32,417 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:32,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1294630194, now seen corresponding path program 6 times [2024-06-27 18:38:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:32,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950746607] [2024-06-27 18:38:32,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:33,309 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 18:38:33,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:33,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950746607] [2024-06-27 18:38:33,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950746607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:33,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:33,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:38:33,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294776235] [2024-06-27 18:38:33,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:33,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:38:33,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:33,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:38:33,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:38:33,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:33,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 1069 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:33,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:33,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:33,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:33,798 INFO L124 PetriNetUnfolderBase]: 745/1381 cut-off events. [2024-06-27 18:38:33,798 INFO L125 PetriNetUnfolderBase]: For 8693/8693 co-relation queries the response was YES. [2024-06-27 18:38:33,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6301 conditions, 1381 events. 745/1381 cut-off events. For 8693/8693 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7901 event pairs, 138 based on Foata normal form. 2/1337 useless extension candidates. Maximal degree in co-relation 6249. Up to 970 conditions per place. [2024-06-27 18:38:33,809 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 111 selfloop transitions, 23 changer transitions 0/141 dead transitions. [2024-06-27 18:38:33,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 141 transitions, 1464 flow [2024-06-27 18:38:33,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-27 18:38:33,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2024-06-27 18:38:33,811 INFO L175 Difference]: Start difference. First operand has 113 places, 106 transitions, 1069 flow. Second operand 8 states and 142 transitions. [2024-06-27 18:38:33,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 141 transitions, 1464 flow [2024-06-27 18:38:33,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 141 transitions, 1403 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 18:38:33,834 INFO L231 Difference]: Finished difference. Result has 117 places, 109 transitions, 1107 flow [2024-06-27 18:38:33,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1107, PETRI_PLACES=117, PETRI_TRANSITIONS=109} [2024-06-27 18:38:33,835 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 78 predicate places. [2024-06-27 18:38:33,835 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 109 transitions, 1107 flow [2024-06-27 18:38:33,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:33,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:33,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:33,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 18:38:33,836 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:33,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:33,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1294637138, now seen corresponding path program 1 times [2024-06-27 18:38:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:33,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395671740] [2024-06-27 18:38:33,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:33,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:34,860 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 18:38:34,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:34,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395671740] [2024-06-27 18:38:34,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395671740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:34,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:34,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:34,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697478637] [2024-06-27 18:38:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:34,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:34,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:34,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:34,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:34,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 1107 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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 18:38:34,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:34,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:34,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:35,341 INFO L124 PetriNetUnfolderBase]: 777/1459 cut-off events. [2024-06-27 18:38:35,341 INFO L125 PetriNetUnfolderBase]: For 9812/9812 co-relation queries the response was YES. [2024-06-27 18:38:35,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6572 conditions, 1459 events. 777/1459 cut-off events. For 9812/9812 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8561 event pairs, 147 based on Foata normal form. 4/1411 useless extension candidates. Maximal degree in co-relation 6518. Up to 1010 conditions per place. [2024-06-27 18:38:35,356 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 113 selfloop transitions, 23 changer transitions 0/143 dead transitions. [2024-06-27 18:38:35,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 143 transitions, 1489 flow [2024-06-27 18:38:35,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 18:38:35,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 18:38:35,358 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 1107 flow. Second operand 8 states and 144 transitions. [2024-06-27 18:38:35,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 143 transitions, 1489 flow [2024-06-27 18:38:35,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 143 transitions, 1445 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-27 18:38:35,383 INFO L231 Difference]: Finished difference. Result has 122 places, 111 transitions, 1136 flow [2024-06-27 18:38:35,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1136, PETRI_PLACES=122, PETRI_TRANSITIONS=111} [2024-06-27 18:38:35,383 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 83 predicate places. [2024-06-27 18:38:35,384 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 111 transitions, 1136 flow [2024-06-27 18:38:35,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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 18:38:35,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:35,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:35,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 18:38:35,384 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:35,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1840397968, now seen corresponding path program 2 times [2024-06-27 18:38:35,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:35,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764674894] [2024-06-27 18:38:35,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:35,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:36,442 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 18:38:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764674894] [2024-06-27 18:38:36,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764674894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:36,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:36,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:36,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353820908] [2024-06-27 18:38:36,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:36,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:36,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:36,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:36,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:36,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:36,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 111 transitions, 1136 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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 18:38:36,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:36,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:36,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:36,917 INFO L124 PetriNetUnfolderBase]: 804/1553 cut-off events. [2024-06-27 18:38:36,918 INFO L125 PetriNetUnfolderBase]: For 10511/10511 co-relation queries the response was YES. [2024-06-27 18:38:36,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6854 conditions, 1553 events. 804/1553 cut-off events. For 10511/10511 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9435 event pairs, 212 based on Foata normal form. 2/1498 useless extension candidates. Maximal degree in co-relation 6799. Up to 1227 conditions per place. [2024-06-27 18:38:36,932 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 120 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2024-06-27 18:38:36,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 144 transitions, 1530 flow [2024-06-27 18:38:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-27 18:38:36,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-27 18:38:36,933 INFO L175 Difference]: Start difference. First operand has 122 places, 111 transitions, 1136 flow. Second operand 8 states and 135 transitions. [2024-06-27 18:38:36,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 144 transitions, 1530 flow [2024-06-27 18:38:36,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 144 transitions, 1473 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-27 18:38:36,962 INFO L231 Difference]: Finished difference. Result has 126 places, 117 transitions, 1187 flow [2024-06-27 18:38:36,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1187, PETRI_PLACES=126, PETRI_TRANSITIONS=117} [2024-06-27 18:38:36,963 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 87 predicate places. [2024-06-27 18:38:36,963 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 117 transitions, 1187 flow [2024-06-27 18:38:36,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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 18:38:36,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:36,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:36,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 18:38:36,964 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:36,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:36,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1689117038, now seen corresponding path program 7 times [2024-06-27 18:38:36,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:36,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863318285] [2024-06-27 18:38:36,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:36,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:37,910 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 18:38:37,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:37,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863318285] [2024-06-27 18:38:37,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863318285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:37,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:37,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:38:37,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051121941] [2024-06-27 18:38:37,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:37,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:38:37,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:37,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:38:37,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:38:37,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:37,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 117 transitions, 1187 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:37,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:37,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:37,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:38,355 INFO L124 PetriNetUnfolderBase]: 812/1512 cut-off events. [2024-06-27 18:38:38,356 INFO L125 PetriNetUnfolderBase]: For 9586/9586 co-relation queries the response was YES. [2024-06-27 18:38:38,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6896 conditions, 1512 events. 812/1512 cut-off events. For 9586/9586 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8877 event pairs, 121 based on Foata normal form. 2/1462 useless extension candidates. Maximal degree in co-relation 6838. Up to 924 conditions per place. [2024-06-27 18:38:38,366 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 107 selfloop transitions, 41 changer transitions 0/155 dead transitions. [2024-06-27 18:38:38,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 155 transitions, 1640 flow [2024-06-27 18:38:38,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:38:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:38:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-27 18:38:38,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.563265306122449 [2024-06-27 18:38:38,367 INFO L175 Difference]: Start difference. First operand has 126 places, 117 transitions, 1187 flow. Second operand 7 states and 138 transitions. [2024-06-27 18:38:38,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 155 transitions, 1640 flow [2024-06-27 18:38:38,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 155 transitions, 1585 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-27 18:38:38,400 INFO L231 Difference]: Finished difference. Result has 129 places, 122 transitions, 1298 flow [2024-06-27 18:38:38,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1298, PETRI_PLACES=129, PETRI_TRANSITIONS=122} [2024-06-27 18:38:38,400 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 90 predicate places. [2024-06-27 18:38:38,400 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 122 transitions, 1298 flow [2024-06-27 18:38:38,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 18:38:38,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:38,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:38,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 18:38:38,401 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:38,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1584791188, now seen corresponding path program 3 times [2024-06-27 18:38:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:38,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304007639] [2024-06-27 18:38:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:38,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:39,500 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 18:38:39,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:39,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304007639] [2024-06-27 18:38:39,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304007639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:39,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:39,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:39,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725907746] [2024-06-27 18:38:39,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:39,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:39,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:39,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:39,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:39,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:39,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 122 transitions, 1298 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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 18:38:39,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:39,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:39,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:40,012 INFO L124 PetriNetUnfolderBase]: 828/1603 cut-off events. [2024-06-27 18:38:40,012 INFO L125 PetriNetUnfolderBase]: For 11075/11075 co-relation queries the response was YES. [2024-06-27 18:38:40,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7303 conditions, 1603 events. 828/1603 cut-off events. For 11075/11075 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9829 event pairs, 231 based on Foata normal form. 2/1546 useless extension candidates. Maximal degree in co-relation 7244. Up to 1278 conditions per place. [2024-06-27 18:38:40,022 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 122 selfloop transitions, 18 changer transitions 0/147 dead transitions. [2024-06-27 18:38:40,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 147 transitions, 1654 flow [2024-06-27 18:38:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-27 18:38:40,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-27 18:38:40,023 INFO L175 Difference]: Start difference. First operand has 129 places, 122 transitions, 1298 flow. Second operand 8 states and 132 transitions. [2024-06-27 18:38:40,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 147 transitions, 1654 flow [2024-06-27 18:38:40,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 147 transitions, 1573 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 18:38:40,047 INFO L231 Difference]: Finished difference. Result has 132 places, 123 transitions, 1272 flow [2024-06-27 18:38:40,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1272, PETRI_PLACES=132, PETRI_TRANSITIONS=123} [2024-06-27 18:38:40,048 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 93 predicate places. [2024-06-27 18:38:40,048 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 123 transitions, 1272 flow [2024-06-27 18:38:40,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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 18:38:40,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:40,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:40,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 18:38:40,048 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:40,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1993401076, now seen corresponding path program 4 times [2024-06-27 18:38:40,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:40,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138127743] [2024-06-27 18:38:40,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:40,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:41,013 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 18:38:41,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:41,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138127743] [2024-06-27 18:38:41,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138127743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:41,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:41,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:41,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071831928] [2024-06-27 18:38:41,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:41,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:41,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:41,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:41,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:41,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:41,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 123 transitions, 1272 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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 18:38:41,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:41,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:41,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:41,474 INFO L124 PetriNetUnfolderBase]: 829/1598 cut-off events. [2024-06-27 18:38:41,474 INFO L125 PetriNetUnfolderBase]: For 9476/9476 co-relation queries the response was YES. [2024-06-27 18:38:41,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7100 conditions, 1598 events. 829/1598 cut-off events. For 9476/9476 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9749 event pairs, 232 based on Foata normal form. 2/1543 useless extension candidates. Maximal degree in co-relation 7040. Up to 1300 conditions per place. [2024-06-27 18:38:41,483 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 125 selfloop transitions, 16 changer transitions 0/148 dead transitions. [2024-06-27 18:38:41,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 148 transitions, 1634 flow [2024-06-27 18:38:41,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-27 18:38:41,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-27 18:38:41,485 INFO L175 Difference]: Start difference. First operand has 132 places, 123 transitions, 1272 flow. Second operand 8 states and 130 transitions. [2024-06-27 18:38:41,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 148 transitions, 1634 flow [2024-06-27 18:38:41,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 148 transitions, 1591 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 18:38:41,510 INFO L231 Difference]: Finished difference. Result has 135 places, 126 transitions, 1302 flow [2024-06-27 18:38:41,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1302, PETRI_PLACES=135, PETRI_TRANSITIONS=126} [2024-06-27 18:38:41,511 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 96 predicate places. [2024-06-27 18:38:41,511 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 126 transitions, 1302 flow [2024-06-27 18:38:41,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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 18:38:41,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:41,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:41,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 18:38:41,512 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:41,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1810544090, now seen corresponding path program 1 times [2024-06-27 18:38:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:41,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591107641] [2024-06-27 18:38:41,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:41,578 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 18:38:41,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:41,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591107641] [2024-06-27 18:38:41,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591107641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:41,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:41,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:38:41,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333138236] [2024-06-27 18:38:41,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:41,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:38:41,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:41,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:38:41,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:38:41,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 18:38:41,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 126 transitions, 1302 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 18:38:41,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:41,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 18:38:41,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:41,779 INFO L124 PetriNetUnfolderBase]: 430/944 cut-off events. [2024-06-27 18:38:41,780 INFO L125 PetriNetUnfolderBase]: For 4615/4693 co-relation queries the response was YES. [2024-06-27 18:38:41,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3734 conditions, 944 events. 430/944 cut-off events. For 4615/4693 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5507 event pairs, 101 based on Foata normal form. 85/972 useless extension candidates. Maximal degree in co-relation 3673. Up to 285 conditions per place. [2024-06-27 18:38:41,784 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 58 selfloop transitions, 27 changer transitions 0/111 dead transitions. [2024-06-27 18:38:41,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 111 transitions, 1196 flow [2024-06-27 18:38:41,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:38:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:38:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-06-27 18:38:41,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-06-27 18:38:41,786 INFO L175 Difference]: Start difference. First operand has 135 places, 126 transitions, 1302 flow. Second operand 4 states and 95 transitions. [2024-06-27 18:38:41,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 111 transitions, 1196 flow [2024-06-27 18:38:41,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 111 transitions, 949 flow, removed 20 selfloop flow, removed 28 redundant places. [2024-06-27 18:38:41,799 INFO L231 Difference]: Finished difference. Result has 112 places, 94 transitions, 803 flow [2024-06-27 18:38:41,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=803, PETRI_PLACES=112, PETRI_TRANSITIONS=94} [2024-06-27 18:38:41,800 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 73 predicate places. [2024-06-27 18:38:41,800 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 94 transitions, 803 flow [2024-06-27 18:38:41,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 18:38:41,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:41,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:41,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 18:38:41,800 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:41,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:41,800 INFO L85 PathProgramCache]: Analyzing trace with hash -860132723, now seen corresponding path program 1 times [2024-06-27 18:38:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:41,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62636729] [2024-06-27 18:38:41,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:41,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:42,523 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 18:38:42,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:42,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62636729] [2024-06-27 18:38:42,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62636729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:42,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:42,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:38:42,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061470745] [2024-06-27 18:38:42,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:42,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:38:42,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:42,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:38:42,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:38:42,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:42,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 94 transitions, 803 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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 18:38:42,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:42,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:42,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:43,117 INFO L124 PetriNetUnfolderBase]: 1051/2127 cut-off events. [2024-06-27 18:38:43,118 INFO L125 PetriNetUnfolderBase]: For 13047/13047 co-relation queries the response was YES. [2024-06-27 18:38:43,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8296 conditions, 2127 events. 1051/2127 cut-off events. For 13047/13047 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13838 event pairs, 253 based on Foata normal form. 8/2024 useless extension candidates. Maximal degree in co-relation 8245. Up to 698 conditions per place. [2024-06-27 18:38:43,129 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 125 selfloop transitions, 59 changer transitions 0/192 dead transitions. [2024-06-27 18:38:43,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 192 transitions, 1908 flow [2024-06-27 18:38:43,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:38:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:38:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 18:38:43,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-27 18:38:43,130 INFO L175 Difference]: Start difference. First operand has 112 places, 94 transitions, 803 flow. Second operand 9 states and 168 transitions. [2024-06-27 18:38:43,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 192 transitions, 1908 flow [2024-06-27 18:38:43,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 192 transitions, 1854 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 18:38:43,159 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 1231 flow [2024-06-27 18:38:43,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1231, PETRI_PLACES=122, PETRI_TRANSITIONS=122} [2024-06-27 18:38:43,160 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 83 predicate places. [2024-06-27 18:38:43,160 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 1231 flow [2024-06-27 18:38:43,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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 18:38:43,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:43,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:43,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 18:38:43,160 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:43,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash -381789921, now seen corresponding path program 2 times [2024-06-27 18:38:43,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:43,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968311612] [2024-06-27 18:38:43,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:43,924 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 18:38:43,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:43,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968311612] [2024-06-27 18:38:43,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968311612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:43,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:43,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109587087] [2024-06-27 18:38:43,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:43,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:43,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:43,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:43,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:44,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:44,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 1231 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:44,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:44,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:44,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:44,520 INFO L124 PetriNetUnfolderBase]: 1193/2444 cut-off events. [2024-06-27 18:38:44,520 INFO L125 PetriNetUnfolderBase]: For 18076/18079 co-relation queries the response was YES. [2024-06-27 18:38:44,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10105 conditions, 2444 events. 1193/2444 cut-off events. For 18076/18079 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16401 event pairs, 321 based on Foata normal form. 11/2296 useless extension candidates. Maximal degree in co-relation 10049. Up to 758 conditions per place. [2024-06-27 18:38:44,535 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 90 selfloop transitions, 65 changer transitions 0/163 dead transitions. [2024-06-27 18:38:44,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 163 transitions, 1743 flow [2024-06-27 18:38:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:38:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:38:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 18:38:44,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 18:38:44,541 INFO L175 Difference]: Start difference. First operand has 122 places, 122 transitions, 1231 flow. Second operand 9 states and 160 transitions. [2024-06-27 18:38:44,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 163 transitions, 1743 flow [2024-06-27 18:38:44,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 163 transitions, 1709 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 18:38:44,573 INFO L231 Difference]: Finished difference. Result has 128 places, 122 transitions, 1331 flow [2024-06-27 18:38:44,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1331, PETRI_PLACES=128, PETRI_TRANSITIONS=122} [2024-06-27 18:38:44,574 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 89 predicate places. [2024-06-27 18:38:44,574 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 122 transitions, 1331 flow [2024-06-27 18:38:44,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:44,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:44,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:44,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 18:38:44,575 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:44,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2107570125, now seen corresponding path program 3 times [2024-06-27 18:38:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:44,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314190028] [2024-06-27 18:38:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:44,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:45,204 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 18:38:45,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:45,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314190028] [2024-06-27 18:38:45,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314190028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:45,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:45,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:45,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125338322] [2024-06-27 18:38:45,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:45,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:45,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:45,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:45,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:45,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:45,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 122 transitions, 1331 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:45,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:45,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:45,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:45,955 INFO L124 PetriNetUnfolderBase]: 1469/3192 cut-off events. [2024-06-27 18:38:45,955 INFO L125 PetriNetUnfolderBase]: For 30378/30381 co-relation queries the response was YES. [2024-06-27 18:38:45,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12826 conditions, 3192 events. 1469/3192 cut-off events. For 30378/30381 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 24013 event pairs, 553 based on Foata normal form. 19/2993 useless extension candidates. Maximal degree in co-relation 12769. Up to 1589 conditions per place. [2024-06-27 18:38:45,970 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 92 selfloop transitions, 63 changer transitions 0/163 dead transitions. [2024-06-27 18:38:45,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 163 transitions, 1854 flow [2024-06-27 18:38:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:38:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:38:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-27 18:38:45,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 18:38:45,971 INFO L175 Difference]: Start difference. First operand has 128 places, 122 transitions, 1331 flow. Second operand 9 states and 162 transitions. [2024-06-27 18:38:45,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 163 transitions, 1854 flow [2024-06-27 18:38:46,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 163 transitions, 1721 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-27 18:38:46,014 INFO L231 Difference]: Finished difference. Result has 129 places, 122 transitions, 1329 flow [2024-06-27 18:38:46,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1200, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1329, PETRI_PLACES=129, PETRI_TRANSITIONS=122} [2024-06-27 18:38:46,014 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 90 predicate places. [2024-06-27 18:38:46,014 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 122 transitions, 1329 flow [2024-06-27 18:38:46,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:46,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:46,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:46,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 18:38:46,015 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:46,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:46,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2107573845, now seen corresponding path program 4 times [2024-06-27 18:38:46,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:46,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693074988] [2024-06-27 18:38:46,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:46,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:46,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 18:38:46,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:46,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693074988] [2024-06-27 18:38:46,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693074988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:46,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:46,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:46,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069473341] [2024-06-27 18:38:46,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:46,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:46,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:46,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:46,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:46,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:46,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 122 transitions, 1329 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:46,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:46,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:46,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:47,302 INFO L124 PetriNetUnfolderBase]: 1355/2946 cut-off events. [2024-06-27 18:38:47,302 INFO L125 PetriNetUnfolderBase]: For 21015/21018 co-relation queries the response was YES. [2024-06-27 18:38:47,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11368 conditions, 2946 events. 1355/2946 cut-off events. For 21015/21018 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 21639 event pairs, 511 based on Foata normal form. 23/2761 useless extension candidates. Maximal degree in co-relation 11311. Up to 1695 conditions per place. [2024-06-27 18:38:47,318 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 85 selfloop transitions, 63 changer transitions 0/156 dead transitions. [2024-06-27 18:38:47,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 156 transitions, 1755 flow [2024-06-27 18:38:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:38:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:38:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 18:38:47,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-27 18:38:47,320 INFO L175 Difference]: Start difference. First operand has 129 places, 122 transitions, 1329 flow. Second operand 9 states and 154 transitions. [2024-06-27 18:38:47,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 156 transitions, 1755 flow [2024-06-27 18:38:47,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 156 transitions, 1630 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 18:38:47,357 INFO L231 Difference]: Finished difference. Result has 131 places, 122 transitions, 1336 flow [2024-06-27 18:38:47,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1204, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1336, PETRI_PLACES=131, PETRI_TRANSITIONS=122} [2024-06-27 18:38:47,358 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 92 predicate places. [2024-06-27 18:38:47,358 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 122 transitions, 1336 flow [2024-06-27 18:38:47,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:47,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:47,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:47,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 18:38:47,358 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:47,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash -106681739, now seen corresponding path program 5 times [2024-06-27 18:38:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860589864] [2024-06-27 18:38:47,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:47,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:48,177 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 18:38:48,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:48,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860589864] [2024-06-27 18:38:48,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860589864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:48,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:48,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:48,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120264700] [2024-06-27 18:38:48,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:48,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:48,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:48,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:48,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:48,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:48,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 122 transitions, 1336 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:48,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:48,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:48,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:48,782 INFO L124 PetriNetUnfolderBase]: 1497/3313 cut-off events. [2024-06-27 18:38:48,782 INFO L125 PetriNetUnfolderBase]: For 22826/22830 co-relation queries the response was YES. [2024-06-27 18:38:48,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12377 conditions, 3313 events. 1497/3313 cut-off events. For 22826/22830 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 25527 event pairs, 631 based on Foata normal form. 24/3111 useless extension candidates. Maximal degree in co-relation 12319. Up to 2087 conditions per place. [2024-06-27 18:38:48,796 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 119 selfloop transitions, 28 changer transitions 0/155 dead transitions. [2024-06-27 18:38:48,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 155 transitions, 1759 flow [2024-06-27 18:38:48,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:38:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:38:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 18:38:48,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793650793650794 [2024-06-27 18:38:48,805 INFO L175 Difference]: Start difference. First operand has 131 places, 122 transitions, 1336 flow. Second operand 9 states and 151 transitions. [2024-06-27 18:38:48,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 155 transitions, 1759 flow [2024-06-27 18:38:48,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 155 transitions, 1637 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 18:38:48,846 INFO L231 Difference]: Finished difference. Result has 133 places, 122 transitions, 1279 flow [2024-06-27 18:38:48,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1279, PETRI_PLACES=133, PETRI_TRANSITIONS=122} [2024-06-27 18:38:48,847 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 94 predicate places. [2024-06-27 18:38:48,847 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 122 transitions, 1279 flow [2024-06-27 18:38:48,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:48,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:48,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:48,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 18:38:48,847 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:48,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:48,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2100705361, now seen corresponding path program 6 times [2024-06-27 18:38:48,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:48,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975551312] [2024-06-27 18:38:48,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:48,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:49,469 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 18:38:49,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:49,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975551312] [2024-06-27 18:38:49,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975551312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:49,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:49,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:49,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900388570] [2024-06-27 18:38:49,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:49,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:49,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:49,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:49,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:49,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:49,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 122 transitions, 1279 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:49,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:49,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:49,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:50,165 INFO L124 PetriNetUnfolderBase]: 1847/4199 cut-off events. [2024-06-27 18:38:50,165 INFO L125 PetriNetUnfolderBase]: For 30942/30946 co-relation queries the response was YES. [2024-06-27 18:38:50,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15181 conditions, 4199 events. 1847/4199 cut-off events. For 30942/30946 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 34792 event pairs, 813 based on Foata normal form. 20/3945 useless extension candidates. Maximal degree in co-relation 15122. Up to 2187 conditions per place. [2024-06-27 18:38:50,189 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 112 selfloop transitions, 42 changer transitions 0/162 dead transitions. [2024-06-27 18:38:50,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 162 transitions, 1803 flow [2024-06-27 18:38:50,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:38:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:38:50,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 18:38:50,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-06-27 18:38:50,191 INFO L175 Difference]: Start difference. First operand has 133 places, 122 transitions, 1279 flow. Second operand 9 states and 159 transitions. [2024-06-27 18:38:50,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 162 transitions, 1803 flow [2024-06-27 18:38:50,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 162 transitions, 1747 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 18:38:50,243 INFO L231 Difference]: Finished difference. Result has 134 places, 122 transitions, 1310 flow [2024-06-27 18:38:50,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1310, PETRI_PLACES=134, PETRI_TRANSITIONS=122} [2024-06-27 18:38:50,243 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 95 predicate places. [2024-06-27 18:38:50,243 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 122 transitions, 1310 flow [2024-06-27 18:38:50,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:50,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:50,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:50,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 18:38:50,244 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:50,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash -106825889, now seen corresponding path program 7 times [2024-06-27 18:38:50,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:50,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147242214] [2024-06-27 18:38:50,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:50,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:50,969 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 18:38:50,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:50,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147242214] [2024-06-27 18:38:50,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147242214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:50,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:50,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:50,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158130966] [2024-06-27 18:38:50,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:50,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:50,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:50,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:50,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:51,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:51,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 122 transitions, 1310 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:51,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:51,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:51,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:51,711 INFO L124 PetriNetUnfolderBase]: 1821/4169 cut-off events. [2024-06-27 18:38:51,711 INFO L125 PetriNetUnfolderBase]: For 26461/26465 co-relation queries the response was YES. [2024-06-27 18:38:51,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14591 conditions, 4169 events. 1821/4169 cut-off events. For 26461/26465 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 34656 event pairs, 887 based on Foata normal form. 24/3911 useless extension candidates. Maximal degree in co-relation 14531. Up to 2783 conditions per place. [2024-06-27 18:38:51,734 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 106 selfloop transitions, 42 changer transitions 0/156 dead transitions. [2024-06-27 18:38:51,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 156 transitions, 1739 flow [2024-06-27 18:38:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:38:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:38:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-27 18:38:51,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 18:38:51,736 INFO L175 Difference]: Start difference. First operand has 134 places, 122 transitions, 1310 flow. Second operand 9 states and 153 transitions. [2024-06-27 18:38:51,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 156 transitions, 1739 flow [2024-06-27 18:38:51,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 156 transitions, 1656 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 18:38:51,780 INFO L231 Difference]: Finished difference. Result has 136 places, 122 transitions, 1317 flow [2024-06-27 18:38:51,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1317, PETRI_PLACES=136, PETRI_TRANSITIONS=122} [2024-06-27 18:38:51,781 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 97 predicate places. [2024-06-27 18:38:51,781 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 122 transitions, 1317 flow [2024-06-27 18:38:51,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:51,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:51,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:51,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 18:38:51,781 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:51,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1473320909, now seen corresponding path program 8 times [2024-06-27 18:38:51,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:51,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873131873] [2024-06-27 18:38:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:51,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:52,360 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 18:38:52,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:52,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873131873] [2024-06-27 18:38:52,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873131873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:52,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:52,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:52,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359297449] [2024-06-27 18:38:52,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:52,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:52,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:52,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:52,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:52,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 122 transitions, 1317 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:52,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:52,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:52,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:53,108 INFO L124 PetriNetUnfolderBase]: 1943/4296 cut-off events. [2024-06-27 18:38:53,109 INFO L125 PetriNetUnfolderBase]: For 31284/31286 co-relation queries the response was YES. [2024-06-27 18:38:53,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15613 conditions, 4296 events. 1943/4296 cut-off events. For 31284/31286 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 35374 event pairs, 751 based on Foata normal form. 18/4045 useless extension candidates. Maximal degree in co-relation 15552. Up to 2509 conditions per place. [2024-06-27 18:38:53,131 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 102 selfloop transitions, 57 changer transitions 0/167 dead transitions. [2024-06-27 18:38:53,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 167 transitions, 1872 flow [2024-06-27 18:38:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:38:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:38:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 18:38:53,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526984126984127 [2024-06-27 18:38:53,133 INFO L175 Difference]: Start difference. First operand has 136 places, 122 transitions, 1317 flow. Second operand 9 states and 166 transitions. [2024-06-27 18:38:53,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 167 transitions, 1872 flow [2024-06-27 18:38:53,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 167 transitions, 1792 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 18:38:53,190 INFO L231 Difference]: Finished difference. Result has 138 places, 122 transitions, 1354 flow [2024-06-27 18:38:53,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1354, PETRI_PLACES=138, PETRI_TRANSITIONS=122} [2024-06-27 18:38:53,191 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 99 predicate places. [2024-06-27 18:38:53,191 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 122 transitions, 1354 flow [2024-06-27 18:38:53,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:53,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:53,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:53,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 18:38:53,191 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:53,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:53,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1473324629, now seen corresponding path program 9 times [2024-06-27 18:38:53,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:53,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899042938] [2024-06-27 18:38:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:53,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:53,861 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 18:38:53,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:53,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899042938] [2024-06-27 18:38:53,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899042938] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:53,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:53,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:53,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967287660] [2024-06-27 18:38:53,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:53,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:53,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:53,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:53,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:53,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:53,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 122 transitions, 1354 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:53,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:53,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:53,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:54,668 INFO L124 PetriNetUnfolderBase]: 2085/4848 cut-off events. [2024-06-27 18:38:54,668 INFO L125 PetriNetUnfolderBase]: For 35717/35719 co-relation queries the response was YES. [2024-06-27 18:38:54,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16976 conditions, 4848 events. 2085/4848 cut-off events. For 35717/35719 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 42100 event pairs, 1055 based on Foata normal form. 22/4539 useless extension candidates. Maximal degree in co-relation 16914. Up to 3251 conditions per place. [2024-06-27 18:38:54,689 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 98 selfloop transitions, 55 changer transitions 0/161 dead transitions. [2024-06-27 18:38:54,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 161 transitions, 1810 flow [2024-06-27 18:38:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:38:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:38:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 18:38:54,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 18:38:54,691 INFO L175 Difference]: Start difference. First operand has 138 places, 122 transitions, 1354 flow. Second operand 9 states and 160 transitions. [2024-06-27 18:38:54,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 161 transitions, 1810 flow [2024-06-27 18:38:54,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 161 transitions, 1697 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 18:38:54,765 INFO L231 Difference]: Finished difference. Result has 140 places, 122 transitions, 1357 flow [2024-06-27 18:38:54,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1357, PETRI_PLACES=140, PETRI_TRANSITIONS=122} [2024-06-27 18:38:54,765 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 101 predicate places. [2024-06-27 18:38:54,766 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 122 transitions, 1357 flow [2024-06-27 18:38:54,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:54,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:54,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:54,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 18:38:54,766 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:54,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:54,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1479038921, now seen corresponding path program 1 times [2024-06-27 18:38:54,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:54,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052200660] [2024-06-27 18:38:54,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:54,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:55,583 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 18:38:55,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:55,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052200660] [2024-06-27 18:38:55,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052200660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:55,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:55,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:55,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786347716] [2024-06-27 18:38:55,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:55,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:55,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:55,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:55,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:55,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 122 transitions, 1357 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:55,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:55,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:55,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:56,391 INFO L124 PetriNetUnfolderBase]: 2173/5062 cut-off events. [2024-06-27 18:38:56,391 INFO L125 PetriNetUnfolderBase]: For 34161/34164 co-relation queries the response was YES. [2024-06-27 18:38:56,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17346 conditions, 5062 events. 2173/5062 cut-off events. For 34161/34164 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 44570 event pairs, 1111 based on Foata normal form. 27/4745 useless extension candidates. Maximal degree in co-relation 17283. Up to 3425 conditions per place. [2024-06-27 18:38:56,419 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 117 selfloop transitions, 35 changer transitions 0/160 dead transitions. [2024-06-27 18:38:56,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 160 transitions, 1817 flow [2024-06-27 18:38:56,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:38:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:38:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2024-06-27 18:38:56,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2024-06-27 18:38:56,421 INFO L175 Difference]: Start difference. First operand has 140 places, 122 transitions, 1357 flow. Second operand 10 states and 162 transitions. [2024-06-27 18:38:56,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 160 transitions, 1817 flow [2024-06-27 18:38:56,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 160 transitions, 1711 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 18:38:56,496 INFO L231 Difference]: Finished difference. Result has 143 places, 122 transitions, 1329 flow [2024-06-27 18:38:56,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1329, PETRI_PLACES=143, PETRI_TRANSITIONS=122} [2024-06-27 18:38:56,497 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 104 predicate places. [2024-06-27 18:38:56,497 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 122 transitions, 1329 flow [2024-06-27 18:38:56,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:56,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:56,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:56,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 18:38:56,498 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:56,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1479046361, now seen corresponding path program 2 times [2024-06-27 18:38:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:56,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804378933] [2024-06-27 18:38:56,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:56,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:57,269 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 18:38:57,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:57,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804378933] [2024-06-27 18:38:57,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804378933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:57,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:57,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:57,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173808414] [2024-06-27 18:38:57,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:57,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:57,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:57,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:57,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 122 transitions, 1329 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:57,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:57,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:57,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:57,988 INFO L124 PetriNetUnfolderBase]: 2238/5203 cut-off events. [2024-06-27 18:38:57,988 INFO L125 PetriNetUnfolderBase]: For 26529/26532 co-relation queries the response was YES. [2024-06-27 18:38:58,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17936 conditions, 5203 events. 2238/5203 cut-off events. For 26529/26532 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 45958 event pairs, 1080 based on Foata normal form. 7/4858 useless extension candidates. Maximal degree in co-relation 17872. Up to 3704 conditions per place. [2024-06-27 18:38:58,017 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 118 selfloop transitions, 26 changer transitions 0/152 dead transitions. [2024-06-27 18:38:58,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 152 transitions, 1806 flow [2024-06-27 18:38:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-27 18:38:58,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2024-06-27 18:38:58,018 INFO L175 Difference]: Start difference. First operand has 143 places, 122 transitions, 1329 flow. Second operand 8 states and 134 transitions. [2024-06-27 18:38:58,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 152 transitions, 1806 flow [2024-06-27 18:38:58,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 152 transitions, 1742 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 18:38:58,095 INFO L231 Difference]: Finished difference. Result has 143 places, 124 transitions, 1348 flow [2024-06-27 18:38:58,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1348, PETRI_PLACES=143, PETRI_TRANSITIONS=124} [2024-06-27 18:38:58,096 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 104 predicate places. [2024-06-27 18:38:58,096 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 124 transitions, 1348 flow [2024-06-27 18:38:58,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:58,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:58,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:58,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 18:38:58,096 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:58,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:58,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1473474731, now seen corresponding path program 3 times [2024-06-27 18:38:58,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:58,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301860370] [2024-06-27 18:38:58,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:58,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:38:58,898 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 18:38:58,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:38:58,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301860370] [2024-06-27 18:38:58,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301860370] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:38:58,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:38:58,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:38:58,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114773026] [2024-06-27 18:38:58,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:38:58,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:38:58,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:38:58,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:38:58,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:38:58,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:38:58,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 124 transitions, 1348 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:58,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:38:58,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:38:58,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:38:59,672 INFO L124 PetriNetUnfolderBase]: 2232/5205 cut-off events. [2024-06-27 18:38:59,672 INFO L125 PetriNetUnfolderBase]: For 26075/26077 co-relation queries the response was YES. [2024-06-27 18:38:59,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17954 conditions, 5205 events. 2232/5205 cut-off events. For 26075/26077 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 46196 event pairs, 1154 based on Foata normal form. 6/4848 useless extension candidates. Maximal degree in co-relation 17889. Up to 3946 conditions per place. [2024-06-27 18:38:59,698 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 120 selfloop transitions, 26 changer transitions 0/154 dead transitions. [2024-06-27 18:38:59,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 154 transitions, 1759 flow [2024-06-27 18:38:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:38:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:38:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-27 18:38:59,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 18:38:59,699 INFO L175 Difference]: Start difference. First operand has 143 places, 124 transitions, 1348 flow. Second operand 8 states and 136 transitions. [2024-06-27 18:38:59,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 154 transitions, 1759 flow [2024-06-27 18:38:59,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 154 transitions, 1706 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-27 18:38:59,775 INFO L231 Difference]: Finished difference. Result has 147 places, 125 transitions, 1368 flow [2024-06-27 18:38:59,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1368, PETRI_PLACES=147, PETRI_TRANSITIONS=125} [2024-06-27 18:38:59,776 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 108 predicate places. [2024-06-27 18:38:59,776 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 125 transitions, 1368 flow [2024-06-27 18:38:59,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:38:59,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:38:59,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:38:59,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 18:38:59,776 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:38:59,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:38:59,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1014017317, now seen corresponding path program 10 times [2024-06-27 18:38:59,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:38:59,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323022493] [2024-06-27 18:38:59,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:38:59,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:38:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:00,617 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 18:39:00,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:00,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323022493] [2024-06-27 18:39:00,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323022493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:00,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:00,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:39:00,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742344197] [2024-06-27 18:39:00,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:00,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:39:00,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:00,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:39:00,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:39:00,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:39:00,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 125 transitions, 1368 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:39:00,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:00,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:39:00,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:01,490 INFO L124 PetriNetUnfolderBase]: 2356/5543 cut-off events. [2024-06-27 18:39:01,490 INFO L125 PetriNetUnfolderBase]: For 33762/33764 co-relation queries the response was YES. [2024-06-27 18:39:01,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18567 conditions, 5543 events. 2356/5543 cut-off events. For 33762/33764 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 50204 event pairs, 1216 based on Foata normal form. 22/5182 useless extension candidates. Maximal degree in co-relation 18500. Up to 3838 conditions per place. [2024-06-27 18:39:01,521 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 125 selfloop transitions, 29 changer transitions 0/162 dead transitions. [2024-06-27 18:39:01,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 162 transitions, 1820 flow [2024-06-27 18:39:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:39:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:39:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 18:39:01,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-27 18:39:01,522 INFO L175 Difference]: Start difference. First operand has 147 places, 125 transitions, 1368 flow. Second operand 9 states and 154 transitions. [2024-06-27 18:39:01,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 162 transitions, 1820 flow [2024-06-27 18:39:01,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 162 transitions, 1769 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-27 18:39:01,614 INFO L231 Difference]: Finished difference. Result has 150 places, 125 transitions, 1383 flow [2024-06-27 18:39:01,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1383, PETRI_PLACES=150, PETRI_TRANSITIONS=125} [2024-06-27 18:39:01,615 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 111 predicate places. [2024-06-27 18:39:01,615 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 125 transitions, 1383 flow [2024-06-27 18:39:01,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:39:01,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:01,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:39:01,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 18:39:01,616 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:39:01,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:01,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1883893265, now seen corresponding path program 4 times [2024-06-27 18:39:01,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:01,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297384803] [2024-06-27 18:39:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:01,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:02,332 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 18:39:02,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:02,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297384803] [2024-06-27 18:39:02,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297384803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:02,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:02,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:39:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476963107] [2024-06-27 18:39:02,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:02,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:39:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:02,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:39:02,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:39:02,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:39:02,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 125 transitions, 1383 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:39:02,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:02,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:39:02,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:03,228 INFO L124 PetriNetUnfolderBase]: 2438/5543 cut-off events. [2024-06-27 18:39:03,228 INFO L125 PetriNetUnfolderBase]: For 27874/27876 co-relation queries the response was YES. [2024-06-27 18:39:03,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18846 conditions, 5543 events. 2438/5543 cut-off events. For 27874/27876 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 49586 event pairs, 1024 based on Foata normal form. 14/5208 useless extension candidates. Maximal degree in co-relation 18778. Up to 3062 conditions per place. [2024-06-27 18:39:03,253 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 93 selfloop transitions, 64 changer transitions 0/165 dead transitions. [2024-06-27 18:39:03,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 165 transitions, 1861 flow [2024-06-27 18:39:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:39:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:39:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-27 18:39:03,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174603174603175 [2024-06-27 18:39:03,254 INFO L175 Difference]: Start difference. First operand has 150 places, 125 transitions, 1383 flow. Second operand 9 states and 163 transitions. [2024-06-27 18:39:03,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 165 transitions, 1861 flow [2024-06-27 18:39:03,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 165 transitions, 1809 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 18:39:03,348 INFO L231 Difference]: Finished difference. Result has 152 places, 125 transitions, 1484 flow [2024-06-27 18:39:03,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1484, PETRI_PLACES=152, PETRI_TRANSITIONS=125} [2024-06-27 18:39:03,348 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 113 predicate places. [2024-06-27 18:39:03,348 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 125 transitions, 1484 flow [2024-06-27 18:39:03,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:39:03,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:03,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:39:03,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 18:39:03,349 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:39:03,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:03,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1883885825, now seen corresponding path program 5 times [2024-06-27 18:39:03,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:03,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773083938] [2024-06-27 18:39:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:04,238 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 18:39:04,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:04,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773083938] [2024-06-27 18:39:04,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773083938] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:04,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:04,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:39:04,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603576725] [2024-06-27 18:39:04,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:04,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:39:04,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:04,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:39:04,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:39:04,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:39:04,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 125 transitions, 1484 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:39:04,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:04,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:39:04,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:05,064 INFO L124 PetriNetUnfolderBase]: 2485/5450 cut-off events. [2024-06-27 18:39:05,064 INFO L125 PetriNetUnfolderBase]: For 27251/27254 co-relation queries the response was YES. [2024-06-27 18:39:05,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19101 conditions, 5450 events. 2485/5450 cut-off events. For 27251/27254 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 47765 event pairs, 787 based on Foata normal form. 17/5187 useless extension candidates. Maximal degree in co-relation 19032. Up to 2173 conditions per place. [2024-06-27 18:39:05,097 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 95 selfloop transitions, 60 changer transitions 0/163 dead transitions. [2024-06-27 18:39:05,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 163 transitions, 1961 flow [2024-06-27 18:39:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:39:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:39:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 18:39:05,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 18:39:05,098 INFO L175 Difference]: Start difference. First operand has 152 places, 125 transitions, 1484 flow. Second operand 8 states and 147 transitions. [2024-06-27 18:39:05,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 163 transitions, 1961 flow [2024-06-27 18:39:05,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 163 transitions, 1808 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-27 18:39:05,184 INFO L231 Difference]: Finished difference. Result has 149 places, 125 transitions, 1456 flow [2024-06-27 18:39:05,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1456, PETRI_PLACES=149, PETRI_TRANSITIONS=125} [2024-06-27 18:39:05,185 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 110 predicate places. [2024-06-27 18:39:05,185 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 125 transitions, 1456 flow [2024-06-27 18:39:05,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:39:05,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:05,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:39:05,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 18:39:05,186 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:39:05,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:05,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1457337139, now seen corresponding path program 6 times [2024-06-27 18:39:05,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:05,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233039231] [2024-06-27 18:39:05,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:05,826 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 18:39:05,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:05,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233039231] [2024-06-27 18:39:05,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233039231] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:05,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:05,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:39:05,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701724404] [2024-06-27 18:39:05,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:05,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:39:05,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:05,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:39:05,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:39:05,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:39:05,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 125 transitions, 1456 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:39:05,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:05,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:39:05,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:06,667 INFO L124 PetriNetUnfolderBase]: 2486/5911 cut-off events. [2024-06-27 18:39:06,668 INFO L125 PetriNetUnfolderBase]: For 17581/17581 co-relation queries the response was YES. [2024-06-27 18:39:06,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19496 conditions, 5911 events. 2486/5911 cut-off events. For 17581/17581 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 54663 event pairs, 1560 based on Foata normal form. 2/5527 useless extension candidates. Maximal degree in co-relation 19429. Up to 4608 conditions per place. [2024-06-27 18:39:06,706 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 128 selfloop transitions, 11 changer transitions 0/147 dead transitions. [2024-06-27 18:39:06,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 1822 flow [2024-06-27 18:39:06,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:39:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:39:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-27 18:39:06,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2024-06-27 18:39:06,709 INFO L175 Difference]: Start difference. First operand has 149 places, 125 transitions, 1456 flow. Second operand 7 states and 116 transitions. [2024-06-27 18:39:06,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 147 transitions, 1822 flow [2024-06-27 18:39:06,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 147 transitions, 1700 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 18:39:06,796 INFO L231 Difference]: Finished difference. Result has 149 places, 126 transitions, 1376 flow [2024-06-27 18:39:06,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1376, PETRI_PLACES=149, PETRI_TRANSITIONS=126} [2024-06-27 18:39:06,797 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 110 predicate places. [2024-06-27 18:39:06,797 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 126 transitions, 1376 flow [2024-06-27 18:39:06,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 18:39:06,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:06,797 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 18:39:06,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 18:39:06,798 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:39:06,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:06,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2032623701, now seen corresponding path program 1 times [2024-06-27 18:39:06,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:06,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471370944] [2024-06-27 18:39:06,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:06,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:07,645 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 18:39:07,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:07,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471370944] [2024-06-27 18:39:07,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471370944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:07,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:07,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:39:07,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678257507] [2024-06-27 18:39:07,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:07,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:39:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:07,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:39:07,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:39:07,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:39:07,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 126 transitions, 1376 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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 18:39:07,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:07,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:39:07,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:08,503 INFO L124 PetriNetUnfolderBase]: 2479/5874 cut-off events. [2024-06-27 18:39:08,503 INFO L125 PetriNetUnfolderBase]: For 15514/15514 co-relation queries the response was YES. [2024-06-27 18:39:08,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18938 conditions, 5874 events. 2479/5874 cut-off events. For 15514/15514 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 54170 event pairs, 1542 based on Foata normal form. 6/5500 useless extension candidates. Maximal degree in co-relation 18871. Up to 4476 conditions per place. [2024-06-27 18:39:08,538 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 135 selfloop transitions, 13 changer transitions 0/156 dead transitions. [2024-06-27 18:39:08,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 156 transitions, 1724 flow [2024-06-27 18:39:08,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:39:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:39:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-27 18:39:08,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-27 18:39:08,539 INFO L175 Difference]: Start difference. First operand has 149 places, 126 transitions, 1376 flow. Second operand 8 states and 132 transitions. [2024-06-27 18:39:08,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 156 transitions, 1724 flow [2024-06-27 18:39:08,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 156 transitions, 1549 flow, removed 10 selfloop flow, removed 31 redundant places. [2024-06-27 18:39:08,609 INFO L231 Difference]: Finished difference. Result has 125 places, 126 transitions, 1181 flow [2024-06-27 18:39:08,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1181, PETRI_PLACES=125, PETRI_TRANSITIONS=126} [2024-06-27 18:39:08,609 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 86 predicate places. [2024-06-27 18:39:08,609 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 126 transitions, 1181 flow [2024-06-27 18:39:08,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 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 18:39:08,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:08,610 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 18:39:08,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 18:39:08,610 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:39:08,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:08,610 INFO L85 PathProgramCache]: Analyzing trace with hash 794105744, now seen corresponding path program 1 times [2024-06-27 18:39:08,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:08,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812454666] [2024-06-27 18:39:08,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:08,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:08,667 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 18:39:08,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812454666] [2024-06-27 18:39:08,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812454666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:08,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:08,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:39:08,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813143521] [2024-06-27 18:39:08,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:08,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:39:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:08,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:39:08,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:39:08,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 18:39:08,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 126 transitions, 1181 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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 18:39:08,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:08,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 18:39:08,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:09,002 INFO L124 PetriNetUnfolderBase]: 1567/3756 cut-off events. [2024-06-27 18:39:09,002 INFO L125 PetriNetUnfolderBase]: For 6775/6835 co-relation queries the response was YES. [2024-06-27 18:39:09,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12267 conditions, 3756 events. 1567/3756 cut-off events. For 6775/6835 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 31858 event pairs, 365 based on Foata normal form. 271/3871 useless extension candidates. Maximal degree in co-relation 12226. Up to 1318 conditions per place. [2024-06-27 18:39:09,018 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 54 selfloop transitions, 53 changer transitions 0/133 dead transitions. [2024-06-27 18:39:09,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 133 transitions, 1378 flow [2024-06-27 18:39:09,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:39:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:39:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-27 18:39:09,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6114285714285714 [2024-06-27 18:39:09,019 INFO L175 Difference]: Start difference. First operand has 125 places, 126 transitions, 1181 flow. Second operand 5 states and 107 transitions. [2024-06-27 18:39:09,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 133 transitions, 1378 flow [2024-06-27 18:39:09,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 133 transitions, 1280 flow, removed 12 selfloop flow, removed 16 redundant places. [2024-06-27 18:39:09,048 INFO L231 Difference]: Finished difference. Result has 115 places, 123 transitions, 1206 flow [2024-06-27 18:39:09,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1206, PETRI_PLACES=115, PETRI_TRANSITIONS=123} [2024-06-27 18:39:09,049 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 76 predicate places. [2024-06-27 18:39:09,049 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 123 transitions, 1206 flow [2024-06-27 18:39:09,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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 18:39:09,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:09,049 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 18:39:09,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 18:39:09,050 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:39:09,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:09,050 INFO L85 PathProgramCache]: Analyzing trace with hash -439166333, now seen corresponding path program 1 times [2024-06-27 18:39:09,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:09,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467731923] [2024-06-27 18:39:09,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:09,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:39:09,275 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 18:39:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:39:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467731923] [2024-06-27 18:39:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467731923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:39:09,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:39:09,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:39:09,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241668852] [2024-06-27 18:39:09,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:39:09,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:39:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:39:09,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:39:09,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:39:09,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 18:39:09,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 123 transitions, 1206 flow. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 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 18:39:09,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:39:09,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 18:39:09,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:39:09,740 INFO L124 PetriNetUnfolderBase]: 1073/2889 cut-off events. [2024-06-27 18:39:09,740 INFO L125 PetriNetUnfolderBase]: For 6190/6226 co-relation queries the response was YES. [2024-06-27 18:39:09,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9671 conditions, 2889 events. 1073/2889 cut-off events. For 6190/6226 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 25588 event pairs, 234 based on Foata normal form. 64/2730 useless extension candidates. Maximal degree in co-relation 9637. Up to 673 conditions per place. [2024-06-27 18:39:09,751 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 33 selfloop transitions, 27 changer transitions 21/149 dead transitions. [2024-06-27 18:39:09,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 149 transitions, 1423 flow [2024-06-27 18:39:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:39:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:39:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-27 18:39:09,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-06-27 18:39:09,752 INFO L175 Difference]: Start difference. First operand has 115 places, 123 transitions, 1206 flow. Second operand 10 states and 188 transitions. [2024-06-27 18:39:09,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 149 transitions, 1423 flow [2024-06-27 18:39:09,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 149 transitions, 1317 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 18:39:09,770 INFO L231 Difference]: Finished difference. Result has 124 places, 113 transitions, 1058 flow [2024-06-27 18:39:09,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1058, PETRI_PLACES=124, PETRI_TRANSITIONS=113} [2024-06-27 18:39:09,770 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 85 predicate places. [2024-06-27 18:39:09,770 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 113 transitions, 1058 flow [2024-06-27 18:39:09,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 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 18:39:09,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:39:09,771 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 18:39:09,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 18:39:09,771 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:39:09,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:39:09,771 INFO L85 PathProgramCache]: Analyzing trace with hash -891767965, now seen corresponding path program 2 times [2024-06-27 18:39:09,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:39:09,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621206540] [2024-06-27 18:39:09,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:39:09,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:39:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 18:39:09,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 18:39:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 18:39:09,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 18:39:09,821 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 18:39:09,822 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 18:39:09,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 18:39:09,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 18:39:09,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 18:39:09,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 18:39:09,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 18:39:09,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 18:39:09,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 18:39:09,828 INFO L445 BasicCegarLoop]: Path program histogram: [10, 7, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:39:09,834 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 18:39:09,834 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 18:39:09,902 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 18:39:09,903 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 18:39:09,904 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 06:39:09 BasicIcfg [2024-06-27 18:39:09,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 18:39:09,905 INFO L158 Benchmark]: Toolchain (without parser) took 63281.40ms. Allocated memory was 182.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 139.6MB in the beginning and 639.2MB in the end (delta: -499.6MB). Peak memory consumption was 532.2MB. Max. memory is 16.1GB. [2024-06-27 18:39:09,905 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:39:09,906 INFO L158 Benchmark]: Witness Parser took 3.28ms. Allocated memory is still 182.5MB. Free memory was 144.9MB in the beginning and 144.0MB in the end (delta: 965.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:39:09,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.31ms. Allocated memory is still 182.5MB. Free memory was 138.7MB in the beginning and 107.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-06-27 18:39:09,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.35ms. Allocated memory is still 182.5MB. Free memory was 107.2MB in the beginning and 104.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 18:39:09,907 INFO L158 Benchmark]: Boogie Preprocessor took 60.85ms. Allocated memory is still 182.5MB. Free memory was 104.2MB in the beginning and 100.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 18:39:09,907 INFO L158 Benchmark]: RCFGBuilder took 700.53ms. Allocated memory is still 182.5MB. Free memory was 100.9MB in the beginning and 55.9MB in the end (delta: 45.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-06-27 18:39:09,908 INFO L158 Benchmark]: TraceAbstraction took 61744.52ms. Allocated memory was 182.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 55.9MB in the beginning and 639.2MB in the end (delta: -583.3MB). Peak memory consumption was 448.3MB. Max. memory is 16.1GB. [2024-06-27 18:39:09,910 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 3.28ms. Allocated memory is still 182.5MB. Free memory was 144.9MB in the beginning and 144.0MB in the end (delta: 965.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.31ms. Allocated memory is still 182.5MB. Free memory was 138.7MB in the beginning and 107.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.35ms. Allocated memory is still 182.5MB. Free memory was 107.2MB in the beginning and 104.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.85ms. Allocated memory is still 182.5MB. Free memory was 104.2MB in the beginning and 100.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 700.53ms. Allocated memory is still 182.5MB. Free memory was 100.9MB in the beginning and 55.9MB in the end (delta: 45.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 61744.52ms. Allocated memory was 182.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 55.9MB in the beginning and 639.2MB in the end (delta: -583.3MB). Peak memory consumption was 448.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L805] 0 pthread_t t1441; [L806] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L806] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L807] 0 pthread_t t1442; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] 0 //@ assert ((((((((((((((!multithreaded || (y$read_delayed_var == 0)) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))); [L808] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 1 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L783] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L784] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L785] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L786] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L787] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L809] 0 //@ assert ((((((((((((((!multithreaded || (y$read_delayed_var == 0)) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))); VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L810] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L812] RET 0 assume_abort_if_not(main$tmp_guard0) [L814] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L815] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L817] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L821] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=-2, t1442=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: 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: 808]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 806]: 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: 808]: 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 5 procedures, 52 locations, 7 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: 61.5s, OverallIterations: 49, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3052 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2602 mSDsluCounter, 1768 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1592 mSDsCounter, 704 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15290 IncrementalHoareTripleChecker+Invalid, 15994 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 704 mSolverCounterUnsat, 176 mSDtfsCounter, 15290 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1484occurred in iteration=43, InterpolantAutomatonStates: 357, 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.5s SatisfiabilityAnalysisTime, 32.6s InterpolantComputationTime, 714 NumberOfCodeBlocks, 714 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 641 ConstructedInterpolants, 0 QuantifiedInterpolants, 23356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 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 18:39:09,939 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