./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/dekker.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/dekker.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-atomic/dekker.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/dekker.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-28 00:51:24,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 00:51:24,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 00:51:24,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 00:51:24,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 00:51:24,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 00:51:24,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 00:51:24,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 00:51:24,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 00:51:24,808 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 00:51:24,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 00:51:24,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 00:51:24,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 00:51:24,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 00:51:24,810 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 00:51:24,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 00:51:24,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 00:51:24,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 00:51:24,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 00:51:24,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 00:51:24,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 00:51:24,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 00:51:24,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 00:51:24,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 00:51:24,813 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 00:51:24,813 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 00:51:24,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 00:51:24,813 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 00:51:24,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 00:51:24,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 00:51:24,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 00:51:24,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 00:51:24,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:51:24,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 00:51:24,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 00:51:24,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 00:51:24,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 00:51:24,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 00:51:24,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 00:51:24,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 00:51:24,817 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 00:51:24,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 00:51:24,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 00:51:24,817 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-28 00:51:25,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 00:51:25,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 00:51:25,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 00:51:25,055 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 00:51:25,055 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 00:51:25,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2024-06-28 00:51:26,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 00:51:26,287 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 00:51:26,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2024-06-28 00:51:26,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a342164d/0e8a34ddf27d476c978809bad1ad106e/FLAG97e520348 [2024-06-28 00:51:26,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a342164d/0e8a34ddf27d476c978809bad1ad106e [2024-06-28 00:51:26,318 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 00:51:26,318 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 00:51:26,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/dekker.yml/witness.yml [2024-06-28 00:51:26,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 00:51:26,379 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 00:51:26,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 00:51:26,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 00:51:26,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 00:51:26,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:51:26" (1/2) ... [2024-06-28 00:51:26,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@105d0153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:51:26, skipping insertion in model container [2024-06-28 00:51:26,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:51:26" (1/2) ... [2024-06-28 00:51:26,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@57c56b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:51:26, skipping insertion in model container [2024-06-28 00:51:26,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:51:26" (2/2) ... [2024-06-28 00:51:26,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@105d0153 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26, skipping insertion in model container [2024-06-28 00:51:26,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:51:26" (2/2) ... [2024-06-28 00:51:26,402 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 00:51:26,445 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 00:51:26,447 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] ((((! multithreaded || (flag2 == 0 || flag2 == 1)) && (! multithreaded || (turn == 0 || turn == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (((flag1 == 0 || flag1 == 1) && (flag2 == 0 || flag2 == 1)) && (turn == 0 || turn == 1)))) && (! multithreaded || (flag1 == 0 || flag1 == 1)) [2024-06-28 00:51:26,447 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] ((((! multithreaded || (flag2 == 0 || flag2 == 1)) && (! multithreaded || (turn == 0 || turn == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (((flag1 == 0 || flag1 == 1) && (flag2 == 0 || flag2 == 1)) && (turn == 0 || turn == 1)))) && (! multithreaded || (flag1 == 0 || flag1 == 1)) [2024-06-28 00:51:26,447 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 00:51:26,447 INFO L106 edCorrectnessWitness]: ghost_update [L792-L792] multithreaded = 1; [2024-06-28 00:51:26,485 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 00:51:26,784 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-atomic/dekker.i[31403,31416] [2024-06-28 00:51:26,792 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-atomic/dekker.i[32483,32496] [2024-06-28 00:51:26,804 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:51:26,811 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 00:51:26,871 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-atomic/dekker.i[31403,31416] [2024-06-28 00:51:26,873 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-atomic/dekker.i[32483,32496] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 00:51:26,881 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:51:26,926 INFO L206 MainTranslator]: Completed translation [2024-06-28 00:51:26,926 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26 WrapperNode [2024-06-28 00:51:26,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 00:51:26,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 00:51:26,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 00:51:26,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 00:51:26,932 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 28.06 12:51:26" (1/1) ... [2024-06-28 00:51:26,940 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 28.06 12:51:26" (1/1) ... [2024-06-28 00:51:26,955 INFO L138 Inliner]: procedures = 170, calls = 49, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-06-28 00:51:26,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 00:51:26,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 00:51:26,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 00:51:26,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 00:51:26,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26" (1/1) ... [2024-06-28 00:51:26,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26" (1/1) ... [2024-06-28 00:51:26,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26" (1/1) ... [2024-06-28 00:51:26,977 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-28 00:51:26,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26" (1/1) ... [2024-06-28 00:51:26,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26" (1/1) ... [2024-06-28 00:51:26,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26" (1/1) ... [2024-06-28 00:51:26,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26" (1/1) ... [2024-06-28 00:51:26,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26" (1/1) ... [2024-06-28 00:51:26,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26" (1/1) ... [2024-06-28 00:51:26,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 00:51:26,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 00:51:26,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 00:51:26,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 00:51:26,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26" (1/1) ... [2024-06-28 00:51:26,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:51:26,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 00:51:27,009 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-28 00:51:27,021 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-28 00:51:27,044 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-06-28 00:51:27,044 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-06-28 00:51:27,044 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-28 00:51:27,045 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-28 00:51:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 00:51:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 00:51:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 00:51:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 00:51:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 00:51:27,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 00:51:27,046 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 00:51:27,124 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 00:51:27,125 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 00:51:27,274 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 00:51:27,274 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 00:51:27,342 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 00:51:27,342 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-28 00:51:27,342 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:51:27 BoogieIcfgContainer [2024-06-28 00:51:27,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 00:51:27,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 00:51:27,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 00:51:27,347 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 00:51:27,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 12:51:26" (1/4) ... [2024-06-28 00:51:27,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530c7be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:51:27, skipping insertion in model container [2024-06-28 00:51:27,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:51:26" (2/4) ... [2024-06-28 00:51:27,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530c7be2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:51:27, skipping insertion in model container [2024-06-28 00:51:27,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:51:26" (3/4) ... [2024-06-28 00:51:27,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530c7be2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:51:27, skipping insertion in model container [2024-06-28 00:51:27,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:51:27" (4/4) ... [2024-06-28 00:51:27,349 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker.i [2024-06-28 00:51:27,363 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 00:51:27,363 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 00:51:27,363 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 00:51:27,417 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-28 00:51:27,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 61 transitions, 136 flow [2024-06-28 00:51:27,484 INFO L124 PetriNetUnfolderBase]: 8/59 cut-off events. [2024-06-28 00:51:27,484 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-28 00:51:27,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 59 events. 8/59 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 156 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-06-28 00:51:27,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 61 transitions, 136 flow [2024-06-28 00:51:27,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 57 transitions, 123 flow [2024-06-28 00:51:27,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 00:51:27,514 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;@2d74ed52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 00:51:27,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-28 00:51:27,516 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 00:51:27,517 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 00:51:27,517 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:51:27,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:27,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 00:51:27,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:27,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:27,522 INFO L85 PathProgramCache]: Analyzing trace with hash 241729773, now seen corresponding path program 1 times [2024-06-28 00:51:27,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:27,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694375073] [2024-06-28 00:51:27,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:27,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:27,874 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-28 00:51:27,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:27,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694375073] [2024-06-28 00:51:27,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694375073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:27,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:27,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 00:51:27,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898385388] [2024-06-28 00:51:27,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:27,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 00:51:27,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:27,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 00:51:27,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 00:51:27,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2024-06-28 00:51:27,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-28 00:51:27,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:27,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2024-06-28 00:51:27,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:28,133 INFO L124 PetriNetUnfolderBase]: 455/1155 cut-off events. [2024-06-28 00:51:28,133 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-06-28 00:51:28,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 1155 events. 455/1155 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7148 event pairs, 176 based on Foata normal form. 45/1112 useless extension candidates. Maximal degree in co-relation 1689. Up to 562 conditions per place. [2024-06-28 00:51:28,145 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 26 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2024-06-28 00:51:28,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 192 flow [2024-06-28 00:51:28,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 00:51:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 00:51:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-06-28 00:51:28,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7377049180327869 [2024-06-28 00:51:28,157 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 123 flow. Second operand 3 states and 135 transitions. [2024-06-28 00:51:28,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 192 flow [2024-06-28 00:51:28,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 00:51:28,164 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 135 flow [2024-06-28 00:51:28,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2024-06-28 00:51:28,168 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2024-06-28 00:51:28,168 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 135 flow [2024-06-28 00:51:28,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-28 00:51:28,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:28,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:28,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 00:51:28,170 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:28,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash 374132076, now seen corresponding path program 1 times [2024-06-28 00:51:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:28,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836910955] [2024-06-28 00:51:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:28,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:28,263 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-28 00:51:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:28,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836910955] [2024-06-28 00:51:28,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836910955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:28,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:28,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 00:51:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597410056] [2024-06-28 00:51:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:28,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:51:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:28,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:51:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:51:28,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 61 [2024-06-28 00:51:28,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-28 00:51:28,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:28,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 61 [2024-06-28 00:51:28,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:28,425 INFO L124 PetriNetUnfolderBase]: 544/1270 cut-off events. [2024-06-28 00:51:28,425 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-06-28 00:51:28,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2145 conditions, 1270 events. 544/1270 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7777 event pairs, 204 based on Foata normal form. 11/1190 useless extension candidates. Maximal degree in co-relation 1890. Up to 663 conditions per place. [2024-06-28 00:51:28,433 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 36 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2024-06-28 00:51:28,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 269 flow [2024-06-28 00:51:28,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 00:51:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 00:51:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2024-06-28 00:51:28,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7131147540983607 [2024-06-28 00:51:28,439 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 135 flow. Second operand 4 states and 174 transitions. [2024-06-28 00:51:28,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 269 flow [2024-06-28 00:51:28,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 00:51:28,441 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 187 flow [2024-06-28 00:51:28,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2024-06-28 00:51:28,442 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2024-06-28 00:51:28,442 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 187 flow [2024-06-28 00:51:28,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-28 00:51:28,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:28,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:28,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 00:51:28,446 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:28,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:28,447 INFO L85 PathProgramCache]: Analyzing trace with hash -966928583, now seen corresponding path program 1 times [2024-06-28 00:51:28,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:28,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107815905] [2024-06-28 00:51:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:28,619 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-28 00:51:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:28,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107815905] [2024-06-28 00:51:28,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107815905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:28,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:28,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 00:51:28,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288185604] [2024-06-28 00:51:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:28,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:51:28,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:28,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:51:28,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:51:28,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 61 [2024-06-28 00:51:28,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-28 00:51:28,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:28,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 61 [2024-06-28 00:51:28,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:28,757 INFO L124 PetriNetUnfolderBase]: 540/1221 cut-off events. [2024-06-28 00:51:28,757 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2024-06-28 00:51:28,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2385 conditions, 1221 events. 540/1221 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7340 event pairs, 211 based on Foata normal form. 1/1131 useless extension candidates. Maximal degree in co-relation 2181. Up to 700 conditions per place. [2024-06-28 00:51:28,764 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 35 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2024-06-28 00:51:28,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 307 flow [2024-06-28 00:51:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 00:51:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 00:51:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2024-06-28 00:51:28,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6844262295081968 [2024-06-28 00:51:28,766 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 187 flow. Second operand 4 states and 167 transitions. [2024-06-28 00:51:28,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 307 flow [2024-06-28 00:51:28,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 305 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-28 00:51:28,768 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 236 flow [2024-06-28 00:51:28,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2024-06-28 00:51:28,769 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2024-06-28 00:51:28,769 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 236 flow [2024-06-28 00:51:28,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-28 00:51:28,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:28,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:28,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 00:51:28,770 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:28,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:28,771 INFO L85 PathProgramCache]: Analyzing trace with hash 498737831, now seen corresponding path program 1 times [2024-06-28 00:51:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:28,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398697061] [2024-06-28 00:51:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:28,836 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-28 00:51:28,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:28,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398697061] [2024-06-28 00:51:28,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398697061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:28,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:28,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:51:28,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073431129] [2024-06-28 00:51:28,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:28,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:28,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:28,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:28,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:28,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:28,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 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-28 00:51:28,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:28,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:28,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:29,057 INFO L124 PetriNetUnfolderBase]: 669/1474 cut-off events. [2024-06-28 00:51:29,058 INFO L125 PetriNetUnfolderBase]: For 894/932 co-relation queries the response was YES. [2024-06-28 00:51:29,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3226 conditions, 1474 events. 669/1474 cut-off events. For 894/932 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9582 event pairs, 150 based on Foata normal form. 24/1403 useless extension candidates. Maximal degree in co-relation 2381. Up to 415 conditions per place. [2024-06-28 00:51:29,066 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 54 selfloop transitions, 26 changer transitions 0/108 dead transitions. [2024-06-28 00:51:29,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 108 transitions, 532 flow [2024-06-28 00:51:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 252 transitions. [2024-06-28 00:51:29,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2024-06-28 00:51:29,067 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 236 flow. Second operand 6 states and 252 transitions. [2024-06-28 00:51:29,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 108 transitions, 532 flow [2024-06-28 00:51:29,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 530 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-28 00:51:29,071 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 386 flow [2024-06-28 00:51:29,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2024-06-28 00:51:29,071 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2024-06-28 00:51:29,072 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 386 flow [2024-06-28 00:51:29,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 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-28 00:51:29,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:29,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:29,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 00:51:29,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:29,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash 99610378, now seen corresponding path program 1 times [2024-06-28 00:51:29,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:29,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88978297] [2024-06-28 00:51:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:29,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:29,133 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-28 00:51:29,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:29,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88978297] [2024-06-28 00:51:29,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88978297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:29,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:29,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:51:29,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866682103] [2024-06-28 00:51:29,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:29,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:51:29,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:29,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:51:29,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:51:29,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:29,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 386 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-28 00:51:29,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:29,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:29,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:29,310 INFO L124 PetriNetUnfolderBase]: 691/1493 cut-off events. [2024-06-28 00:51:29,310 INFO L125 PetriNetUnfolderBase]: For 2483/2549 co-relation queries the response was YES. [2024-06-28 00:51:29,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4025 conditions, 1493 events. 691/1493 cut-off events. For 2483/2549 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9146 event pairs, 175 based on Foata normal form. 41/1439 useless extension candidates. Maximal degree in co-relation 3498. Up to 653 conditions per place. [2024-06-28 00:51:29,319 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 59 selfloop transitions, 25 changer transitions 0/112 dead transitions. [2024-06-28 00:51:29,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 112 transitions, 725 flow [2024-06-28 00:51:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:51:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:51:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2024-06-28 00:51:29,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6983606557377049 [2024-06-28 00:51:29,321 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 386 flow. Second operand 5 states and 213 transitions. [2024-06-28 00:51:29,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 112 transitions, 725 flow [2024-06-28 00:51:29,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 112 transitions, 691 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-28 00:51:29,326 INFO L231 Difference]: Finished difference. Result has 80 places, 91 transitions, 550 flow [2024-06-28 00:51:29,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=550, PETRI_PLACES=80, PETRI_TRANSITIONS=91} [2024-06-28 00:51:29,327 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places. [2024-06-28 00:51:29,327 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 91 transitions, 550 flow [2024-06-28 00:51:29,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-28 00:51:29,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:29,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:29,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 00:51:29,328 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:29,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash -789488870, now seen corresponding path program 2 times [2024-06-28 00:51:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:29,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258010825] [2024-06-28 00:51:29,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:29,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:29,384 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-28 00:51:29,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:29,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258010825] [2024-06-28 00:51:29,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258010825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:29,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:29,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:51:29,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813341937] [2024-06-28 00:51:29,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:29,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:51:29,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:29,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:51:29,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:51:29,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:29,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 550 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-28 00:51:29,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:29,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:29,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:29,552 INFO L124 PetriNetUnfolderBase]: 676/1452 cut-off events. [2024-06-28 00:51:29,552 INFO L125 PetriNetUnfolderBase]: For 4047/4146 co-relation queries the response was YES. [2024-06-28 00:51:29,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4495 conditions, 1452 events. 676/1452 cut-off events. For 4047/4146 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9192 event pairs, 172 based on Foata normal form. 62/1429 useless extension candidates. Maximal degree in co-relation 3459. Up to 650 conditions per place. [2024-06-28 00:51:29,562 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 58 selfloop transitions, 26 changer transitions 0/112 dead transitions. [2024-06-28 00:51:29,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 112 transitions, 831 flow [2024-06-28 00:51:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:51:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:51:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2024-06-28 00:51:29,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6852459016393443 [2024-06-28 00:51:29,563 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 550 flow. Second operand 5 states and 209 transitions. [2024-06-28 00:51:29,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 112 transitions, 831 flow [2024-06-28 00:51:29,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 112 transitions, 817 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-06-28 00:51:29,571 INFO L231 Difference]: Finished difference. Result has 86 places, 96 transitions, 662 flow [2024-06-28 00:51:29,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=662, PETRI_PLACES=86, PETRI_TRANSITIONS=96} [2024-06-28 00:51:29,573 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2024-06-28 00:51:29,574 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 96 transitions, 662 flow [2024-06-28 00:51:29,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-28 00:51:29,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:29,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:29,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 00:51:29,575 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:29,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:29,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1183963254, now seen corresponding path program 1 times [2024-06-28 00:51:29,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:29,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550597979] [2024-06-28 00:51:29,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:29,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:29,621 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-28 00:51:29,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550597979] [2024-06-28 00:51:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550597979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:29,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:29,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:51:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376447997] [2024-06-28 00:51:29,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:29,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:51:29,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:29,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:51:29,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:51:29,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2024-06-28 00:51:29,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 96 transitions, 662 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-28 00:51:29,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:29,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2024-06-28 00:51:29,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:29,773 INFO L124 PetriNetUnfolderBase]: 633/1497 cut-off events. [2024-06-28 00:51:29,773 INFO L125 PetriNetUnfolderBase]: For 4218/4322 co-relation queries the response was YES. [2024-06-28 00:51:29,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4537 conditions, 1497 events. 633/1497 cut-off events. For 4218/4322 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10177 event pairs, 107 based on Foata normal form. 50/1398 useless extension candidates. Maximal degree in co-relation 4406. Up to 236 conditions per place. [2024-06-28 00:51:29,782 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 41 selfloop transitions, 28 changer transitions 0/121 dead transitions. [2024-06-28 00:51:29,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 121 transitions, 875 flow [2024-06-28 00:51:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:51:29,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:51:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2024-06-28 00:51:29,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7639344262295082 [2024-06-28 00:51:29,783 INFO L175 Difference]: Start difference. First operand has 86 places, 96 transitions, 662 flow. Second operand 5 states and 233 transitions. [2024-06-28 00:51:29,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 121 transitions, 875 flow [2024-06-28 00:51:29,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 121 transitions, 841 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-28 00:51:29,793 INFO L231 Difference]: Finished difference. Result has 91 places, 100 transitions, 747 flow [2024-06-28 00:51:29,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=747, PETRI_PLACES=91, PETRI_TRANSITIONS=100} [2024-06-28 00:51:29,795 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 35 predicate places. [2024-06-28 00:51:29,795 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 747 flow [2024-06-28 00:51:29,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-28 00:51:29,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:29,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:29,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 00:51:29,796 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:29,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash -420949463, now seen corresponding path program 1 times [2024-06-28 00:51:29,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:29,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147752448] [2024-06-28 00:51:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:29,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:29,864 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-28 00:51:29,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:29,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147752448] [2024-06-28 00:51:29,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147752448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:29,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:29,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:51:29,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653085979] [2024-06-28 00:51:29,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:29,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:29,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:29,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:29,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:29,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:29,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 100 transitions, 747 flow. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 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-28 00:51:29,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:29,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:29,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:30,086 INFO L124 PetriNetUnfolderBase]: 1061/2187 cut-off events. [2024-06-28 00:51:30,087 INFO L125 PetriNetUnfolderBase]: For 9519/9841 co-relation queries the response was YES. [2024-06-28 00:51:30,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7595 conditions, 2187 events. 1061/2187 cut-off events. For 9519/9841 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14642 event pairs, 158 based on Foata normal form. 43/2119 useless extension candidates. Maximal degree in co-relation 6480. Up to 687 conditions per place. [2024-06-28 00:51:30,102 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 67 selfloop transitions, 41 changer transitions 0/138 dead transitions. [2024-06-28 00:51:30,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 138 transitions, 1182 flow [2024-06-28 00:51:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 249 transitions. [2024-06-28 00:51:30,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.680327868852459 [2024-06-28 00:51:30,103 INFO L175 Difference]: Start difference. First operand has 91 places, 100 transitions, 747 flow. Second operand 6 states and 249 transitions. [2024-06-28 00:51:30,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 138 transitions, 1182 flow [2024-06-28 00:51:30,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 138 transitions, 1182 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 00:51:30,114 INFO L231 Difference]: Finished difference. Result has 99 places, 110 transitions, 994 flow [2024-06-28 00:51:30,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=994, PETRI_PLACES=99, PETRI_TRANSITIONS=110} [2024-06-28 00:51:30,115 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 43 predicate places. [2024-06-28 00:51:30,115 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 110 transitions, 994 flow [2024-06-28 00:51:30,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 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-28 00:51:30,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:30,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:30,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 00:51:30,116 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:30,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1505387401, now seen corresponding path program 1 times [2024-06-28 00:51:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:30,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501013952] [2024-06-28 00:51:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:30,168 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-28 00:51:30,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:30,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501013952] [2024-06-28 00:51:30,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501013952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:30,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:30,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:51:30,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162647457] [2024-06-28 00:51:30,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:30,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:51:30,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:30,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:51:30,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:51:30,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 61 [2024-06-28 00:51:30,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 110 transitions, 994 flow. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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-28 00:51:30,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:30,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 61 [2024-06-28 00:51:30,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:30,442 INFO L124 PetriNetUnfolderBase]: 1055/2182 cut-off events. [2024-06-28 00:51:30,442 INFO L125 PetriNetUnfolderBase]: For 14667/15018 co-relation queries the response was YES. [2024-06-28 00:51:30,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8723 conditions, 2182 events. 1055/2182 cut-off events. For 14667/15018 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14549 event pairs, 379 based on Foata normal form. 28/2083 useless extension candidates. Maximal degree in co-relation 8517. Up to 1516 conditions per place. [2024-06-28 00:51:30,457 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 73 selfloop transitions, 10 changer transitions 0/120 dead transitions. [2024-06-28 00:51:30,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 120 transitions, 1202 flow [2024-06-28 00:51:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:51:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:51:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 202 transitions. [2024-06-28 00:51:30,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6622950819672131 [2024-06-28 00:51:30,459 INFO L175 Difference]: Start difference. First operand has 99 places, 110 transitions, 994 flow. Second operand 5 states and 202 transitions. [2024-06-28 00:51:30,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 120 transitions, 1202 flow [2024-06-28 00:51:30,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 120 transitions, 1138 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-28 00:51:30,475 INFO L231 Difference]: Finished difference. Result has 102 places, 112 transitions, 971 flow [2024-06-28 00:51:30,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=971, PETRI_PLACES=102, PETRI_TRANSITIONS=112} [2024-06-28 00:51:30,476 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 46 predicate places. [2024-06-28 00:51:30,476 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 112 transitions, 971 flow [2024-06-28 00:51:30,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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-28 00:51:30,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:30,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:30,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 00:51:30,480 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:30,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:30,480 INFO L85 PathProgramCache]: Analyzing trace with hash 321013558, now seen corresponding path program 1 times [2024-06-28 00:51:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:30,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782513425] [2024-06-28 00:51:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:30,515 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-28 00:51:30,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:30,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782513425] [2024-06-28 00:51:30,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782513425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:30,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:30,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:51:30,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638719296] [2024-06-28 00:51:30,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:30,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:51:30,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:30,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:51:30,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:51:30,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 61 [2024-06-28 00:51:30,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 112 transitions, 971 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-28 00:51:30,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:30,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 61 [2024-06-28 00:51:30,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:30,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([298] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][65], [Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 65#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 20#L745true, 104#true, Black: 70#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 75#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 76#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 83#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 84#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 82#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 81#(= ~flag2~0 0), Black: 91#(and (= ~x~0 0) (= ~turn~0 0)), Black: 93#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 92#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), 132#(= thr2Thread1of1ForFork0_~f1~0 1), Black: 101#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 99#(and (= ~x~0 0) (= ~turn~0 0)), 97#true, Black: 106#(= ~flag2~0 0), Black: 107#(= 0 thr1Thread1of1ForFork1_~f2~0), Black: 109#(and (= 0 thr1Thread1of1ForFork1_~f2~0) (= ~flag2~0 0)), 17#L777true, 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 115#(= ~flag2~0 0), Black: 116#(and (= ~x~0 0) (= ~flag2~0 0)), 123#true, Black: 117#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 89#true]) [2024-06-28 00:51:30,693 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-06-28 00:51:30,693 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 00:51:30,693 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 00:51:30,693 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 00:51:30,774 INFO L124 PetriNetUnfolderBase]: 962/2337 cut-off events. [2024-06-28 00:51:30,774 INFO L125 PetriNetUnfolderBase]: For 10504/10620 co-relation queries the response was YES. [2024-06-28 00:51:30,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8063 conditions, 2337 events. 962/2337 cut-off events. For 10504/10620 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18442 event pairs, 224 based on Foata normal form. 83/2218 useless extension candidates. Maximal degree in co-relation 7523. Up to 463 conditions per place. [2024-06-28 00:51:30,796 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 39 selfloop transitions, 28 changer transitions 0/140 dead transitions. [2024-06-28 00:51:30,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 140 transitions, 1233 flow [2024-06-28 00:51:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:51:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:51:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2024-06-28 00:51:30,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7639344262295082 [2024-06-28 00:51:30,798 INFO L175 Difference]: Start difference. First operand has 102 places, 112 transitions, 971 flow. Second operand 5 states and 233 transitions. [2024-06-28 00:51:30,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 140 transitions, 1233 flow [2024-06-28 00:51:30,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 140 transitions, 1210 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 00:51:30,819 INFO L231 Difference]: Finished difference. Result has 106 places, 122 transitions, 1123 flow [2024-06-28 00:51:30,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1123, PETRI_PLACES=106, PETRI_TRANSITIONS=122} [2024-06-28 00:51:30,820 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 50 predicate places. [2024-06-28 00:51:30,820 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 122 transitions, 1123 flow [2024-06-28 00:51:30,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-28 00:51:30,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:30,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:30,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 00:51:30,821 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:30,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:30,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2055865628, now seen corresponding path program 2 times [2024-06-28 00:51:30,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:30,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115586227] [2024-06-28 00:51:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:30,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:30,896 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-28 00:51:30,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:30,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115586227] [2024-06-28 00:51:30,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115586227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:30,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:30,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:51:30,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468188751] [2024-06-28 00:51:30,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:30,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:30,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:30,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:30,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:30,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:30,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 122 transitions, 1123 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 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-28 00:51:30,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:30,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:30,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:31,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([298] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][73], [Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 139#true, Black: 65#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 20#L745true, 104#true, Black: 70#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 131#(= ~flag1~0 1), Black: 134#(and (= thr2Thread1of1ForFork0_~f1~0 1) (= ~flag1~0 1)), Black: 75#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 76#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 83#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 84#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 82#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 81#(= ~flag2~0 0), Black: 91#(and (= ~x~0 0) (= ~turn~0 0)), Black: 93#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 92#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), 132#(= thr2Thread1of1ForFork0_~f1~0 1), Black: 101#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 99#(and (= ~x~0 0) (= ~turn~0 0)), 97#true, Black: 106#(= ~flag2~0 0), Black: 107#(= 0 thr1Thread1of1ForFork1_~f2~0), Black: 109#(and (= 0 thr1Thread1of1ForFork1_~f2~0) (= ~flag2~0 0)), 17#L777true, 34#L793-5true, Black: 115#(= ~flag2~0 0), Black: 116#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 117#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 89#true]) [2024-06-28 00:51:31,222 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-28 00:51:31,222 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 00:51:31,222 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 00:51:31,222 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 00:51:31,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([298] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][73], [Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 139#true, Black: 65#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 20#L745true, 104#true, Black: 70#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 131#(= ~flag1~0 1), Black: 134#(and (= thr2Thread1of1ForFork0_~f1~0 1) (= ~flag1~0 1)), Black: 75#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 76#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 83#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 84#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 82#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 81#(= ~flag2~0 0), Black: 91#(and (= ~x~0 0) (= ~turn~0 0)), Black: 93#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 92#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), 26#L794true, 132#(= thr2Thread1of1ForFork0_~f1~0 1), Black: 101#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 99#(and (= ~x~0 0) (= ~turn~0 0)), 97#true, Black: 106#(= ~flag2~0 0), Black: 107#(= 0 thr1Thread1of1ForFork1_~f2~0), Black: 109#(and (= 0 thr1Thread1of1ForFork1_~f2~0) (= ~flag2~0 0)), 17#L777true, Black: 115#(= ~flag2~0 0), Black: 116#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 117#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 89#true]) [2024-06-28 00:51:31,224 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 00:51:31,224 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 00:51:31,225 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 00:51:31,225 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 00:51:31,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([298] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][73], [Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 139#true, Black: 65#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 20#L745true, 104#true, Black: 70#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 131#(= ~flag1~0 1), Black: 134#(and (= thr2Thread1of1ForFork0_~f1~0 1) (= ~flag1~0 1)), Black: 75#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 76#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 83#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 84#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 82#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 81#(= ~flag2~0 0), Black: 91#(and (= ~x~0 0) (= ~turn~0 0)), Black: 93#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 92#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), 132#(= thr2Thread1of1ForFork0_~f1~0 1), Black: 101#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 99#(and (= ~x~0 0) (= ~turn~0 0)), 97#true, Black: 106#(= ~flag2~0 0), Black: 107#(= 0 thr1Thread1of1ForFork1_~f2~0), Black: 109#(and (= 0 thr1Thread1of1ForFork1_~f2~0) (= ~flag2~0 0)), 17#L777true, 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 115#(= ~flag2~0 0), Black: 116#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 117#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 89#true]) [2024-06-28 00:51:31,228 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 00:51:31,229 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 00:51:31,229 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 00:51:31,229 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 00:51:31,234 INFO L124 PetriNetUnfolderBase]: 1489/3129 cut-off events. [2024-06-28 00:51:31,234 INFO L125 PetriNetUnfolderBase]: For 21173/21462 co-relation queries the response was YES. [2024-06-28 00:51:31,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13031 conditions, 3129 events. 1489/3129 cut-off events. For 21173/21462 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 23385 event pairs, 465 based on Foata normal form. 104/3045 useless extension candidates. Maximal degree in co-relation 9085. Up to 1270 conditions per place. [2024-06-28 00:51:31,256 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 78 selfloop transitions, 42 changer transitions 0/153 dead transitions. [2024-06-28 00:51:31,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 153 transitions, 1544 flow [2024-06-28 00:51:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 252 transitions. [2024-06-28 00:51:31,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2024-06-28 00:51:31,259 INFO L175 Difference]: Start difference. First operand has 106 places, 122 transitions, 1123 flow. Second operand 6 states and 252 transitions. [2024-06-28 00:51:31,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 153 transitions, 1544 flow [2024-06-28 00:51:31,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 153 transitions, 1544 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 00:51:31,293 INFO L231 Difference]: Finished difference. Result has 113 places, 131 transitions, 1318 flow [2024-06-28 00:51:31,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1318, PETRI_PLACES=113, PETRI_TRANSITIONS=131} [2024-06-28 00:51:31,293 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 57 predicate places. [2024-06-28 00:51:31,294 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 131 transitions, 1318 flow [2024-06-28 00:51:31,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 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-28 00:51:31,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:31,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:31,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 00:51:31,294 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:31,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:31,295 INFO L85 PathProgramCache]: Analyzing trace with hash 726752118, now seen corresponding path program 3 times [2024-06-28 00:51:31,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:31,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695825812] [2024-06-28 00:51:31,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:31,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:31,364 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-28 00:51:31,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:31,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695825812] [2024-06-28 00:51:31,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695825812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:31,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:31,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:51:31,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639025155] [2024-06-28 00:51:31,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:31,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:31,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:31,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:31,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:31,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:31,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 131 transitions, 1318 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 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-28 00:51:31,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:31,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:31,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:31,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([298] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][69], [Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 139#true, Black: 65#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 20#L745true, 104#true, Black: 70#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 131#(= ~flag1~0 1), Black: 134#(and (= thr2Thread1of1ForFork0_~f1~0 1) (= ~flag1~0 1)), Black: 75#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 76#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 144#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 142#(and (= ~flag2~0 1) (= ~turn~0 0)), 147#true, Black: 83#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 84#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 82#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 81#(= ~flag2~0 0), Black: 91#(and (= ~x~0 0) (= ~turn~0 0)), Black: 93#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 92#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), 132#(= thr2Thread1of1ForFork0_~f1~0 1), Black: 101#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 99#(and (= ~x~0 0) (= ~turn~0 0)), 97#true, Black: 106#(= ~flag2~0 0), Black: 107#(= 0 thr1Thread1of1ForFork1_~f2~0), Black: 109#(and (= 0 thr1Thread1of1ForFork1_~f2~0) (= ~flag2~0 0)), 17#L777true, 34#L793-5true, Black: 115#(= ~flag2~0 0), Black: 116#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 117#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 89#true]) [2024-06-28 00:51:31,678 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-28 00:51:31,678 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 00:51:31,678 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 00:51:31,678 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 00:51:31,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([298] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][69], [Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 139#true, Black: 65#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 20#L745true, 104#true, Black: 70#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 131#(= ~flag1~0 1), Black: 134#(and (= thr2Thread1of1ForFork0_~f1~0 1) (= ~flag1~0 1)), Black: 75#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 76#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 144#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 142#(and (= ~flag2~0 1) (= ~turn~0 0)), 147#true, Black: 83#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 84#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 82#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 81#(= ~flag2~0 0), Black: 91#(and (= ~x~0 0) (= ~turn~0 0)), Black: 93#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 92#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), 26#L794true, 132#(= thr2Thread1of1ForFork0_~f1~0 1), Black: 101#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 99#(and (= ~x~0 0) (= ~turn~0 0)), 97#true, Black: 106#(= ~flag2~0 0), Black: 107#(= 0 thr1Thread1of1ForFork1_~f2~0), Black: 109#(and (= 0 thr1Thread1of1ForFork1_~f2~0) (= ~flag2~0 0)), 17#L777true, Black: 115#(= ~flag2~0 0), Black: 116#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 117#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 89#true]) [2024-06-28 00:51:31,680 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 00:51:31,681 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 00:51:31,681 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 00:51:31,681 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 00:51:31,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([298] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][69], [Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 139#true, Black: 65#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 20#L745true, 104#true, Black: 70#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 131#(= ~flag1~0 1), Black: 134#(and (= thr2Thread1of1ForFork0_~f1~0 1) (= ~flag1~0 1)), Black: 75#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 76#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 144#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 142#(and (= ~flag2~0 1) (= ~turn~0 0)), 147#true, Black: 83#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 84#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 82#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 81#(= ~flag2~0 0), Black: 91#(and (= ~x~0 0) (= ~turn~0 0)), Black: 93#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 92#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), 132#(= thr2Thread1of1ForFork0_~f1~0 1), Black: 101#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 99#(and (= ~x~0 0) (= ~turn~0 0)), 97#true, Black: 106#(= ~flag2~0 0), Black: 107#(= 0 thr1Thread1of1ForFork1_~f2~0), Black: 109#(and (= 0 thr1Thread1of1ForFork1_~f2~0) (= ~flag2~0 0)), 17#L777true, 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 115#(= ~flag2~0 0), Black: 116#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 117#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 89#true]) [2024-06-28 00:51:31,685 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 00:51:31,685 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 00:51:31,685 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 00:51:31,685 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 00:51:31,690 INFO L124 PetriNetUnfolderBase]: 1467/3079 cut-off events. [2024-06-28 00:51:31,690 INFO L125 PetriNetUnfolderBase]: For 26620/26923 co-relation queries the response was YES. [2024-06-28 00:51:31,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13919 conditions, 3079 events. 1467/3079 cut-off events. For 26620/26923 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22918 event pairs, 456 based on Foata normal form. 111/3011 useless extension candidates. Maximal degree in co-relation 9780. Up to 1271 conditions per place. [2024-06-28 00:51:31,712 INFO L140 encePairwiseOnDemand]: 48/61 looper letters, 80 selfloop transitions, 40 changer transitions 0/153 dead transitions. [2024-06-28 00:51:31,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 153 transitions, 1696 flow [2024-06-28 00:51:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 250 transitions. [2024-06-28 00:51:31,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6830601092896175 [2024-06-28 00:51:31,713 INFO L175 Difference]: Start difference. First operand has 113 places, 131 transitions, 1318 flow. Second operand 6 states and 250 transitions. [2024-06-28 00:51:31,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 153 transitions, 1696 flow [2024-06-28 00:51:31,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 153 transitions, 1661 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-28 00:51:31,744 INFO L231 Difference]: Finished difference. Result has 119 places, 133 transitions, 1401 flow [2024-06-28 00:51:31,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1401, PETRI_PLACES=119, PETRI_TRANSITIONS=133} [2024-06-28 00:51:31,744 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 63 predicate places. [2024-06-28 00:51:31,744 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 133 transitions, 1401 flow [2024-06-28 00:51:31,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 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-28 00:51:31,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:31,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:31,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 00:51:31,745 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:31,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash 726736370, now seen corresponding path program 1 times [2024-06-28 00:51:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:31,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854660798] [2024-06-28 00:51:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:31,806 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-28 00:51:31,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:31,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854660798] [2024-06-28 00:51:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854660798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:31,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:51:31,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470597955] [2024-06-28 00:51:31,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:31,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:31,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:31,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:31,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:31,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:31,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 133 transitions, 1401 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 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-28 00:51:31,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:31,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:31,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:32,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([298] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][66], [Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 139#true, Black: 65#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 20#L745true, 104#true, Black: 70#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), 157#(= ~flag1~0 0), Black: 131#(= ~flag1~0 1), Black: 134#(and (= thr2Thread1of1ForFork0_~f1~0 1) (= ~flag1~0 1)), Black: 75#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 76#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 144#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 142#(and (= ~flag2~0 1) (= ~turn~0 0)), 147#true, Black: 83#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 84#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 82#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 81#(= ~flag2~0 0), Black: 151#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 152#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 91#(and (= ~x~0 0) (= ~turn~0 0)), Black: 93#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 92#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), 132#(= thr2Thread1of1ForFork0_~f1~0 1), Black: 101#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 99#(and (= ~x~0 0) (= ~turn~0 0)), 73#true, 97#true, Black: 106#(= ~flag2~0 0), Black: 107#(= 0 thr1Thread1of1ForFork1_~f2~0), Black: 109#(and (= 0 thr1Thread1of1ForFork1_~f2~0) (= ~flag2~0 0)), 17#L777true, 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 115#(= ~flag2~0 0), Black: 116#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 117#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 89#true]) [2024-06-28 00:51:32,166 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-06-28 00:51:32,167 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 00:51:32,167 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 00:51:32,167 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 00:51:32,219 INFO L124 PetriNetUnfolderBase]: 1591/3356 cut-off events. [2024-06-28 00:51:32,219 INFO L125 PetriNetUnfolderBase]: For 33087/33486 co-relation queries the response was YES. [2024-06-28 00:51:32,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15714 conditions, 3356 events. 1591/3356 cut-off events. For 33087/33486 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 25328 event pairs, 490 based on Foata normal form. 55/3216 useless extension candidates. Maximal degree in co-relation 14832. Up to 1258 conditions per place. [2024-06-28 00:51:32,244 INFO L140 encePairwiseOnDemand]: 48/61 looper letters, 87 selfloop transitions, 53 changer transitions 2/175 dead transitions. [2024-06-28 00:51:32,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 175 transitions, 2051 flow [2024-06-28 00:51:32,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 246 transitions. [2024-06-28 00:51:32,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2024-06-28 00:51:32,246 INFO L175 Difference]: Start difference. First operand has 119 places, 133 transitions, 1401 flow. Second operand 6 states and 246 transitions. [2024-06-28 00:51:32,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 175 transitions, 2051 flow [2024-06-28 00:51:32,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 175 transitions, 1996 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-28 00:51:32,289 INFO L231 Difference]: Finished difference. Result has 126 places, 148 transitions, 1744 flow [2024-06-28 00:51:32,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1744, PETRI_PLACES=126, PETRI_TRANSITIONS=148} [2024-06-28 00:51:32,290 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 70 predicate places. [2024-06-28 00:51:32,290 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 148 transitions, 1744 flow [2024-06-28 00:51:32,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 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-28 00:51:32,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:32,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:32,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 00:51:32,292 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:32,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:32,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1477200380, now seen corresponding path program 1 times [2024-06-28 00:51:32,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:32,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144150366] [2024-06-28 00:51:32,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:32,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:32,333 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-28 00:51:32,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:32,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144150366] [2024-06-28 00:51:32,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144150366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:32,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:32,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:51:32,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722755581] [2024-06-28 00:51:32,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:32,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:51:32,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:32,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:51:32,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:51:32,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2024-06-28 00:51:32,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 148 transitions, 1744 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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-28 00:51:32,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:32,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2024-06-28 00:51:32,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:32,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([298] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][60], [Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 139#true, Black: 65#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 20#L745true, 104#true, Black: 70#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), 157#(= ~flag1~0 0), Black: 131#(= ~flag1~0 1), Black: 134#(and (= thr2Thread1of1ForFork0_~f1~0 1) (= ~flag1~0 1)), Black: 75#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 76#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), 167#(<= ~flag1~0 0), 51#L756true, Black: 144#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 142#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 83#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 84#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 82#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 81#(= ~flag2~0 0), Black: 151#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 152#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 91#(and (= ~x~0 0) (= ~turn~0 0)), Black: 93#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 92#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 160#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), 132#(= thr2Thread1of1ForFork0_~f1~0 1), Black: 159#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 158#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 101#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 99#(and (= ~x~0 0) (= ~turn~0 0)), 73#true, 97#true, Black: 106#(= ~flag2~0 0), Black: 107#(= 0 thr1Thread1of1ForFork1_~f2~0), Black: 109#(and (= 0 thr1Thread1of1ForFork1_~f2~0) (= ~flag2~0 0)), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 115#(= ~flag2~0 0), Black: 116#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 117#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 89#true]) [2024-06-28 00:51:32,519 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-06-28 00:51:32,519 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 00:51:32,519 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 00:51:32,519 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-28 00:51:32,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([273] L760-->L762: Formula: (= v_~flag2~0_2 0) InVars {} OutVars{~flag2~0=v_~flag2~0_2} AuxVars[] AssignedVars[~flag2~0][96], [Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 139#true, Black: 65#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 70#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 132#(= thr2Thread1of1ForFork0_~f1~0 1), 47#L742true, Black: 131#(= ~flag1~0 1), 134#(and (= thr2Thread1of1ForFork0_~f1~0 1) (= ~flag1~0 1)), 155#true, Black: 75#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 81#(= ~flag2~0 0), Black: 76#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 144#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), 106#(= ~flag2~0 0), Black: 142#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 83#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 84#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 82#(and (= ~flag1~0 1) (= ~flag2~0 0)), 165#true, Black: 151#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 152#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 91#(and (= ~x~0 0) (= ~turn~0 0)), Black: 93#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 92#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 160#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 157#(= ~flag1~0 0), Black: 159#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 158#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 101#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 99#(and (= ~x~0 0) (= ~turn~0 0)), 97#true, 52#L762true, Black: 107#(= 0 thr1Thread1of1ForFork1_~f2~0), Black: 109#(and (= 0 thr1Thread1of1ForFork1_~f2~0) (= ~flag2~0 0)), 115#(= ~flag2~0 0), 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 116#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 117#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 89#true]) [2024-06-28 00:51:32,561 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 00:51:32,561 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 00:51:32,561 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 00:51:32,561 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-28 00:51:32,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([298] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][60], [Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 139#true, Black: 65#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 20#L745true, 104#true, Black: 70#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), 157#(= ~flag1~0 0), Black: 131#(= ~flag1~0 1), Black: 134#(and (= thr2Thread1of1ForFork0_~f1~0 1) (= ~flag1~0 1)), Black: 75#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), Black: 76#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), 167#(<= ~flag1~0 0), Black: 144#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 142#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 83#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 84#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 82#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 81#(= ~flag2~0 0), Black: 151#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 152#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 91#(and (= ~x~0 0) (= ~turn~0 0)), Black: 93#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 92#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 160#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 159#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), 132#(= thr2Thread1of1ForFork0_~f1~0 1), Black: 158#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 101#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 99#(and (= ~x~0 0) (= ~turn~0 0)), 97#true, Black: 106#(= ~flag2~0 0), Black: 107#(= 0 thr1Thread1of1ForFork1_~f2~0), Black: 109#(and (= 0 thr1Thread1of1ForFork1_~f2~0) (= ~flag2~0 0)), 17#L777true, 27#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 115#(= ~flag2~0 0), Black: 116#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 117#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 118#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), thr2Thread1of1ForFork0InUse, 89#true]) [2024-06-28 00:51:32,563 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 00:51:32,563 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 00:51:32,563 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 00:51:32,563 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 00:51:32,572 INFO L124 PetriNetUnfolderBase]: 880/2112 cut-off events. [2024-06-28 00:51:32,573 INFO L125 PetriNetUnfolderBase]: For 19492/19615 co-relation queries the response was YES. [2024-06-28 00:51:32,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9350 conditions, 2112 events. 880/2112 cut-off events. For 19492/19615 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15837 event pairs, 201 based on Foata normal form. 74/2006 useless extension candidates. Maximal degree in co-relation 8841. Up to 338 conditions per place. [2024-06-28 00:51:32,585 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 41 selfloop transitions, 37 changer transitions 0/160 dead transitions. [2024-06-28 00:51:32,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 160 transitions, 1885 flow [2024-06-28 00:51:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:51:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:51:32,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-06-28 00:51:32,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7442622950819672 [2024-06-28 00:51:32,587 INFO L175 Difference]: Start difference. First operand has 126 places, 148 transitions, 1744 flow. Second operand 5 states and 227 transitions. [2024-06-28 00:51:32,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 160 transitions, 1885 flow [2024-06-28 00:51:32,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 160 transitions, 1812 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-28 00:51:32,617 INFO L231 Difference]: Finished difference. Result has 129 places, 144 transitions, 1705 flow [2024-06-28 00:51:32,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1705, PETRI_PLACES=129, PETRI_TRANSITIONS=144} [2024-06-28 00:51:32,618 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 73 predicate places. [2024-06-28 00:51:32,618 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 144 transitions, 1705 flow [2024-06-28 00:51:32,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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-28 00:51:32,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:32,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:32,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 00:51:32,619 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:32,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:32,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1040144711, now seen corresponding path program 1 times [2024-06-28 00:51:32,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:32,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404482319] [2024-06-28 00:51:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:32,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:32,681 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-28 00:51:32,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:32,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404482319] [2024-06-28 00:51:32,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404482319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:32,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:32,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:51:32,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986876372] [2024-06-28 00:51:32,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:32,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:32,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:32,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:32,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:32,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:32,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 144 transitions, 1705 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:32,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:32,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:32,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:32,992 INFO L124 PetriNetUnfolderBase]: 1149/2506 cut-off events. [2024-06-28 00:51:32,992 INFO L125 PetriNetUnfolderBase]: For 29340/29515 co-relation queries the response was YES. [2024-06-28 00:51:33,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12309 conditions, 2506 events. 1149/2506 cut-off events. For 29340/29515 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18133 event pairs, 283 based on Foata normal form. 41/2416 useless extension candidates. Maximal degree in co-relation 11720. Up to 911 conditions per place. [2024-06-28 00:51:33,010 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 91 selfloop transitions, 52 changer transitions 3/178 dead transitions. [2024-06-28 00:51:33,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 178 transitions, 2268 flow [2024-06-28 00:51:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 245 transitions. [2024-06-28 00:51:33,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6693989071038251 [2024-06-28 00:51:33,012 INFO L175 Difference]: Start difference. First operand has 129 places, 144 transitions, 1705 flow. Second operand 6 states and 245 transitions. [2024-06-28 00:51:33,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 178 transitions, 2268 flow [2024-06-28 00:51:33,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 178 transitions, 2237 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 00:51:33,060 INFO L231 Difference]: Finished difference. Result has 137 places, 151 transitions, 1950 flow [2024-06-28 00:51:33,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1677, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1950, PETRI_PLACES=137, PETRI_TRANSITIONS=151} [2024-06-28 00:51:33,062 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 81 predicate places. [2024-06-28 00:51:33,062 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 151 transitions, 1950 flow [2024-06-28 00:51:33,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:33,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:33,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:33,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 00:51:33,063 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:33,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:33,063 INFO L85 PathProgramCache]: Analyzing trace with hash 739313367, now seen corresponding path program 1 times [2024-06-28 00:51:33,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:33,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756898456] [2024-06-28 00:51:33,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:33,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:33,133 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-28 00:51:33,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:33,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756898456] [2024-06-28 00:51:33,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756898456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:33,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:33,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:33,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336358627] [2024-06-28 00:51:33,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:33,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:33,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:33,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:33,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:33,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:33,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 151 transitions, 1950 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:33,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:33,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:33,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:33,455 INFO L124 PetriNetUnfolderBase]: 1227/2639 cut-off events. [2024-06-28 00:51:33,455 INFO L125 PetriNetUnfolderBase]: For 38868/39071 co-relation queries the response was YES. [2024-06-28 00:51:33,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14130 conditions, 2639 events. 1227/2639 cut-off events. For 38868/39071 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19241 event pairs, 404 based on Foata normal form. 91/2609 useless extension candidates. Maximal degree in co-relation 13448. Up to 1061 conditions per place. [2024-06-28 00:51:33,475 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 95 selfloop transitions, 67 changer transitions 0/194 dead transitions. [2024-06-28 00:51:33,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 194 transitions, 2697 flow [2024-06-28 00:51:33,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2024-06-28 00:51:33,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7021857923497268 [2024-06-28 00:51:33,477 INFO L175 Difference]: Start difference. First operand has 137 places, 151 transitions, 1950 flow. Second operand 6 states and 257 transitions. [2024-06-28 00:51:33,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 194 transitions, 2697 flow [2024-06-28 00:51:33,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 194 transitions, 2623 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-28 00:51:33,537 INFO L231 Difference]: Finished difference. Result has 143 places, 158 transitions, 2194 flow [2024-06-28 00:51:33,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2194, PETRI_PLACES=143, PETRI_TRANSITIONS=158} [2024-06-28 00:51:33,538 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 87 predicate places. [2024-06-28 00:51:33,538 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 158 transitions, 2194 flow [2024-06-28 00:51:33,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:33,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:33,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:33,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 00:51:33,539 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:33,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash 711633777, now seen corresponding path program 2 times [2024-06-28 00:51:33,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:33,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021832119] [2024-06-28 00:51:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:33,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:33,595 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-28 00:51:33,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:33,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021832119] [2024-06-28 00:51:33,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021832119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:33,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:33,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:33,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350230064] [2024-06-28 00:51:33,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:33,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:33,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:33,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:33,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:33,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:33,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 158 transitions, 2194 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:33,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:33,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:33,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:33,967 INFO L124 PetriNetUnfolderBase]: 1257/2716 cut-off events. [2024-06-28 00:51:33,967 INFO L125 PetriNetUnfolderBase]: For 44930/45205 co-relation queries the response was YES. [2024-06-28 00:51:33,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15580 conditions, 2716 events. 1257/2716 cut-off events. For 44930/45205 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 19899 event pairs, 427 based on Foata normal form. 62/2647 useless extension candidates. Maximal degree in co-relation 14864. Up to 1077 conditions per place. [2024-06-28 00:51:33,991 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 93 selfloop transitions, 69 changer transitions 0/194 dead transitions. [2024-06-28 00:51:33,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 194 transitions, 2919 flow [2024-06-28 00:51:33,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2024-06-28 00:51:33,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6639344262295082 [2024-06-28 00:51:33,993 INFO L175 Difference]: Start difference. First operand has 143 places, 158 transitions, 2194 flow. Second operand 6 states and 243 transitions. [2024-06-28 00:51:33,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 194 transitions, 2919 flow [2024-06-28 00:51:34,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 194 transitions, 2757 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-28 00:51:34,062 INFO L231 Difference]: Finished difference. Result has 148 places, 167 transitions, 2408 flow [2024-06-28 00:51:34,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2038, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2408, PETRI_PLACES=148, PETRI_TRANSITIONS=167} [2024-06-28 00:51:34,062 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 92 predicate places. [2024-06-28 00:51:34,062 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 167 transitions, 2408 flow [2024-06-28 00:51:34,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:34,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:34,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:34,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 00:51:34,064 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:34,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash -901477339, now seen corresponding path program 3 times [2024-06-28 00:51:34,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:34,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371770342] [2024-06-28 00:51:34,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:34,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:34,166 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-28 00:51:34,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:34,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371770342] [2024-06-28 00:51:34,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371770342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:34,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:34,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:34,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468236875] [2024-06-28 00:51:34,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:34,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:34,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:34,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:34,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:34,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:34,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 167 transitions, 2408 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:34,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:34,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:34,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:34,556 INFO L124 PetriNetUnfolderBase]: 1261/2724 cut-off events. [2024-06-28 00:51:34,557 INFO L125 PetriNetUnfolderBase]: For 48731/49048 co-relation queries the response was YES. [2024-06-28 00:51:34,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16059 conditions, 2724 events. 1261/2724 cut-off events. For 48731/49048 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19840 event pairs, 503 based on Foata normal form. 87/2683 useless extension candidates. Maximal degree in co-relation 15345. Up to 1085 conditions per place. [2024-06-28 00:51:34,615 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 80 selfloop transitions, 76 changer transitions 0/188 dead transitions. [2024-06-28 00:51:34,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 188 transitions, 2950 flow [2024-06-28 00:51:34,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2024-06-28 00:51:34,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6366120218579235 [2024-06-28 00:51:34,617 INFO L175 Difference]: Start difference. First operand has 148 places, 167 transitions, 2408 flow. Second operand 6 states and 233 transitions. [2024-06-28 00:51:34,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 188 transitions, 2950 flow [2024-06-28 00:51:34,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 188 transitions, 2843 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-28 00:51:34,685 INFO L231 Difference]: Finished difference. Result has 153 places, 174 transitions, 2633 flow [2024-06-28 00:51:34,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2304, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2633, PETRI_PLACES=153, PETRI_TRANSITIONS=174} [2024-06-28 00:51:34,685 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 97 predicate places. [2024-06-28 00:51:34,685 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 174 transitions, 2633 flow [2024-06-28 00:51:34,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:34,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:34,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:34,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 00:51:34,686 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:34,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:34,687 INFO L85 PathProgramCache]: Analyzing trace with hash -132336749, now seen corresponding path program 4 times [2024-06-28 00:51:34,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:34,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725494583] [2024-06-28 00:51:34,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:34,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:34,715 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-28 00:51:34,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:34,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725494583] [2024-06-28 00:51:34,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725494583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:34,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:34,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:51:34,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270204029] [2024-06-28 00:51:34,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:34,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:51:34,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:34,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:51:34,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:51:34,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 61 [2024-06-28 00:51:34,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 174 transitions, 2633 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-28 00:51:34,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:34,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 61 [2024-06-28 00:51:34,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:34,895 INFO L124 PetriNetUnfolderBase]: 581/1481 cut-off events. [2024-06-28 00:51:34,895 INFO L125 PetriNetUnfolderBase]: For 24243/24363 co-relation queries the response was YES. [2024-06-28 00:51:34,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7848 conditions, 1481 events. 581/1481 cut-off events. For 24243/24363 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10438 event pairs, 141 based on Foata normal form. 70/1429 useless extension candidates. Maximal degree in co-relation 6247. Up to 277 conditions per place. [2024-06-28 00:51:34,907 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 32 selfloop transitions, 41 changer transitions 0/157 dead transitions. [2024-06-28 00:51:34,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 157 transitions, 2417 flow [2024-06-28 00:51:34,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:51:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:51:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2024-06-28 00:51:34,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.740983606557377 [2024-06-28 00:51:34,908 INFO L175 Difference]: Start difference. First operand has 153 places, 174 transitions, 2633 flow. Second operand 5 states and 226 transitions. [2024-06-28 00:51:34,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 157 transitions, 2417 flow [2024-06-28 00:51:34,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 157 transitions, 2151 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-28 00:51:34,965 INFO L231 Difference]: Finished difference. Result has 146 places, 148 transitions, 2081 flow [2024-06-28 00:51:34,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2081, PETRI_PLACES=146, PETRI_TRANSITIONS=148} [2024-06-28 00:51:34,965 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 90 predicate places. [2024-06-28 00:51:34,966 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 148 transitions, 2081 flow [2024-06-28 00:51:34,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-28 00:51:34,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:34,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:34,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 00:51:34,966 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:34,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1126552301, now seen corresponding path program 1 times [2024-06-28 00:51:34,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:34,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944480737] [2024-06-28 00:51:34,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:34,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:35,029 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-28 00:51:35,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:35,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944480737] [2024-06-28 00:51:35,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944480737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:35,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:35,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:35,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436747759] [2024-06-28 00:51:35,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:35,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:35,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:35,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:35,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:35,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:35,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 148 transitions, 2081 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:35,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:35,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:35,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:35,271 INFO L124 PetriNetUnfolderBase]: 762/1720 cut-off events. [2024-06-28 00:51:35,271 INFO L125 PetriNetUnfolderBase]: For 30442/30619 co-relation queries the response was YES. [2024-06-28 00:51:35,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9448 conditions, 1720 events. 762/1720 cut-off events. For 30442/30619 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11572 event pairs, 273 based on Foata normal form. 34/1663 useless extension candidates. Maximal degree in co-relation 7471. Up to 668 conditions per place. [2024-06-28 00:51:35,287 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 68 selfloop transitions, 66 changer transitions 0/163 dead transitions. [2024-06-28 00:51:35,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 163 transitions, 2515 flow [2024-06-28 00:51:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 231 transitions. [2024-06-28 00:51:35,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6311475409836066 [2024-06-28 00:51:35,289 INFO L175 Difference]: Start difference. First operand has 146 places, 148 transitions, 2081 flow. Second operand 6 states and 231 transitions. [2024-06-28 00:51:35,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 163 transitions, 2515 flow [2024-06-28 00:51:35,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 163 transitions, 2501 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 00:51:35,335 INFO L231 Difference]: Finished difference. Result has 151 places, 153 transitions, 2290 flow [2024-06-28 00:51:35,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2290, PETRI_PLACES=151, PETRI_TRANSITIONS=153} [2024-06-28 00:51:35,335 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 95 predicate places. [2024-06-28 00:51:35,335 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 153 transitions, 2290 flow [2024-06-28 00:51:35,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:35,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:35,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:35,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 00:51:35,336 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:35,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1685623661, now seen corresponding path program 2 times [2024-06-28 00:51:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:35,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725326772] [2024-06-28 00:51:35,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:35,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:35,388 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-28 00:51:35,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:35,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725326772] [2024-06-28 00:51:35,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725326772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:35,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:35,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:35,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718329945] [2024-06-28 00:51:35,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:35,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:35,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:35,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:35,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:35,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:35,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 153 transitions, 2290 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:35,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:35,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:35,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:35,622 INFO L124 PetriNetUnfolderBase]: 765/1740 cut-off events. [2024-06-28 00:51:35,622 INFO L125 PetriNetUnfolderBase]: For 34185/34351 co-relation queries the response was YES. [2024-06-28 00:51:35,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9835 conditions, 1740 events. 765/1740 cut-off events. For 34185/34351 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11699 event pairs, 251 based on Foata normal form. 41/1693 useless extension candidates. Maximal degree in co-relation 7786. Up to 666 conditions per place. [2024-06-28 00:51:35,636 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 78 selfloop transitions, 62 changer transitions 1/170 dead transitions. [2024-06-28 00:51:35,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 170 transitions, 2755 flow [2024-06-28 00:51:35,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:35,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-06-28 00:51:35,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2024-06-28 00:51:35,637 INFO L175 Difference]: Start difference. First operand has 151 places, 153 transitions, 2290 flow. Second operand 6 states and 234 transitions. [2024-06-28 00:51:35,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 170 transitions, 2755 flow [2024-06-28 00:51:35,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 170 transitions, 2683 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-28 00:51:35,686 INFO L231 Difference]: Finished difference. Result has 155 places, 156 transitions, 2403 flow [2024-06-28 00:51:35,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2403, PETRI_PLACES=155, PETRI_TRANSITIONS=156} [2024-06-28 00:51:35,687 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 99 predicate places. [2024-06-28 00:51:35,687 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 156 transitions, 2403 flow [2024-06-28 00:51:35,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:35,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:35,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:35,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 00:51:35,688 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:35,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1685951951, now seen corresponding path program 3 times [2024-06-28 00:51:35,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:35,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334888307] [2024-06-28 00:51:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:35,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:35,751 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-28 00:51:35,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334888307] [2024-06-28 00:51:35,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334888307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:35,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:35,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:35,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597716331] [2024-06-28 00:51:35,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:35,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:35,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:35,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:35,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 156 transitions, 2403 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:35,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:35,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:35,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:36,008 INFO L124 PetriNetUnfolderBase]: 757/1731 cut-off events. [2024-06-28 00:51:36,008 INFO L125 PetriNetUnfolderBase]: For 36514/36673 co-relation queries the response was YES. [2024-06-28 00:51:36,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10044 conditions, 1731 events. 757/1731 cut-off events. For 36514/36673 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11712 event pairs, 253 based on Foata normal form. 56/1699 useless extension candidates. Maximal degree in co-relation 8393. Up to 664 conditions per place. [2024-06-28 00:51:36,023 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 79 selfloop transitions, 63 changer transitions 2/173 dead transitions. [2024-06-28 00:51:36,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 173 transitions, 2832 flow [2024-06-28 00:51:36,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-06-28 00:51:36,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6475409836065574 [2024-06-28 00:51:36,025 INFO L175 Difference]: Start difference. First operand has 155 places, 156 transitions, 2403 flow. Second operand 6 states and 237 transitions. [2024-06-28 00:51:36,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 173 transitions, 2832 flow [2024-06-28 00:51:36,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 173 transitions, 2702 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-28 00:51:36,075 INFO L231 Difference]: Finished difference. Result has 158 places, 156 transitions, 2408 flow [2024-06-28 00:51:36,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2408, PETRI_PLACES=158, PETRI_TRANSITIONS=156} [2024-06-28 00:51:36,076 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 102 predicate places. [2024-06-28 00:51:36,076 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 156 transitions, 2408 flow [2024-06-28 00:51:36,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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-28 00:51:36,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:36,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:36,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 00:51:36,077 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:36,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:36,077 INFO L85 PathProgramCache]: Analyzing trace with hash -32934813, now seen corresponding path program 1 times [2024-06-28 00:51:36,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:36,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024149161] [2024-06-28 00:51:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:36,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:36,129 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-28 00:51:36,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:36,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024149161] [2024-06-28 00:51:36,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024149161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:36,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:36,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360521491] [2024-06-28 00:51:36,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:36,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:36,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:36,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:36,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:36,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:36,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 156 transitions, 2408 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:36,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:36,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:36,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:36,396 INFO L124 PetriNetUnfolderBase]: 789/1780 cut-off events. [2024-06-28 00:51:36,396 INFO L125 PetriNetUnfolderBase]: For 40619/40898 co-relation queries the response was YES. [2024-06-28 00:51:36,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10577 conditions, 1780 events. 789/1780 cut-off events. For 40619/40898 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12153 event pairs, 167 based on Foata normal form. 57/1717 useless extension candidates. Maximal degree in co-relation 8906. Up to 475 conditions per place. [2024-06-28 00:51:36,412 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 119 selfloop transitions, 32 changer transitions 1/181 dead transitions. [2024-06-28 00:51:36,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 181 transitions, 2896 flow [2024-06-28 00:51:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 241 transitions. [2024-06-28 00:51:36,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6584699453551912 [2024-06-28 00:51:36,413 INFO L175 Difference]: Start difference. First operand has 158 places, 156 transitions, 2408 flow. Second operand 6 states and 241 transitions. [2024-06-28 00:51:36,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 181 transitions, 2896 flow [2024-06-28 00:51:36,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 181 transitions, 2722 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-28 00:51:36,464 INFO L231 Difference]: Finished difference. Result has 159 places, 158 transitions, 2341 flow [2024-06-28 00:51:36,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2234, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2341, PETRI_PLACES=159, PETRI_TRANSITIONS=158} [2024-06-28 00:51:36,465 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 103 predicate places. [2024-06-28 00:51:36,465 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 158 transitions, 2341 flow [2024-06-28 00:51:36,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:36,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:36,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:36,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 00:51:36,466 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:36,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash -899487443, now seen corresponding path program 2 times [2024-06-28 00:51:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:36,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518353987] [2024-06-28 00:51:36,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:36,518 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-28 00:51:36,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:36,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518353987] [2024-06-28 00:51:36,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518353987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:36,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:36,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:36,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791348897] [2024-06-28 00:51:36,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:36,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:36,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:36,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:36,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:36,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:36,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 158 transitions, 2341 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:36,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:36,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:36,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:36,789 INFO L124 PetriNetUnfolderBase]: 801/1815 cut-off events. [2024-06-28 00:51:36,789 INFO L125 PetriNetUnfolderBase]: For 41802/42054 co-relation queries the response was YES. [2024-06-28 00:51:36,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10648 conditions, 1815 events. 801/1815 cut-off events. For 41802/42054 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12553 event pairs, 167 based on Foata normal form. 62/1758 useless extension candidates. Maximal degree in co-relation 9028. Up to 480 conditions per place. [2024-06-28 00:51:36,804 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 120 selfloop transitions, 29 changer transitions 1/179 dead transitions. [2024-06-28 00:51:36,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 179 transitions, 2802 flow [2024-06-28 00:51:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 238 transitions. [2024-06-28 00:51:36,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2024-06-28 00:51:36,806 INFO L175 Difference]: Start difference. First operand has 159 places, 158 transitions, 2341 flow. Second operand 6 states and 238 transitions. [2024-06-28 00:51:36,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 179 transitions, 2802 flow [2024-06-28 00:51:36,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 179 transitions, 2727 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-28 00:51:36,861 INFO L231 Difference]: Finished difference. Result has 162 places, 160 transitions, 2374 flow [2024-06-28 00:51:36,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2374, PETRI_PLACES=162, PETRI_TRANSITIONS=160} [2024-06-28 00:51:36,861 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 106 predicate places. [2024-06-28 00:51:36,861 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 160 transitions, 2374 flow [2024-06-28 00:51:36,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:36,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:36,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:36,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 00:51:36,862 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:36,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash -206039453, now seen corresponding path program 3 times [2024-06-28 00:51:36,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:36,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757816925] [2024-06-28 00:51:36,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:36,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:36,916 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-28 00:51:36,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:36,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757816925] [2024-06-28 00:51:36,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757816925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:36,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:36,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81490893] [2024-06-28 00:51:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:36,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:36,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:36,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 160 transitions, 2374 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:36,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:36,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:36,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:37,201 INFO L124 PetriNetUnfolderBase]: 776/1781 cut-off events. [2024-06-28 00:51:37,201 INFO L125 PetriNetUnfolderBase]: For 41282/41449 co-relation queries the response was YES. [2024-06-28 00:51:37,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10260 conditions, 1781 events. 776/1781 cut-off events. For 41282/41449 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12223 event pairs, 183 based on Foata normal form. 68/1752 useless extension candidates. Maximal degree in co-relation 8625. Up to 467 conditions per place. [2024-06-28 00:51:37,215 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 96 selfloop transitions, 49 changer transitions 1/175 dead transitions. [2024-06-28 00:51:37,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 175 transitions, 2779 flow [2024-06-28 00:51:37,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 235 transitions. [2024-06-28 00:51:37,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6420765027322405 [2024-06-28 00:51:37,217 INFO L175 Difference]: Start difference. First operand has 162 places, 160 transitions, 2374 flow. Second operand 6 states and 235 transitions. [2024-06-28 00:51:37,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 175 transitions, 2779 flow [2024-06-28 00:51:37,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 175 transitions, 2729 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-28 00:51:37,275 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 2430 flow [2024-06-28 00:51:37,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2430, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2024-06-28 00:51:37,276 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 109 predicate places. [2024-06-28 00:51:37,276 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 2430 flow [2024-06-28 00:51:37,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:37,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:37,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:37,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 00:51:37,277 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:37,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:37,277 INFO L85 PathProgramCache]: Analyzing trace with hash -806955875, now seen corresponding path program 1 times [2024-06-28 00:51:37,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:37,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957392608] [2024-06-28 00:51:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:37,322 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-28 00:51:37,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:37,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957392608] [2024-06-28 00:51:37,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957392608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:37,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:51:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10160765] [2024-06-28 00:51:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:37,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:51:37,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:37,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:51:37,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:51:37,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:37,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 2430 flow. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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-28 00:51:37,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:37,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:37,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:37,546 INFO L124 PetriNetUnfolderBase]: 752/1722 cut-off events. [2024-06-28 00:51:37,546 INFO L125 PetriNetUnfolderBase]: For 41853/41976 co-relation queries the response was YES. [2024-06-28 00:51:37,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9969 conditions, 1722 events. 752/1722 cut-off events. For 41853/41976 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11370 event pairs, 155 based on Foata normal form. 55/1691 useless extension candidates. Maximal degree in co-relation 9708. Up to 819 conditions per place. [2024-06-28 00:51:37,559 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 108 selfloop transitions, 38 changer transitions 0/175 dead transitions. [2024-06-28 00:51:37,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 175 transitions, 2840 flow [2024-06-28 00:51:37,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:51:37,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:51:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 208 transitions. [2024-06-28 00:51:37,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6819672131147541 [2024-06-28 00:51:37,561 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 2430 flow. Second operand 5 states and 208 transitions. [2024-06-28 00:51:37,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 175 transitions, 2840 flow [2024-06-28 00:51:37,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 175 transitions, 2721 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-28 00:51:37,615 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 2404 flow [2024-06-28 00:51:37,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2311, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2404, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2024-06-28 00:51:37,615 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 109 predicate places. [2024-06-28 00:51:37,616 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 2404 flow [2024-06-28 00:51:37,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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-28 00:51:37,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:37,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:37,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 00:51:37,616 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:37,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash 580753810, now seen corresponding path program 1 times [2024-06-28 00:51:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:37,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77535699] [2024-06-28 00:51:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:37,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:37,637 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-28 00:51:37,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:37,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77535699] [2024-06-28 00:51:37,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77535699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:37,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:37,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:51:37,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309209006] [2024-06-28 00:51:37,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:37,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:51:37,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:37,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:51:37,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:51:37,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2024-06-28 00:51:37,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 2404 flow. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-28 00:51:37,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:37,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2024-06-28 00:51:37,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:37,760 INFO L124 PetriNetUnfolderBase]: 357/903 cut-off events. [2024-06-28 00:51:37,760 INFO L125 PetriNetUnfolderBase]: For 11740/11761 co-relation queries the response was YES. [2024-06-28 00:51:37,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4314 conditions, 903 events. 357/903 cut-off events. For 11740/11761 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5883 event pairs, 65 based on Foata normal form. 10/820 useless extension candidates. Maximal degree in co-relation 3592. Up to 326 conditions per place. [2024-06-28 00:51:37,766 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 40 selfloop transitions, 16 changer transitions 0/140 dead transitions. [2024-06-28 00:51:37,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 140 transitions, 1874 flow [2024-06-28 00:51:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:51:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:51:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2024-06-28 00:51:37,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7147540983606557 [2024-06-28 00:51:37,767 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 2404 flow. Second operand 5 states and 218 transitions. [2024-06-28 00:51:37,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 140 transitions, 1874 flow [2024-06-28 00:51:37,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 140 transitions, 1628 flow, removed 7 selfloop flow, removed 17 redundant places. [2024-06-28 00:51:37,794 INFO L231 Difference]: Finished difference. Result has 156 places, 129 transitions, 1553 flow [2024-06-28 00:51:37,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1553, PETRI_PLACES=156, PETRI_TRANSITIONS=129} [2024-06-28 00:51:37,794 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 100 predicate places. [2024-06-28 00:51:37,794 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 129 transitions, 1553 flow [2024-06-28 00:51:37,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-28 00:51:37,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:37,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:37,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 00:51:37,798 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:37,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:37,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1174985420, now seen corresponding path program 1 times [2024-06-28 00:51:37,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:37,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173308951] [2024-06-28 00:51:37,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:37,857 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-28 00:51:37,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173308951] [2024-06-28 00:51:37,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173308951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:37,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:37,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:37,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299085510] [2024-06-28 00:51:37,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:37,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:37,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:37,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:37,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:37,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:37,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 129 transitions, 1553 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:37,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:37,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:37,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:38,070 INFO L124 PetriNetUnfolderBase]: 504/1191 cut-off events. [2024-06-28 00:51:38,071 INFO L125 PetriNetUnfolderBase]: For 23362/23534 co-relation queries the response was YES. [2024-06-28 00:51:38,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6288 conditions, 1191 events. 504/1191 cut-off events. For 23362/23534 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7746 event pairs, 159 based on Foata normal form. 25/1146 useless extension candidates. Maximal degree in co-relation 5060. Up to 527 conditions per place. [2024-06-28 00:51:38,080 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 89 selfloop transitions, 22 changer transitions 1/144 dead transitions. [2024-06-28 00:51:38,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 144 transitions, 1940 flow [2024-06-28 00:51:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2024-06-28 00:51:38,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6202185792349727 [2024-06-28 00:51:38,081 INFO L175 Difference]: Start difference. First operand has 156 places, 129 transitions, 1553 flow. Second operand 6 states and 227 transitions. [2024-06-28 00:51:38,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 144 transitions, 1940 flow [2024-06-28 00:51:38,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 144 transitions, 1940 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 00:51:38,118 INFO L231 Difference]: Finished difference. Result has 162 places, 133 transitions, 1657 flow [2024-06-28 00:51:38,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1657, PETRI_PLACES=162, PETRI_TRANSITIONS=133} [2024-06-28 00:51:38,119 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 106 predicate places. [2024-06-28 00:51:38,119 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 133 transitions, 1657 flow [2024-06-28 00:51:38,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:38,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:38,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:38,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 00:51:38,120 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:38,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2046865642, now seen corresponding path program 2 times [2024-06-28 00:51:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:38,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076213406] [2024-06-28 00:51:38,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:38,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:38,171 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-28 00:51:38,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:38,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076213406] [2024-06-28 00:51:38,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076213406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:38,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:38,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:38,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772130223] [2024-06-28 00:51:38,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:38,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:38,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:38,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:38,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:38,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:38,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 133 transitions, 1657 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:38,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:38,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:38,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:38,391 INFO L124 PetriNetUnfolderBase]: 480/1152 cut-off events. [2024-06-28 00:51:38,392 INFO L125 PetriNetUnfolderBase]: For 22343/22436 co-relation queries the response was YES. [2024-06-28 00:51:38,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5975 conditions, 1152 events. 480/1152 cut-off events. For 22343/22436 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7556 event pairs, 149 based on Foata normal form. 32/1129 useless extension candidates. Maximal degree in co-relation 5374. Up to 375 conditions per place. [2024-06-28 00:51:38,399 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 81 selfloop transitions, 31 changer transitions 0/144 dead transitions. [2024-06-28 00:51:38,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 144 transitions, 1951 flow [2024-06-28 00:51:38,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2024-06-28 00:51:38,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6229508196721312 [2024-06-28 00:51:38,401 INFO L175 Difference]: Start difference. First operand has 162 places, 133 transitions, 1657 flow. Second operand 6 states and 228 transitions. [2024-06-28 00:51:38,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 144 transitions, 1951 flow [2024-06-28 00:51:38,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 144 transitions, 1919 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 00:51:38,436 INFO L231 Difference]: Finished difference. Result has 165 places, 133 transitions, 1693 flow [2024-06-28 00:51:38,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1693, PETRI_PLACES=165, PETRI_TRANSITIONS=133} [2024-06-28 00:51:38,438 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 109 predicate places. [2024-06-28 00:51:38,438 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 133 transitions, 1693 flow [2024-06-28 00:51:38,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:38,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:38,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:38,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 00:51:38,439 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:38,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1597026124, now seen corresponding path program 3 times [2024-06-28 00:51:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:38,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404912806] [2024-06-28 00:51:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:38,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:38,489 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-28 00:51:38,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:38,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404912806] [2024-06-28 00:51:38,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404912806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:38,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899747375] [2024-06-28 00:51:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:38,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:38,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:38,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:38,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:38,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 133 transitions, 1693 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:38,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:38,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:38,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:38,666 INFO L124 PetriNetUnfolderBase]: 488/1159 cut-off events. [2024-06-28 00:51:38,666 INFO L125 PetriNetUnfolderBase]: For 22066/22237 co-relation queries the response was YES. [2024-06-28 00:51:38,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6102 conditions, 1159 events. 488/1159 cut-off events. For 22066/22237 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7485 event pairs, 152 based on Foata normal form. 25/1117 useless extension candidates. Maximal degree in co-relation 4976. Up to 521 conditions per place. [2024-06-28 00:51:38,675 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 89 selfloop transitions, 24 changer transitions 2/147 dead transitions. [2024-06-28 00:51:38,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 147 transitions, 2097 flow [2024-06-28 00:51:38,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2024-06-28 00:51:38,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6229508196721312 [2024-06-28 00:51:38,676 INFO L175 Difference]: Start difference. First operand has 165 places, 133 transitions, 1693 flow. Second operand 6 states and 228 transitions. [2024-06-28 00:51:38,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 147 transitions, 2097 flow [2024-06-28 00:51:38,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 147 transitions, 2016 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 00:51:38,716 INFO L231 Difference]: Finished difference. Result has 166 places, 133 transitions, 1666 flow [2024-06-28 00:51:38,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1666, PETRI_PLACES=166, PETRI_TRANSITIONS=133} [2024-06-28 00:51:38,717 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 110 predicate places. [2024-06-28 00:51:38,717 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 133 transitions, 1666 flow [2024-06-28 00:51:38,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:38,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:38,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:38,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 00:51:38,717 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:38,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:38,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1148378424, now seen corresponding path program 4 times [2024-06-28 00:51:38,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:38,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873653662] [2024-06-28 00:51:38,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:38,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:38,765 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-28 00:51:38,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:38,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873653662] [2024-06-28 00:51:38,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873653662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:38,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:38,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:38,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415351258] [2024-06-28 00:51:38,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:38,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:38,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:38,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:38,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:38,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:38,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 133 transitions, 1666 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:38,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:38,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:38,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:38,962 INFO L124 PetriNetUnfolderBase]: 485/1158 cut-off events. [2024-06-28 00:51:38,963 INFO L125 PetriNetUnfolderBase]: For 20860/21031 co-relation queries the response was YES. [2024-06-28 00:51:38,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5986 conditions, 1158 events. 485/1158 cut-off events. For 20860/21031 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7467 event pairs, 154 based on Foata normal form. 35/1126 useless extension candidates. Maximal degree in co-relation 4900. Up to 521 conditions per place. [2024-06-28 00:51:38,970 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 86 selfloop transitions, 28 changer transitions 3/149 dead transitions. [2024-06-28 00:51:38,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 149 transitions, 2089 flow [2024-06-28 00:51:38,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2024-06-28 00:51:38,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6256830601092896 [2024-06-28 00:51:38,972 INFO L175 Difference]: Start difference. First operand has 166 places, 133 transitions, 1666 flow. Second operand 6 states and 229 transitions. [2024-06-28 00:51:38,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 149 transitions, 2089 flow [2024-06-28 00:51:39,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 149 transitions, 2001 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 00:51:39,010 INFO L231 Difference]: Finished difference. Result has 167 places, 133 transitions, 1639 flow [2024-06-28 00:51:39,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1639, PETRI_PLACES=167, PETRI_TRANSITIONS=133} [2024-06-28 00:51:39,011 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 111 predicate places. [2024-06-28 00:51:39,011 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 133 transitions, 1639 flow [2024-06-28 00:51:39,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:39,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:39,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:39,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 00:51:39,011 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:39,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1585539295, now seen corresponding path program 1 times [2024-06-28 00:51:39,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:39,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788246320] [2024-06-28 00:51:39,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:39,064 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-28 00:51:39,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:39,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788246320] [2024-06-28 00:51:39,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788246320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:39,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:39,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:39,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479117158] [2024-06-28 00:51:39,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:39,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:39,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:39,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:39,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:39,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 133 transitions, 1639 flow. Second operand has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 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-28 00:51:39,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:39,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:39,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:39,273 INFO L124 PetriNetUnfolderBase]: 483/1151 cut-off events. [2024-06-28 00:51:39,273 INFO L125 PetriNetUnfolderBase]: For 19963/20134 co-relation queries the response was YES. [2024-06-28 00:51:39,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5848 conditions, 1151 events. 483/1151 cut-off events. For 19963/20134 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7378 event pairs, 113 based on Foata normal form. 44/1125 useless extension candidates. Maximal degree in co-relation 4792. Up to 301 conditions per place. [2024-06-28 00:51:39,281 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 79 selfloop transitions, 32 changer transitions 9/152 dead transitions. [2024-06-28 00:51:39,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 152 transitions, 1977 flow [2024-06-28 00:51:39,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 240 transitions. [2024-06-28 00:51:39,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6557377049180327 [2024-06-28 00:51:39,283 INFO L175 Difference]: Start difference. First operand has 167 places, 133 transitions, 1639 flow. Second operand 6 states and 240 transitions. [2024-06-28 00:51:39,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 152 transitions, 1977 flow [2024-06-28 00:51:39,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 152 transitions, 1892 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-28 00:51:39,324 INFO L231 Difference]: Finished difference. Result has 168 places, 131 transitions, 1592 flow [2024-06-28 00:51:39,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1554, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1592, PETRI_PLACES=168, PETRI_TRANSITIONS=131} [2024-06-28 00:51:39,325 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 112 predicate places. [2024-06-28 00:51:39,325 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 131 transitions, 1592 flow [2024-06-28 00:51:39,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 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-28 00:51:39,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:39,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:39,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 00:51:39,325 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:39,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1623546051, now seen corresponding path program 2 times [2024-06-28 00:51:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:39,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821016355] [2024-06-28 00:51:39,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:39,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:39,369 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-28 00:51:39,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:39,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821016355] [2024-06-28 00:51:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821016355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:39,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:39,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:39,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128796138] [2024-06-28 00:51:39,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:39,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:39,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:39,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:39,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:39,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:39,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 131 transitions, 1592 flow. Second operand has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 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-28 00:51:39,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:39,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:39,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:39,562 INFO L124 PetriNetUnfolderBase]: 480/1161 cut-off events. [2024-06-28 00:51:39,562 INFO L125 PetriNetUnfolderBase]: For 21447/21620 co-relation queries the response was YES. [2024-06-28 00:51:39,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5870 conditions, 1161 events. 480/1161 cut-off events. For 21447/21620 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7441 event pairs, 112 based on Foata normal form. 42/1135 useless extension candidates. Maximal degree in co-relation 4776. Up to 514 conditions per place. [2024-06-28 00:51:39,570 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 91 selfloop transitions, 21 changer transitions 4/148 dead transitions. [2024-06-28 00:51:39,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 148 transitions, 1889 flow [2024-06-28 00:51:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 238 transitions. [2024-06-28 00:51:39,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2024-06-28 00:51:39,572 INFO L175 Difference]: Start difference. First operand has 168 places, 131 transitions, 1592 flow. Second operand 6 states and 238 transitions. [2024-06-28 00:51:39,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 148 transitions, 1889 flow [2024-06-28 00:51:39,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 148 transitions, 1816 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-28 00:51:39,614 INFO L231 Difference]: Finished difference. Result has 169 places, 131 transitions, 1574 flow [2024-06-28 00:51:39,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1574, PETRI_PLACES=169, PETRI_TRANSITIONS=131} [2024-06-28 00:51:39,615 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 113 predicate places. [2024-06-28 00:51:39,615 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 131 transitions, 1574 flow [2024-06-28 00:51:39,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 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-28 00:51:39,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:39,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:39,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 00:51:39,615 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:39,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:39,616 INFO L85 PathProgramCache]: Analyzing trace with hash -435373791, now seen corresponding path program 3 times [2024-06-28 00:51:39,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:39,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585055282] [2024-06-28 00:51:39,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:39,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:39,662 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-28 00:51:39,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:39,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585055282] [2024-06-28 00:51:39,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585055282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:39,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:39,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:39,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530535357] [2024-06-28 00:51:39,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:39,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:39,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:39,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:39,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:39,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:39,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 131 transitions, 1574 flow. Second operand has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 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-28 00:51:39,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:39,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:39,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:39,850 INFO L124 PetriNetUnfolderBase]: 450/1114 cut-off events. [2024-06-28 00:51:39,851 INFO L125 PetriNetUnfolderBase]: For 19600/19686 co-relation queries the response was YES. [2024-06-28 00:51:39,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5454 conditions, 1114 events. 450/1114 cut-off events. For 19600/19686 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7180 event pairs, 174 based on Foata normal form. 49/1105 useless extension candidates. Maximal degree in co-relation 4414. Up to 504 conditions per place. [2024-06-28 00:51:39,858 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 55 selfloop transitions, 51 changer transitions 9/147 dead transitions. [2024-06-28 00:51:39,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 147 transitions, 1910 flow [2024-06-28 00:51:39,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 235 transitions. [2024-06-28 00:51:39,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6420765027322405 [2024-06-28 00:51:39,859 INFO L175 Difference]: Start difference. First operand has 169 places, 131 transitions, 1574 flow. Second operand 6 states and 235 transitions. [2024-06-28 00:51:39,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 147 transitions, 1910 flow [2024-06-28 00:51:39,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 147 transitions, 1868 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-28 00:51:39,899 INFO L231 Difference]: Finished difference. Result has 171 places, 127 transitions, 1584 flow [2024-06-28 00:51:39,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1584, PETRI_PLACES=171, PETRI_TRANSITIONS=127} [2024-06-28 00:51:39,899 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 115 predicate places. [2024-06-28 00:51:39,900 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 127 transitions, 1584 flow [2024-06-28 00:51:39,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 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-28 00:51:39,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:39,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:39,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 00:51:39,900 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:39,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:39,901 INFO L85 PathProgramCache]: Analyzing trace with hash 767174888, now seen corresponding path program 1 times [2024-06-28 00:51:39,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:39,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27654953] [2024-06-28 00:51:39,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:39,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:39,944 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-28 00:51:39,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:39,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27654953] [2024-06-28 00:51:39,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27654953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:39,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:39,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:39,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055224115] [2024-06-28 00:51:39,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:39,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:39,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:39,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:40,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:40,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 127 transitions, 1584 flow. Second operand has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 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-28 00:51:40,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:40,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:40,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:40,142 INFO L124 PetriNetUnfolderBase]: 433/1086 cut-off events. [2024-06-28 00:51:40,143 INFO L125 PetriNetUnfolderBase]: For 21945/22029 co-relation queries the response was YES. [2024-06-28 00:51:40,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5521 conditions, 1086 events. 433/1086 cut-off events. For 21945/22029 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6882 event pairs, 121 based on Foata normal form. 54/1095 useless extension candidates. Maximal degree in co-relation 5325. Up to 353 conditions per place. [2024-06-28 00:51:40,150 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 73 selfloop transitions, 39 changer transitions 8/152 dead transitions. [2024-06-28 00:51:40,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 152 transitions, 2112 flow [2024-06-28 00:51:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2024-06-28 00:51:40,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-28 00:51:40,151 INFO L175 Difference]: Start difference. First operand has 171 places, 127 transitions, 1584 flow. Second operand 6 states and 244 transitions. [2024-06-28 00:51:40,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 152 transitions, 2112 flow [2024-06-28 00:51:40,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 152 transitions, 1971 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 00:51:40,189 INFO L231 Difference]: Finished difference. Result has 172 places, 125 transitions, 1521 flow [2024-06-28 00:51:40,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1521, PETRI_PLACES=172, PETRI_TRANSITIONS=125} [2024-06-28 00:51:40,190 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 116 predicate places. [2024-06-28 00:51:40,190 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 125 transitions, 1521 flow [2024-06-28 00:51:40,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 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-28 00:51:40,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:40,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:40,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 00:51:40,191 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:40,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1004363438, now seen corresponding path program 2 times [2024-06-28 00:51:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339484373] [2024-06-28 00:51:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:51:40,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:40,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339484373] [2024-06-28 00:51:40,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339484373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:40,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:40,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110564078] [2024-06-28 00:51:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:40,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:40,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:40,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:40,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:40,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 125 transitions, 1521 flow. Second operand has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 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-28 00:51:40,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:40,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:40,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:40,428 INFO L124 PetriNetUnfolderBase]: 431/1075 cut-off events. [2024-06-28 00:51:40,428 INFO L125 PetriNetUnfolderBase]: For 20943/21083 co-relation queries the response was YES. [2024-06-28 00:51:40,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5459 conditions, 1075 events. 431/1075 cut-off events. For 20943/21083 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6840 event pairs, 101 based on Foata normal form. 40/1046 useless extension candidates. Maximal degree in co-relation 4316. Up to 287 conditions per place. [2024-06-28 00:51:40,435 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 79 selfloop transitions, 27 changer transitions 4/142 dead transitions. [2024-06-28 00:51:40,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 142 transitions, 1852 flow [2024-06-28 00:51:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 238 transitions. [2024-06-28 00:51:40,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2024-06-28 00:51:40,437 INFO L175 Difference]: Start difference. First operand has 172 places, 125 transitions, 1521 flow. Second operand 6 states and 238 transitions. [2024-06-28 00:51:40,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 142 transitions, 1852 flow [2024-06-28 00:51:40,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 142 transitions, 1803 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 00:51:40,473 INFO L231 Difference]: Finished difference. Result has 175 places, 124 transitions, 1533 flow [2024-06-28 00:51:40,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1533, PETRI_PLACES=175, PETRI_TRANSITIONS=124} [2024-06-28 00:51:40,474 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 119 predicate places. [2024-06-28 00:51:40,474 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 124 transitions, 1533 flow [2024-06-28 00:51:40,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 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-28 00:51:40,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:40,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:40,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 00:51:40,475 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:40,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:40,475 INFO L85 PathProgramCache]: Analyzing trace with hash -774674828, now seen corresponding path program 3 times [2024-06-28 00:51:40,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:40,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120021198] [2024-06-28 00:51:40,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:40,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:40,517 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-28 00:51:40,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:40,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120021198] [2024-06-28 00:51:40,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120021198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:40,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:40,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:40,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844548565] [2024-06-28 00:51:40,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:40,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:40,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:40,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:40,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:40,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:40,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 124 transitions, 1533 flow. Second operand has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 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-28 00:51:40,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:40,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:40,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:40,711 INFO L124 PetriNetUnfolderBase]: 409/1039 cut-off events. [2024-06-28 00:51:40,711 INFO L125 PetriNetUnfolderBase]: For 20288/20437 co-relation queries the response was YES. [2024-06-28 00:51:40,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5221 conditions, 1039 events. 409/1039 cut-off events. For 20288/20437 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6550 event pairs, 101 based on Foata normal form. 34/1009 useless extension candidates. Maximal degree in co-relation 4036. Up to 482 conditions per place. [2024-06-28 00:51:40,719 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 83 selfloop transitions, 19 changer transitions 2/136 dead transitions. [2024-06-28 00:51:40,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 136 transitions, 1767 flow [2024-06-28 00:51:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2024-06-28 00:51:40,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6366120218579235 [2024-06-28 00:51:40,720 INFO L175 Difference]: Start difference. First operand has 175 places, 124 transitions, 1533 flow. Second operand 6 states and 233 transitions. [2024-06-28 00:51:40,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 136 transitions, 1767 flow [2024-06-28 00:51:40,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 136 transitions, 1729 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-28 00:51:40,757 INFO L231 Difference]: Finished difference. Result has 178 places, 123 transitions, 1522 flow [2024-06-28 00:51:40,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1522, PETRI_PLACES=178, PETRI_TRANSITIONS=123} [2024-06-28 00:51:40,758 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 122 predicate places. [2024-06-28 00:51:40,758 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 123 transitions, 1522 flow [2024-06-28 00:51:40,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 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-28 00:51:40,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:40,759 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] [2024-06-28 00:51:40,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 00:51:40,759 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:40,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:40,759 INFO L85 PathProgramCache]: Analyzing trace with hash 124981410, now seen corresponding path program 1 times [2024-06-28 00:51:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:40,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315704653] [2024-06-28 00:51:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:40,776 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-28 00:51:40,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:40,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315704653] [2024-06-28 00:51:40,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315704653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:40,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:40,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:51:40,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762394737] [2024-06-28 00:51:40,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:40,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:51:40,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:40,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:51:40,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:51:40,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2024-06-28 00:51:40,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 123 transitions, 1522 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-28 00:51:40,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:40,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2024-06-28 00:51:40,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:40,936 INFO L124 PetriNetUnfolderBase]: 458/1136 cut-off events. [2024-06-28 00:51:40,936 INFO L125 PetriNetUnfolderBase]: For 14748/14765 co-relation queries the response was YES. [2024-06-28 00:51:40,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5167 conditions, 1136 events. 458/1136 cut-off events. For 14748/14765 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7357 event pairs, 98 based on Foata normal form. 10/1057 useless extension candidates. Maximal degree in co-relation 4273. Up to 338 conditions per place. [2024-06-28 00:51:40,944 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 37 selfloop transitions, 21 changer transitions 8/145 dead transitions. [2024-06-28 00:51:40,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 145 transitions, 1746 flow [2024-06-28 00:51:40,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:51:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:51:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2024-06-28 00:51:40,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7311475409836066 [2024-06-28 00:51:40,946 INFO L175 Difference]: Start difference. First operand has 178 places, 123 transitions, 1522 flow. Second operand 5 states and 223 transitions. [2024-06-28 00:51:40,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 145 transitions, 1746 flow [2024-06-28 00:51:40,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 145 transitions, 1683 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 00:51:40,988 INFO L231 Difference]: Finished difference. Result has 179 places, 129 transitions, 1526 flow [2024-06-28 00:51:40,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1526, PETRI_PLACES=179, PETRI_TRANSITIONS=129} [2024-06-28 00:51:40,989 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 123 predicate places. [2024-06-28 00:51:40,989 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 129 transitions, 1526 flow [2024-06-28 00:51:40,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-28 00:51:40,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:40,990 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] [2024-06-28 00:51:40,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 00:51:40,990 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:40,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1027937388, now seen corresponding path program 2 times [2024-06-28 00:51:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:40,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109181875] [2024-06-28 00:51:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:40,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:41,037 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-28 00:51:41,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:41,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109181875] [2024-06-28 00:51:41,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109181875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:41,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:41,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:41,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133105883] [2024-06-28 00:51:41,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:41,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:41,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:41,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:41,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:41,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:41,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 129 transitions, 1526 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:41,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:41,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:41,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:41,224 INFO L124 PetriNetUnfolderBase]: 406/1060 cut-off events. [2024-06-28 00:51:41,224 INFO L125 PetriNetUnfolderBase]: For 18325/18410 co-relation queries the response was YES. [2024-06-28 00:51:41,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5296 conditions, 1060 events. 406/1060 cut-off events. For 18325/18410 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6669 event pairs, 102 based on Foata normal form. 27/1057 useless extension candidates. Maximal degree in co-relation 5145. Up to 364 conditions per place. [2024-06-28 00:51:41,231 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 72 selfloop transitions, 37 changer transitions 1/148 dead transitions. [2024-06-28 00:51:41,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 148 transitions, 1858 flow [2024-06-28 00:51:41,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-06-28 00:51:41,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6475409836065574 [2024-06-28 00:51:41,233 INFO L175 Difference]: Start difference. First operand has 179 places, 129 transitions, 1526 flow. Second operand 6 states and 237 transitions. [2024-06-28 00:51:41,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 148 transitions, 1858 flow [2024-06-28 00:51:41,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 148 transitions, 1854 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 00:51:41,273 INFO L231 Difference]: Finished difference. Result has 183 places, 128 transitions, 1576 flow [2024-06-28 00:51:41,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1576, PETRI_PLACES=183, PETRI_TRANSITIONS=128} [2024-06-28 00:51:41,274 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 127 predicate places. [2024-06-28 00:51:41,274 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 128 transitions, 1576 flow [2024-06-28 00:51:41,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:41,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:41,275 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] [2024-06-28 00:51:41,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 00:51:41,275 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:41,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1322562120, now seen corresponding path program 3 times [2024-06-28 00:51:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:41,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573845526] [2024-06-28 00:51:41,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:41,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:41,325 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-28 00:51:41,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:41,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573845526] [2024-06-28 00:51:41,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573845526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:41,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:41,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:41,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365486075] [2024-06-28 00:51:41,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:41,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:41,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:41,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:41,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:41,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:41,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 128 transitions, 1576 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:41,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:41,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:41,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:41,535 INFO L124 PetriNetUnfolderBase]: 398/1049 cut-off events. [2024-06-28 00:51:41,535 INFO L125 PetriNetUnfolderBase]: For 18578/18661 co-relation queries the response was YES. [2024-06-28 00:51:41,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5299 conditions, 1049 events. 398/1049 cut-off events. For 18578/18661 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6589 event pairs, 104 based on Foata normal form. 27/1046 useless extension candidates. Maximal degree in co-relation 5140. Up to 361 conditions per place. [2024-06-28 00:51:41,543 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 77 selfloop transitions, 33 changer transitions 1/149 dead transitions. [2024-06-28 00:51:41,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 149 transitions, 1924 flow [2024-06-28 00:51:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-06-28 00:51:41,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6475409836065574 [2024-06-28 00:51:41,544 INFO L175 Difference]: Start difference. First operand has 183 places, 128 transitions, 1576 flow. Second operand 6 states and 237 transitions. [2024-06-28 00:51:41,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 149 transitions, 1924 flow [2024-06-28 00:51:41,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 149 transitions, 1838 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-28 00:51:41,589 INFO L231 Difference]: Finished difference. Result has 184 places, 127 transitions, 1539 flow [2024-06-28 00:51:41,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1539, PETRI_PLACES=184, PETRI_TRANSITIONS=127} [2024-06-28 00:51:41,589 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 128 predicate places. [2024-06-28 00:51:41,590 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 127 transitions, 1539 flow [2024-06-28 00:51:41,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:41,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:41,590 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] [2024-06-28 00:51:41,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 00:51:41,590 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:41,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:41,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1295010910, now seen corresponding path program 4 times [2024-06-28 00:51:41,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:41,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322814258] [2024-06-28 00:51:41,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:41,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:41,634 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-28 00:51:41,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322814258] [2024-06-28 00:51:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322814258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530552959] [2024-06-28 00:51:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:41,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:41,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:41,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:41,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:41,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 127 transitions, 1539 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:41,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:41,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:41,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:41,818 INFO L124 PetriNetUnfolderBase]: 382/1013 cut-off events. [2024-06-28 00:51:41,819 INFO L125 PetriNetUnfolderBase]: For 17246/17323 co-relation queries the response was YES. [2024-06-28 00:51:41,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4996 conditions, 1013 events. 382/1013 cut-off events. For 17246/17323 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6302 event pairs, 98 based on Foata normal form. 31/1018 useless extension candidates. Maximal degree in co-relation 4836. Up to 334 conditions per place. [2024-06-28 00:51:41,825 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 55 selfloop transitions, 39 changer transitions 12/144 dead transitions. [2024-06-28 00:51:41,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 144 transitions, 1801 flow [2024-06-28 00:51:41,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-06-28 00:51:41,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2024-06-28 00:51:41,826 INFO L175 Difference]: Start difference. First operand has 184 places, 127 transitions, 1539 flow. Second operand 6 states and 234 transitions. [2024-06-28 00:51:41,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 144 transitions, 1801 flow [2024-06-28 00:51:41,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 144 transitions, 1652 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-28 00:51:41,868 INFO L231 Difference]: Finished difference. Result has 182 places, 118 transitions, 1340 flow [2024-06-28 00:51:41,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1340, PETRI_PLACES=182, PETRI_TRANSITIONS=118} [2024-06-28 00:51:41,869 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 126 predicate places. [2024-06-28 00:51:41,869 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 118 transitions, 1340 flow [2024-06-28 00:51:41,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:41,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:41,870 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] [2024-06-28 00:51:41,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 00:51:41,870 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:41,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1162907657, now seen corresponding path program 1 times [2024-06-28 00:51:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:41,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178374421] [2024-06-28 00:51:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:41,913 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-28 00:51:41,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:41,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178374421] [2024-06-28 00:51:41,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178374421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:41,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:41,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:41,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848863752] [2024-06-28 00:51:41,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:41,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:41,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:41,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:41,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:41,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:41,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 118 transitions, 1340 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:41,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:41,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:41,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:42,065 INFO L124 PetriNetUnfolderBase]: 340/902 cut-off events. [2024-06-28 00:51:42,065 INFO L125 PetriNetUnfolderBase]: For 15485/15553 co-relation queries the response was YES. [2024-06-28 00:51:42,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4337 conditions, 902 events. 340/902 cut-off events. For 15485/15553 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5502 event pairs, 135 based on Foata normal form. 22/890 useless extension candidates. Maximal degree in co-relation 3520. Up to 399 conditions per place. [2024-06-28 00:51:42,071 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 47 selfloop transitions, 39 changer transitions 3/127 dead transitions. [2024-06-28 00:51:42,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 127 transitions, 1540 flow [2024-06-28 00:51:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2024-06-28 00:51:42,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6092896174863388 [2024-06-28 00:51:42,073 INFO L175 Difference]: Start difference. First operand has 182 places, 118 transitions, 1340 flow. Second operand 6 states and 223 transitions. [2024-06-28 00:51:42,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 127 transitions, 1540 flow [2024-06-28 00:51:42,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 127 transitions, 1393 flow, removed 9 selfloop flow, removed 18 redundant places. [2024-06-28 00:51:42,104 INFO L231 Difference]: Finished difference. Result has 167 places, 115 transitions, 1248 flow [2024-06-28 00:51:42,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1248, PETRI_PLACES=167, PETRI_TRANSITIONS=115} [2024-06-28 00:51:42,105 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 111 predicate places. [2024-06-28 00:51:42,105 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 115 transitions, 1248 flow [2024-06-28 00:51:42,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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-28 00:51:42,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:42,105 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] [2024-06-28 00:51:42,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 00:51:42,106 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:42,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:42,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1223791350, now seen corresponding path program 1 times [2024-06-28 00:51:42,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:42,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610143846] [2024-06-28 00:51:42,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:42,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:42,150 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-28 00:51:42,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:42,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610143846] [2024-06-28 00:51:42,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610143846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:42,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:42,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:42,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500072588] [2024-06-28 00:51:42,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:42,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:42,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:42,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:42,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:42,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 115 transitions, 1248 flow. Second operand has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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-28 00:51:42,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:42,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:42,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:42,337 INFO L124 PetriNetUnfolderBase]: 320/859 cut-off events. [2024-06-28 00:51:42,338 INFO L125 PetriNetUnfolderBase]: For 13751/13845 co-relation queries the response was YES. [2024-06-28 00:51:42,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4032 conditions, 859 events. 320/859 cut-off events. For 13751/13845 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5196 event pairs, 58 based on Foata normal form. 15/837 useless extension candidates. Maximal degree in co-relation 3295. Up to 205 conditions per place. [2024-06-28 00:51:42,343 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 70 selfloop transitions, 16 changer transitions 5/129 dead transitions. [2024-06-28 00:51:42,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 129 transitions, 1539 flow [2024-06-28 00:51:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2024-06-28 00:51:42,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6147540983606558 [2024-06-28 00:51:42,345 INFO L175 Difference]: Start difference. First operand has 167 places, 115 transitions, 1248 flow. Second operand 6 states and 225 transitions. [2024-06-28 00:51:42,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 129 transitions, 1539 flow [2024-06-28 00:51:42,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 129 transitions, 1420 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-28 00:51:42,371 INFO L231 Difference]: Finished difference. Result has 163 places, 114 transitions, 1155 flow [2024-06-28 00:51:42,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1155, PETRI_PLACES=163, PETRI_TRANSITIONS=114} [2024-06-28 00:51:42,372 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 107 predicate places. [2024-06-28 00:51:42,373 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 114 transitions, 1155 flow [2024-06-28 00:51:42,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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-28 00:51:42,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:42,373 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] [2024-06-28 00:51:42,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 00:51:42,373 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:42,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:42,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1979298508, now seen corresponding path program 2 times [2024-06-28 00:51:42,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:42,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3783882] [2024-06-28 00:51:42,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:42,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:42,426 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-28 00:51:42,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3783882] [2024-06-28 00:51:42,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3783882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:42,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:42,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:42,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500427249] [2024-06-28 00:51:42,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:42,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:42,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:42,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:42,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:42,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:42,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 114 transitions, 1155 flow. Second operand has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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-28 00:51:42,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:42,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:42,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:42,563 INFO L124 PetriNetUnfolderBase]: 304/820 cut-off events. [2024-06-28 00:51:42,563 INFO L125 PetriNetUnfolderBase]: For 11048/11139 co-relation queries the response was YES. [2024-06-28 00:51:42,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3650 conditions, 820 events. 304/820 cut-off events. For 11048/11139 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4918 event pairs, 50 based on Foata normal form. 15/797 useless extension candidates. Maximal degree in co-relation 3006. Up to 205 conditions per place. [2024-06-28 00:51:42,567 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 65 selfloop transitions, 8 changer transitions 17/125 dead transitions. [2024-06-28 00:51:42,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 125 transitions, 1413 flow [2024-06-28 00:51:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2024-06-28 00:51:42,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6120218579234973 [2024-06-28 00:51:42,569 INFO L175 Difference]: Start difference. First operand has 163 places, 114 transitions, 1155 flow. Second operand 6 states and 224 transitions. [2024-06-28 00:51:42,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 125 transitions, 1413 flow [2024-06-28 00:51:42,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 125 transitions, 1375 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 00:51:42,589 INFO L231 Difference]: Finished difference. Result has 163 places, 102 transitions, 989 flow [2024-06-28 00:51:42,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=989, PETRI_PLACES=163, PETRI_TRANSITIONS=102} [2024-06-28 00:51:42,590 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 107 predicate places. [2024-06-28 00:51:42,590 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 102 transitions, 989 flow [2024-06-28 00:51:42,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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-28 00:51:42,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:42,590 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] [2024-06-28 00:51:42,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 00:51:42,590 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:42,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:42,591 INFO L85 PathProgramCache]: Analyzing trace with hash -134097142, now seen corresponding path program 3 times [2024-06-28 00:51:42,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:42,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834701220] [2024-06-28 00:51:42,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:42,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:42,653 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-28 00:51:42,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:42,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834701220] [2024-06-28 00:51:42,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834701220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:42,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:42,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:42,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798720974] [2024-06-28 00:51:42,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:42,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:42,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:42,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:42,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:42,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:42,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 102 transitions, 989 flow. Second operand has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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-28 00:51:42,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:42,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:42,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:42,793 INFO L124 PetriNetUnfolderBase]: 244/688 cut-off events. [2024-06-28 00:51:42,793 INFO L125 PetriNetUnfolderBase]: For 8077/8122 co-relation queries the response was YES. [2024-06-28 00:51:42,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2819 conditions, 688 events. 244/688 cut-off events. For 8077/8122 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3918 event pairs, 35 based on Foata normal form. 12/676 useless extension candidates. Maximal degree in co-relation 2539. Up to 190 conditions per place. [2024-06-28 00:51:42,796 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 35 selfloop transitions, 5 changer transitions 51/111 dead transitions. [2024-06-28 00:51:42,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 111 transitions, 1165 flow [2024-06-28 00:51:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2024-06-28 00:51:42,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6038251366120219 [2024-06-28 00:51:42,797 INFO L175 Difference]: Start difference. First operand has 163 places, 102 transitions, 989 flow. Second operand 6 states and 221 transitions. [2024-06-28 00:51:42,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 111 transitions, 1165 flow [2024-06-28 00:51:42,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 111 transitions, 1102 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-28 00:51:42,810 INFO L231 Difference]: Finished difference. Result has 151 places, 57 transitions, 478 flow [2024-06-28 00:51:42,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=151, PETRI_TRANSITIONS=57} [2024-06-28 00:51:42,810 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 95 predicate places. [2024-06-28 00:51:42,810 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 57 transitions, 478 flow [2024-06-28 00:51:42,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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-28 00:51:42,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:42,811 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] [2024-06-28 00:51:42,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 00:51:42,811 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:42,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash 390150710, now seen corresponding path program 1 times [2024-06-28 00:51:42,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:42,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26850908] [2024-06-28 00:51:42,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:42,880 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-28 00:51:42,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:42,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26850908] [2024-06-28 00:51:42,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26850908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:42,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:42,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:42,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101938573] [2024-06-28 00:51:42,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:42,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:42,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:42,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:42,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:42,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 57 transitions, 478 flow. Second operand has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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-28 00:51:42,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:42,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:42,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:42,985 INFO L124 PetriNetUnfolderBase]: 124/338 cut-off events. [2024-06-28 00:51:42,985 INFO L125 PetriNetUnfolderBase]: For 3814/3844 co-relation queries the response was YES. [2024-06-28 00:51:42,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 338 events. 124/338 cut-off events. For 3814/3844 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1495 event pairs, 17 based on Foata normal form. 19/343 useless extension candidates. Maximal degree in co-relation 1345. Up to 91 conditions per place. [2024-06-28 00:51:42,987 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 27 selfloop transitions, 12 changer transitions 7/66 dead transitions. [2024-06-28 00:51:42,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 66 transitions, 604 flow [2024-06-28 00:51:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-06-28 00:51:42,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.587431693989071 [2024-06-28 00:51:42,988 INFO L175 Difference]: Start difference. First operand has 151 places, 57 transitions, 478 flow. Second operand 6 states and 215 transitions. [2024-06-28 00:51:42,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 66 transitions, 604 flow [2024-06-28 00:51:42,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 66 transitions, 451 flow, removed 12 selfloop flow, removed 36 redundant places. [2024-06-28 00:51:42,993 INFO L231 Difference]: Finished difference. Result has 95 places, 54 transitions, 342 flow [2024-06-28 00:51:42,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=95, PETRI_TRANSITIONS=54} [2024-06-28 00:51:42,994 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 39 predicate places. [2024-06-28 00:51:42,994 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 54 transitions, 342 flow [2024-06-28 00:51:42,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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-28 00:51:42,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:51:42,994 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] [2024-06-28 00:51:42,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 00:51:42,995 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-28 00:51:42,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:51:42,995 INFO L85 PathProgramCache]: Analyzing trace with hash 307958884, now seen corresponding path program 2 times [2024-06-28 00:51:42,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:51:42,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939678360] [2024-06-28 00:51:42,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:51:42,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:51:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:51:43,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-28 00:51:43,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:51:43,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939678360] [2024-06-28 00:51:43,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939678360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:51:43,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:51:43,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:51:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749297527] [2024-06-28 00:51:43,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:51:43,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:51:43,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:51:43,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:51:43,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:51:43,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-28 00:51:43,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 54 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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-28 00:51:43,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:51:43,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-28 00:51:43,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:51:43,130 INFO L124 PetriNetUnfolderBase]: 90/268 cut-off events. [2024-06-28 00:51:43,131 INFO L125 PetriNetUnfolderBase]: For 1131/1157 co-relation queries the response was YES. [2024-06-28 00:51:43,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 268 events. 90/268 cut-off events. For 1131/1157 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1176 event pairs, 12 based on Foata normal form. 7/267 useless extension candidates. Maximal degree in co-relation 835. Up to 80 conditions per place. [2024-06-28 00:51:43,132 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 0 selfloop transitions, 0 changer transitions 60/60 dead transitions. [2024-06-28 00:51:43,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 60 transitions, 402 flow [2024-06-28 00:51:43,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:51:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:51:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-06-28 00:51:43,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5792349726775956 [2024-06-28 00:51:43,133 INFO L175 Difference]: Start difference. First operand has 95 places, 54 transitions, 342 flow. Second operand 6 states and 212 transitions. [2024-06-28 00:51:43,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 60 transitions, 402 flow [2024-06-28 00:51:43,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 60 transitions, 333 flow, removed 1 selfloop flow, removed 22 redundant places. [2024-06-28 00:51:43,135 INFO L231 Difference]: Finished difference. Result has 76 places, 0 transitions, 0 flow [2024-06-28 00:51:43,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=76, PETRI_TRANSITIONS=0} [2024-06-28 00:51:43,135 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2024-06-28 00:51:43,135 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 0 transitions, 0 flow [2024-06-28 00:51:43,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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-28 00:51:43,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-06-28 00:51:43,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-06-28 00:51:43,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-06-28 00:51:43,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-06-28 00:51:43,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-06-28 00:51:43,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-06-28 00:51:43,140 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-06-28 00:51:43,140 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-06-28 00:51:43,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 00:51:43,140 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:51:43,144 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 00:51:43,144 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 00:51:43,147 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 00:51:43,147 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 00:51:43,148 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 12:51:43 BasicIcfg [2024-06-28 00:51:43,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 00:51:43,148 INFO L158 Benchmark]: Toolchain (without parser) took 16769.00ms. Allocated memory was 207.6MB in the beginning and 721.4MB in the end (delta: 513.8MB). Free memory was 131.3MB in the beginning and 530.5MB in the end (delta: -399.2MB). Peak memory consumption was 115.9MB. Max. memory is 16.1GB. [2024-06-28 00:51:43,148 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 207.6MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 00:51:43,149 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 207.6MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 00:51:43,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.61ms. Allocated memory is still 207.6MB. Free memory was 131.2MB in the beginning and 171.9MB in the end (delta: -40.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-06-28 00:51:43,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.29ms. Allocated memory is still 207.6MB. Free memory was 171.9MB in the beginning and 169.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 00:51:43,149 INFO L158 Benchmark]: Boogie Preprocessor took 30.96ms. Allocated memory is still 207.6MB. Free memory was 169.9MB in the beginning and 167.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 00:51:43,150 INFO L158 Benchmark]: RCFGBuilder took 354.97ms. Allocated memory is still 207.6MB. Free memory was 167.8MB in the beginning and 145.5MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-06-28 00:51:43,150 INFO L158 Benchmark]: TraceAbstraction took 15803.86ms. Allocated memory was 207.6MB in the beginning and 721.4MB in the end (delta: 513.8MB). Free memory was 144.8MB in the beginning and 530.5MB in the end (delta: -385.8MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. [2024-06-28 00:51:43,151 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.15ms. Allocated memory is still 207.6MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 207.6MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 546.61ms. Allocated memory is still 207.6MB. Free memory was 131.2MB in the beginning and 171.9MB in the end (delta: -40.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.29ms. Allocated memory is still 207.6MB. Free memory was 171.9MB in the beginning and 169.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.96ms. Allocated memory is still 207.6MB. Free memory was 169.9MB in the beginning and 167.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.97ms. Allocated memory is still 207.6MB. Free memory was 167.8MB in the beginning and 145.5MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15803.86ms. Allocated memory was 207.6MB in the beginning and 721.4MB in the end (delta: 513.8MB). Free memory was 144.8MB in the beginning and 530.5MB in the end (delta: -385.8MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 780]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 739]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 793]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 794]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 96 locations, 8 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: 15.7s, OverallIterations: 47, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5035 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3451 mSDsluCounter, 2145 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1465 mSDsCounter, 514 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6947 IncrementalHoareTripleChecker+Invalid, 7461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 514 mSolverCounterUnsat, 680 mSDtfsCounter, 6947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2633occurred in iteration=18, InterpolantAutomatonStates: 265, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 773 NumberOfCodeBlocks, 773 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 726 ConstructedInterpolants, 0 QuantifiedInterpolants, 3125 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-28 00:51:43,170 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 Result: TRUE