./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/protection/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/protection/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-27 17:47:58,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:47:59,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:47:59,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:47:59,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:47:59,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:47:59,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:47:59,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:47:59,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:47:59,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:47:59,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:47:59,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:47:59,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:47:59,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:47:59,091 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:47:59,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:47:59,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:47:59,091 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:47:59,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:47:59,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:47:59,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:47:59,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:47:59,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:47:59,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:47:59,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:47:59,093 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:47:59,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:47:59,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:47:59,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:47:59,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:47:59,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:47:59,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:47:59,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:47:59,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:47:59,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:47:59,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:47:59,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:47:59,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:47:59,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:47:59,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:47:59,097 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:47:59,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:47:59,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:47:59,097 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 17:47:59,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:47:59,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:47:59,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:47:59,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:47:59,324 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:47:59,325 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-27 17:48:00,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:48:00,693 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:48:00,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2024-06-27 17:48:00,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25db19deb/ca1caa43c03d4b06b3c07f1455fa38ff/FLAGcf24b57c2 [2024-06-27 17:48:00,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25db19deb/ca1caa43c03d4b06b3c07f1455fa38ff [2024-06-27 17:48:00,738 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 17:48:00,738 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 17:48:00,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/dekker.yml/witness.yml [2024-06-27 17:48:00,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:48:00,821 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 17:48:00,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:48:00,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:48:00,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:48:00,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:48:00" (1/2) ... [2024-06-27 17:48:00,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5f0e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:48:00, skipping insertion in model container [2024-06-27 17:48:00,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:48:00" (1/2) ... [2024-06-27 17:48:00,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4bf64fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:48:00, skipping insertion in model container [2024-06-27 17:48:00,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 05:48:00" (2/2) ... [2024-06-27 17:48:00,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5f0e67 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:00, skipping insertion in model container [2024-06-27 17:48:00,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 05:48:00" (2/2) ... [2024-06-27 17:48:00,829 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 17:48:00,855 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 17:48:00,856 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] (((! multithreaded || (flag1 == 0 || flag1 == 1)) && (! multithreaded || (turn == 0 || turn == 1))) && (! multithreaded || (flag2 == 0 || flag2 == 1))) && (! multithreaded || (x == 0 || x == 1)) [2024-06-27 17:48:00,856 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] (((! multithreaded || (flag1 == 0 || flag1 == 1)) && (! multithreaded || (turn == 0 || turn == 1))) && (! multithreaded || (flag2 == 0 || flag2 == 1))) && (! multithreaded || (x == 0 || x == 1)) [2024-06-27 17:48:00,856 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 17:48:00,856 INFO L106 edCorrectnessWitness]: ghost_update [L792-L792] multithreaded = 1; [2024-06-27 17:48:00,894 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:48:01,157 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-27 17:48:01,166 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-27 17:48:01,170 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:48:01,177 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 17:48:01,230 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-27 17:48:01,233 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-27 17:48:01,241 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:48:01,270 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:48:01,271 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01 WrapperNode [2024-06-27 17:48:01,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:48:01,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:48:01,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:48:01,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:48:01,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (1/1) ... [2024-06-27 17:48:01,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (1/1) ... [2024-06-27 17:48:01,314 INFO L138 Inliner]: procedures = 170, calls = 49, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-06-27 17:48:01,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:48:01,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:48:01,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:48:01,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:48:01,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (1/1) ... [2024-06-27 17:48:01,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (1/1) ... [2024-06-27 17:48:01,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (1/1) ... [2024-06-27 17:48:01,354 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 17:48:01,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (1/1) ... [2024-06-27 17:48:01,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (1/1) ... [2024-06-27 17:48:01,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (1/1) ... [2024-06-27 17:48:01,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (1/1) ... [2024-06-27 17:48:01,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (1/1) ... [2024-06-27 17:48:01,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (1/1) ... [2024-06-27 17:48:01,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:48:01,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:48:01,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:48:01,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:48:01,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (1/1) ... [2024-06-27 17:48:01,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:48:01,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:48:01,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:48:01,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:48:01,515 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-06-27 17:48:01,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-06-27 17:48:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-27 17:48:01,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-27 17:48:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:48:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:48:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:48:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:48:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:48:01,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:48:01,518 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:48:01,636 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:48:01,638 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:48:01,818 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:48:01,819 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:48:01,890 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:48:01,891 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 17:48:01,892 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:48:01 BoogieIcfgContainer [2024-06-27 17:48:01,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:48:01,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:48:01,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:48:01,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:48:01,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:48:00" (1/4) ... [2024-06-27 17:48:01,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f26f38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:48:01, skipping insertion in model container [2024-06-27 17:48:01,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 05:48:00" (2/4) ... [2024-06-27 17:48:01,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f26f38b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 05:48:01, skipping insertion in model container [2024-06-27 17:48:01,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:48:01" (3/4) ... [2024-06-27 17:48:01,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f26f38b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 05:48:01, skipping insertion in model container [2024-06-27 17:48:01,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:48:01" (4/4) ... [2024-06-27 17:48:01,900 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker.i [2024-06-27 17:48:01,913 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:48:01,913 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 17:48:01,913 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:48:01,951 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:48:01,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 61 transitions, 136 flow [2024-06-27 17:48:02,016 INFO L124 PetriNetUnfolderBase]: 8/59 cut-off events. [2024-06-27 17:48:02,017 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:48:02,020 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-27 17:48:02,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 61 transitions, 136 flow [2024-06-27 17:48:02,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 57 transitions, 123 flow [2024-06-27 17:48:02,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:48:02,041 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;@295da16b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:48:02,042 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 17:48:02,047 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:48:02,048 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 17:48:02,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:48:02,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:02,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 17:48:02,049 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-27 17:48:02,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:02,056 INFO L85 PathProgramCache]: Analyzing trace with hash 241729773, now seen corresponding path program 1 times [2024-06-27 17:48:02,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:02,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706762678] [2024-06-27 17:48:02,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:02,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:02,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706762678] [2024-06-27 17:48:02,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706762678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:02,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:02,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 17:48:02,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756934836] [2024-06-27 17:48:02,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:02,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:48:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:02,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:48:02,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:48:02,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2024-06-27 17:48:02,499 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-27 17:48:02,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:02,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2024-06-27 17:48:02,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:02,646 INFO L124 PetriNetUnfolderBase]: 455/1155 cut-off events. [2024-06-27 17:48:02,647 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-06-27 17:48:02,651 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-27 17:48:02,657 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 26 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2024-06-27 17:48:02,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 192 flow [2024-06-27 17:48:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:48:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:48:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-06-27 17:48:02,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7377049180327869 [2024-06-27 17:48:02,667 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 123 flow. Second operand 3 states and 135 transitions. [2024-06-27 17:48:02,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 192 flow [2024-06-27 17:48:02,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:48:02,672 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 135 flow [2024-06-27 17:48:02,673 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-27 17:48:02,676 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2024-06-27 17:48:02,676 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 135 flow [2024-06-27 17:48:02,676 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-27 17:48:02,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:02,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:02,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:48:02,677 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-27 17:48:02,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:02,677 INFO L85 PathProgramCache]: Analyzing trace with hash 374132076, now seen corresponding path program 1 times [2024-06-27 17:48:02,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:02,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709123927] [2024-06-27 17:48:02,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:02,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:02,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709123927] [2024-06-27 17:48:02,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709123927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:02,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:02,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:48:02,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918455051] [2024-06-27 17:48:02,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:02,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:48:02,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:02,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:48:02,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:48:02,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 61 [2024-06-27 17:48:02,785 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-27 17:48:02,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:02,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 61 [2024-06-27 17:48:02,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:02,914 INFO L124 PetriNetUnfolderBase]: 544/1270 cut-off events. [2024-06-27 17:48:02,923 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-06-27 17:48:02,926 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-27 17:48:02,931 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 36 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2024-06-27 17:48:02,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 269 flow [2024-06-27 17:48:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:48:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:48:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2024-06-27 17:48:02,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7131147540983607 [2024-06-27 17:48:02,939 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 135 flow. Second operand 4 states and 174 transitions. [2024-06-27 17:48:02,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 269 flow [2024-06-27 17:48:02,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:48:02,942 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 187 flow [2024-06-27 17:48:02,942 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-27 17:48:02,942 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2024-06-27 17:48:02,943 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 187 flow [2024-06-27 17:48:02,943 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-27 17:48:02,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:02,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:02,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:48:02,945 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-27 17:48:02,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:02,946 INFO L85 PathProgramCache]: Analyzing trace with hash -966928583, now seen corresponding path program 1 times [2024-06-27 17:48:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:02,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709590264] [2024-06-27 17:48:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:03,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:03,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709590264] [2024-06-27 17:48:03,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709590264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:03,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:03,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:48:03,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265242882] [2024-06-27 17:48:03,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:03,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:48:03,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:03,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:48:03,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:48:03,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 61 [2024-06-27 17:48:03,078 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-27 17:48:03,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:03,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 61 [2024-06-27 17:48:03,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:03,180 INFO L124 PetriNetUnfolderBase]: 540/1221 cut-off events. [2024-06-27 17:48:03,181 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2024-06-27 17:48:03,184 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-27 17:48:03,190 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 35 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2024-06-27 17:48:03,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 307 flow [2024-06-27 17:48:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:48:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:48:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2024-06-27 17:48:03,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6844262295081968 [2024-06-27 17:48:03,192 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 187 flow. Second operand 4 states and 167 transitions. [2024-06-27 17:48:03,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 307 flow [2024-06-27 17:48:03,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 305 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 17:48:03,195 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 236 flow [2024-06-27 17:48:03,195 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-27 17:48:03,196 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2024-06-27 17:48:03,196 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 236 flow [2024-06-27 17:48:03,197 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-27 17:48:03,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:03,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:03,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:48:03,197 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-27 17:48:03,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:03,198 INFO L85 PathProgramCache]: Analyzing trace with hash 498737831, now seen corresponding path program 1 times [2024-06-27 17:48:03,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:03,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433614623] [2024-06-27 17:48:03,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:03,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:03,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:03,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433614623] [2024-06-27 17:48:03,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433614623] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:03,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:03,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:48:03,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078010849] [2024-06-27 17:48:03,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:03,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:03,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:03,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:03,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:03,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:03,343 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-27 17:48:03,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:03,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:03,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:03,492 INFO L124 PetriNetUnfolderBase]: 669/1474 cut-off events. [2024-06-27 17:48:03,492 INFO L125 PetriNetUnfolderBase]: For 894/932 co-relation queries the response was YES. [2024-06-27 17:48:03,495 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-27 17:48:03,501 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 54 selfloop transitions, 26 changer transitions 0/108 dead transitions. [2024-06-27 17:48:03,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 108 transitions, 532 flow [2024-06-27 17:48:03,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 252 transitions. [2024-06-27 17:48:03,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2024-06-27 17:48:03,503 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 236 flow. Second operand 6 states and 252 transitions. [2024-06-27 17:48:03,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 108 transitions, 532 flow [2024-06-27 17:48:03,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 530 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 17:48:03,506 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 386 flow [2024-06-27 17:48:03,507 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-27 17:48:03,507 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2024-06-27 17:48:03,507 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 386 flow [2024-06-27 17:48:03,508 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-27 17:48:03,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:03,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:03,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:48:03,508 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-27 17:48:03,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:03,509 INFO L85 PathProgramCache]: Analyzing trace with hash 99610378, now seen corresponding path program 1 times [2024-06-27 17:48:03,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:03,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653770358] [2024-06-27 17:48:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:03,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:03,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:03,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653770358] [2024-06-27 17:48:03,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653770358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:03,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:03,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:48:03,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608490524] [2024-06-27 17:48:03,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:03,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:48:03,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:03,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:48:03,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:48:03,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:03,641 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-27 17:48:03,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:03,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:03,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:03,769 INFO L124 PetriNetUnfolderBase]: 691/1493 cut-off events. [2024-06-27 17:48:03,770 INFO L125 PetriNetUnfolderBase]: For 2483/2549 co-relation queries the response was YES. [2024-06-27 17:48:03,774 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-27 17:48:03,780 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 59 selfloop transitions, 25 changer transitions 0/112 dead transitions. [2024-06-27 17:48:03,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 112 transitions, 725 flow [2024-06-27 17:48:03,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:48:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:48:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2024-06-27 17:48:03,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6983606557377049 [2024-06-27 17:48:03,781 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 386 flow. Second operand 5 states and 213 transitions. [2024-06-27 17:48:03,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 112 transitions, 725 flow [2024-06-27 17:48:03,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 112 transitions, 691 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-27 17:48:03,787 INFO L231 Difference]: Finished difference. Result has 80 places, 91 transitions, 550 flow [2024-06-27 17:48:03,787 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-27 17:48:03,788 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places. [2024-06-27 17:48:03,788 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 91 transitions, 550 flow [2024-06-27 17:48:03,788 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-27 17:48:03,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:03,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:03,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:48:03,789 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-27 17:48:03,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:03,789 INFO L85 PathProgramCache]: Analyzing trace with hash -789488870, now seen corresponding path program 2 times [2024-06-27 17:48:03,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:03,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747140846] [2024-06-27 17:48:03,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:03,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:03,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:03,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747140846] [2024-06-27 17:48:03,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747140846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:03,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:03,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:48:03,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249094669] [2024-06-27 17:48:03,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:03,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:48:03,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:03,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:48:03,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:48:03,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:03,890 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-27 17:48:03,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:03,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:03,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:04,020 INFO L124 PetriNetUnfolderBase]: 676/1452 cut-off events. [2024-06-27 17:48:04,020 INFO L125 PetriNetUnfolderBase]: For 4047/4146 co-relation queries the response was YES. [2024-06-27 17:48:04,024 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-27 17:48:04,031 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 58 selfloop transitions, 26 changer transitions 0/112 dead transitions. [2024-06-27 17:48:04,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 112 transitions, 831 flow [2024-06-27 17:48:04,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:48:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:48:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2024-06-27 17:48:04,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6852459016393443 [2024-06-27 17:48:04,032 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 550 flow. Second operand 5 states and 209 transitions. [2024-06-27 17:48:04,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 112 transitions, 831 flow [2024-06-27 17:48:04,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 112 transitions, 817 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-06-27 17:48:04,039 INFO L231 Difference]: Finished difference. Result has 86 places, 96 transitions, 662 flow [2024-06-27 17:48:04,039 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-27 17:48:04,040 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2024-06-27 17:48:04,040 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 96 transitions, 662 flow [2024-06-27 17:48:04,040 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-27 17:48:04,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:04,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:04,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:48:04,041 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-27 17:48:04,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:04,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1183963254, now seen corresponding path program 1 times [2024-06-27 17:48:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:04,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451772312] [2024-06-27 17:48:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:04,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:04,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:04,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:04,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451772312] [2024-06-27 17:48:04,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451772312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:04,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:04,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:48:04,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951547739] [2024-06-27 17:48:04,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:04,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:48:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:04,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:48:04,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:48:04,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2024-06-27 17:48:04,081 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-27 17:48:04,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:04,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2024-06-27 17:48:04,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:04,205 INFO L124 PetriNetUnfolderBase]: 633/1497 cut-off events. [2024-06-27 17:48:04,205 INFO L125 PetriNetUnfolderBase]: For 4218/4322 co-relation queries the response was YES. [2024-06-27 17:48:04,210 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-27 17:48:04,216 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 41 selfloop transitions, 28 changer transitions 0/121 dead transitions. [2024-06-27 17:48:04,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 121 transitions, 875 flow [2024-06-27 17:48:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:48:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:48:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2024-06-27 17:48:04,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7639344262295082 [2024-06-27 17:48:04,218 INFO L175 Difference]: Start difference. First operand has 86 places, 96 transitions, 662 flow. Second operand 5 states and 233 transitions. [2024-06-27 17:48:04,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 121 transitions, 875 flow [2024-06-27 17:48:04,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 121 transitions, 841 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-27 17:48:04,226 INFO L231 Difference]: Finished difference. Result has 91 places, 100 transitions, 747 flow [2024-06-27 17:48:04,227 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-27 17:48:04,227 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 35 predicate places. [2024-06-27 17:48:04,227 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 747 flow [2024-06-27 17:48:04,227 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-27 17:48:04,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:04,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:04,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:48:04,228 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-27 17:48:04,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash -420949463, now seen corresponding path program 1 times [2024-06-27 17:48:04,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:04,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276609576] [2024-06-27 17:48:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:04,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:04,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:04,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276609576] [2024-06-27 17:48:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276609576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:04,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:48:04,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203964587] [2024-06-27 17:48:04,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:04,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:04,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:04,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:04,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:04,326 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-27 17:48:04,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:04,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:04,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:04,540 INFO L124 PetriNetUnfolderBase]: 1061/2187 cut-off events. [2024-06-27 17:48:04,541 INFO L125 PetriNetUnfolderBase]: For 9519/9841 co-relation queries the response was YES. [2024-06-27 17:48:04,547 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-27 17:48:04,557 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 67 selfloop transitions, 41 changer transitions 0/138 dead transitions. [2024-06-27 17:48:04,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 138 transitions, 1182 flow [2024-06-27 17:48:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 249 transitions. [2024-06-27 17:48:04,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.680327868852459 [2024-06-27 17:48:04,559 INFO L175 Difference]: Start difference. First operand has 91 places, 100 transitions, 747 flow. Second operand 6 states and 249 transitions. [2024-06-27 17:48:04,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 138 transitions, 1182 flow [2024-06-27 17:48:04,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 138 transitions, 1182 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:48:04,569 INFO L231 Difference]: Finished difference. Result has 99 places, 110 transitions, 994 flow [2024-06-27 17:48:04,570 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-27 17:48:04,570 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 43 predicate places. [2024-06-27 17:48:04,570 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 110 transitions, 994 flow [2024-06-27 17:48:04,570 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-27 17:48:04,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:04,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:04,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:48:04,571 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-27 17:48:04,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1505387401, now seen corresponding path program 1 times [2024-06-27 17:48:04,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:04,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656065614] [2024-06-27 17:48:04,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:04,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:04,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656065614] [2024-06-27 17:48:04,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656065614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:04,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:04,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:48:04,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609009109] [2024-06-27 17:48:04,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:04,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:48:04,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:04,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:48:04,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:48:04,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 61 [2024-06-27 17:48:04,685 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-27 17:48:04,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:04,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 61 [2024-06-27 17:48:04,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:04,907 INFO L124 PetriNetUnfolderBase]: 1055/2182 cut-off events. [2024-06-27 17:48:04,908 INFO L125 PetriNetUnfolderBase]: For 14667/15018 co-relation queries the response was YES. [2024-06-27 17:48:04,916 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-27 17:48:04,927 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 73 selfloop transitions, 10 changer transitions 0/120 dead transitions. [2024-06-27 17:48:04,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 120 transitions, 1202 flow [2024-06-27 17:48:04,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:48:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:48:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 202 transitions. [2024-06-27 17:48:04,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6622950819672131 [2024-06-27 17:48:04,929 INFO L175 Difference]: Start difference. First operand has 99 places, 110 transitions, 994 flow. Second operand 5 states and 202 transitions. [2024-06-27 17:48:04,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 120 transitions, 1202 flow [2024-06-27 17:48:04,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 120 transitions, 1138 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-27 17:48:04,946 INFO L231 Difference]: Finished difference. Result has 102 places, 112 transitions, 971 flow [2024-06-27 17:48:04,946 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-27 17:48:04,947 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 46 predicate places. [2024-06-27 17:48:04,947 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 112 transitions, 971 flow [2024-06-27 17:48:04,947 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-27 17:48:04,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:04,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:04,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:48:04,948 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-27 17:48:04,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:04,948 INFO L85 PathProgramCache]: Analyzing trace with hash 321013558, now seen corresponding path program 1 times [2024-06-27 17:48:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:04,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921388824] [2024-06-27 17:48:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:04,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:04,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921388824] [2024-06-27 17:48:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921388824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:04,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:04,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:48:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128612844] [2024-06-27 17:48:04,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:04,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:48:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:04,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:48:04,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:48:04,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 61 [2024-06-27 17:48:04,987 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-27 17:48:04,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:04,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 61 [2024-06-27 17:48:04,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:05,148 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-27 17:48:05,149 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-06-27 17:48:05,149 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:48:05,149 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 17:48:05,149 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:48:05,183 INFO L124 PetriNetUnfolderBase]: 962/2337 cut-off events. [2024-06-27 17:48:05,183 INFO L125 PetriNetUnfolderBase]: For 10504/10620 co-relation queries the response was YES. [2024-06-27 17:48:05,193 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-27 17:48:05,202 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 39 selfloop transitions, 28 changer transitions 0/140 dead transitions. [2024-06-27 17:48:05,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 140 transitions, 1233 flow [2024-06-27 17:48:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:48:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:48:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2024-06-27 17:48:05,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7639344262295082 [2024-06-27 17:48:05,203 INFO L175 Difference]: Start difference. First operand has 102 places, 112 transitions, 971 flow. Second operand 5 states and 233 transitions. [2024-06-27 17:48:05,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 140 transitions, 1233 flow [2024-06-27 17:48:05,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 140 transitions, 1210 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 17:48:05,221 INFO L231 Difference]: Finished difference. Result has 106 places, 122 transitions, 1123 flow [2024-06-27 17:48:05,222 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-27 17:48:05,222 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 50 predicate places. [2024-06-27 17:48:05,222 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 122 transitions, 1123 flow [2024-06-27 17:48:05,223 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-27 17:48:05,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:05,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:05,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:48:05,223 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-27 17:48:05,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2055865628, now seen corresponding path program 2 times [2024-06-27 17:48:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:05,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965593296] [2024-06-27 17:48:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:05,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:05,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:05,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965593296] [2024-06-27 17:48:05,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965593296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:05,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:05,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:48:05,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024642403] [2024-06-27 17:48:05,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:05,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:05,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:05,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:05,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:05,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:05,346 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-27 17:48:05,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:05,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:05,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:05,662 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-27 17:48:05,662 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-27 17:48:05,663 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 17:48:05,663 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 17:48:05,663 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 17:48:05,665 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-27 17:48:05,665 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 17:48:05,666 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 17:48:05,666 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 17:48:05,666 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 17:48:05,669 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-27 17:48:05,670 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 17:48:05,670 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:48:05,670 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 17:48:05,670 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:48:05,675 INFO L124 PetriNetUnfolderBase]: 1489/3129 cut-off events. [2024-06-27 17:48:05,676 INFO L125 PetriNetUnfolderBase]: For 21173/21462 co-relation queries the response was YES. [2024-06-27 17:48:05,690 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-27 17:48:05,702 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 78 selfloop transitions, 42 changer transitions 0/153 dead transitions. [2024-06-27 17:48:05,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 153 transitions, 1544 flow [2024-06-27 17:48:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 252 transitions. [2024-06-27 17:48:05,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2024-06-27 17:48:05,704 INFO L175 Difference]: Start difference. First operand has 106 places, 122 transitions, 1123 flow. Second operand 6 states and 252 transitions. [2024-06-27 17:48:05,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 153 transitions, 1544 flow [2024-06-27 17:48:05,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 153 transitions, 1544 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:48:05,734 INFO L231 Difference]: Finished difference. Result has 113 places, 131 transitions, 1318 flow [2024-06-27 17:48:05,734 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-27 17:48:05,735 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 57 predicate places. [2024-06-27 17:48:05,735 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 131 transitions, 1318 flow [2024-06-27 17:48:05,735 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-27 17:48:05,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:05,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:05,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 17:48:05,736 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-27 17:48:05,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash 726752118, now seen corresponding path program 3 times [2024-06-27 17:48:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923445519] [2024-06-27 17:48:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:05,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:05,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923445519] [2024-06-27 17:48:05,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923445519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:05,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:05,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:48:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092522695] [2024-06-27 17:48:05,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:05,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:05,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:05,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:05,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:05,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:05,845 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-27 17:48:05,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:05,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:05,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:06,096 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-27 17:48:06,097 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-27 17:48:06,097 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 17:48:06,097 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 17:48:06,097 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 17:48:06,100 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-27 17:48:06,100 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 17:48:06,100 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 17:48:06,100 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 17:48:06,100 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 17:48:06,104 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-27 17:48:06,104 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 17:48:06,105 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:48:06,105 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:48:06,105 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 17:48:06,110 INFO L124 PetriNetUnfolderBase]: 1467/3079 cut-off events. [2024-06-27 17:48:06,111 INFO L125 PetriNetUnfolderBase]: For 26620/26923 co-relation queries the response was YES. [2024-06-27 17:48:06,125 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-27 17:48:06,139 INFO L140 encePairwiseOnDemand]: 48/61 looper letters, 80 selfloop transitions, 40 changer transitions 0/153 dead transitions. [2024-06-27 17:48:06,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 153 transitions, 1696 flow [2024-06-27 17:48:06,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 250 transitions. [2024-06-27 17:48:06,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6830601092896175 [2024-06-27 17:48:06,140 INFO L175 Difference]: Start difference. First operand has 113 places, 131 transitions, 1318 flow. Second operand 6 states and 250 transitions. [2024-06-27 17:48:06,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 153 transitions, 1696 flow [2024-06-27 17:48:06,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 153 transitions, 1661 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-27 17:48:06,171 INFO L231 Difference]: Finished difference. Result has 119 places, 133 transitions, 1401 flow [2024-06-27 17:48:06,171 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-27 17:48:06,172 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 63 predicate places. [2024-06-27 17:48:06,172 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 133 transitions, 1401 flow [2024-06-27 17:48:06,172 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-27 17:48:06,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:06,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:06,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 17:48:06,173 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-27 17:48:06,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:06,173 INFO L85 PathProgramCache]: Analyzing trace with hash 726736370, now seen corresponding path program 1 times [2024-06-27 17:48:06,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:06,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348173445] [2024-06-27 17:48:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:06,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:06,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:06,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348173445] [2024-06-27 17:48:06,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348173445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:06,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:06,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:48:06,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110833334] [2024-06-27 17:48:06,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:06,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:06,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:06,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:06,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:06,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:06,288 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-27 17:48:06,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:06,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:06,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:06,539 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-27 17:48:06,540 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-06-27 17:48:06,540 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 17:48:06,540 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:48:06,540 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:48:06,595 INFO L124 PetriNetUnfolderBase]: 1591/3356 cut-off events. [2024-06-27 17:48:06,595 INFO L125 PetriNetUnfolderBase]: For 33087/33486 co-relation queries the response was YES. [2024-06-27 17:48:06,611 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-27 17:48:06,625 INFO L140 encePairwiseOnDemand]: 48/61 looper letters, 87 selfloop transitions, 53 changer transitions 2/175 dead transitions. [2024-06-27 17:48:06,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 175 transitions, 2051 flow [2024-06-27 17:48:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 246 transitions. [2024-06-27 17:48:06,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2024-06-27 17:48:06,626 INFO L175 Difference]: Start difference. First operand has 119 places, 133 transitions, 1401 flow. Second operand 6 states and 246 transitions. [2024-06-27 17:48:06,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 175 transitions, 2051 flow [2024-06-27 17:48:06,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 175 transitions, 1996 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 17:48:06,667 INFO L231 Difference]: Finished difference. Result has 126 places, 148 transitions, 1744 flow [2024-06-27 17:48:06,667 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-27 17:48:06,667 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 70 predicate places. [2024-06-27 17:48:06,668 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 148 transitions, 1744 flow [2024-06-27 17:48:06,668 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-27 17:48:06,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:06,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:06,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 17:48:06,668 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-27 17:48:06,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1477200380, now seen corresponding path program 1 times [2024-06-27 17:48:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:06,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519895209] [2024-06-27 17:48:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:06,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:06,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519895209] [2024-06-27 17:48:06,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519895209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:06,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:06,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:48:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591053779] [2024-06-27 17:48:06,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:06,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:48:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:06,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:48:06,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:48:06,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2024-06-27 17:48:06,705 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-27 17:48:06,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:06,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2024-06-27 17:48:06,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:06,871 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-27 17:48:06,871 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-06-27 17:48:06,871 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 17:48:06,871 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:48:06,871 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:48:06,886 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-27 17:48:06,887 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 17:48:06,887 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:48:06,887 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 17:48:06,887 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:48:06,889 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-27 17:48:06,889 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 17:48:06,889 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 17:48:06,889 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-27 17:48:06,889 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 17:48:06,898 INFO L124 PetriNetUnfolderBase]: 880/2112 cut-off events. [2024-06-27 17:48:06,899 INFO L125 PetriNetUnfolderBase]: For 19492/19615 co-relation queries the response was YES. [2024-06-27 17:48:06,908 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-27 17:48:06,915 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 41 selfloop transitions, 37 changer transitions 0/160 dead transitions. [2024-06-27 17:48:06,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 160 transitions, 1885 flow [2024-06-27 17:48:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:48:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:48:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-06-27 17:48:06,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7442622950819672 [2024-06-27 17:48:06,917 INFO L175 Difference]: Start difference. First operand has 126 places, 148 transitions, 1744 flow. Second operand 5 states and 227 transitions. [2024-06-27 17:48:06,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 160 transitions, 1885 flow [2024-06-27 17:48:06,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 160 transitions, 1812 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-27 17:48:06,949 INFO L231 Difference]: Finished difference. Result has 129 places, 144 transitions, 1705 flow [2024-06-27 17:48:06,949 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-27 17:48:06,949 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 73 predicate places. [2024-06-27 17:48:06,950 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 144 transitions, 1705 flow [2024-06-27 17:48:06,950 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-27 17:48:06,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:06,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:06,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 17:48:06,950 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-27 17:48:06,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1040144711, now seen corresponding path program 1 times [2024-06-27 17:48:06,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:06,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028864997] [2024-06-27 17:48:06,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:07,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:07,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028864997] [2024-06-27 17:48:07,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028864997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:07,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:07,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:48:07,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278322224] [2024-06-27 17:48:07,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:07,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:07,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:07,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:07,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:07,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:07,066 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-27 17:48:07,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:07,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:07,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:07,317 INFO L124 PetriNetUnfolderBase]: 1149/2506 cut-off events. [2024-06-27 17:48:07,318 INFO L125 PetriNetUnfolderBase]: For 29340/29515 co-relation queries the response was YES. [2024-06-27 17:48:07,327 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-27 17:48:07,334 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 91 selfloop transitions, 52 changer transitions 3/178 dead transitions. [2024-06-27 17:48:07,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 178 transitions, 2268 flow [2024-06-27 17:48:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 245 transitions. [2024-06-27 17:48:07,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6693989071038251 [2024-06-27 17:48:07,336 INFO L175 Difference]: Start difference. First operand has 129 places, 144 transitions, 1705 flow. Second operand 6 states and 245 transitions. [2024-06-27 17:48:07,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 178 transitions, 2268 flow [2024-06-27 17:48:07,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 178 transitions, 2237 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:48:07,373 INFO L231 Difference]: Finished difference. Result has 137 places, 151 transitions, 1950 flow [2024-06-27 17:48:07,373 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-27 17:48:07,374 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 81 predicate places. [2024-06-27 17:48:07,374 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 151 transitions, 1950 flow [2024-06-27 17:48:07,374 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-27 17:48:07,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:07,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:07,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 17:48:07,375 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-27 17:48:07,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:07,375 INFO L85 PathProgramCache]: Analyzing trace with hash 739313367, now seen corresponding path program 1 times [2024-06-27 17:48:07,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:07,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366895317] [2024-06-27 17:48:07,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:07,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:07,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:07,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366895317] [2024-06-27 17:48:07,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366895317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:07,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:07,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:07,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021743704] [2024-06-27 17:48:07,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:07,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:07,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:07,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:07,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:07,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:07,469 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-27 17:48:07,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:07,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:07,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:07,746 INFO L124 PetriNetUnfolderBase]: 1227/2639 cut-off events. [2024-06-27 17:48:07,746 INFO L125 PetriNetUnfolderBase]: For 38868/39071 co-relation queries the response was YES. [2024-06-27 17:48:07,757 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-27 17:48:07,765 INFO L140 encePairwiseOnDemand]: 47/61 looper letters, 95 selfloop transitions, 67 changer transitions 0/194 dead transitions. [2024-06-27 17:48:07,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 194 transitions, 2697 flow [2024-06-27 17:48:07,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2024-06-27 17:48:07,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7021857923497268 [2024-06-27 17:48:07,767 INFO L175 Difference]: Start difference. First operand has 137 places, 151 transitions, 1950 flow. Second operand 6 states and 257 transitions. [2024-06-27 17:48:07,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 194 transitions, 2697 flow [2024-06-27 17:48:07,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 194 transitions, 2623 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-27 17:48:07,823 INFO L231 Difference]: Finished difference. Result has 143 places, 158 transitions, 2194 flow [2024-06-27 17:48:07,823 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-27 17:48:07,824 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 87 predicate places. [2024-06-27 17:48:07,824 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 158 transitions, 2194 flow [2024-06-27 17:48:07,824 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-27 17:48:07,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:07,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:07,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 17:48:07,825 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-27 17:48:07,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash 711633777, now seen corresponding path program 2 times [2024-06-27 17:48:07,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:07,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688235776] [2024-06-27 17:48:07,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:07,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:07,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688235776] [2024-06-27 17:48:07,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688235776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:07,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:07,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:07,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948138205] [2024-06-27 17:48:07,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:07,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:07,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:07,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:07,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:07,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:07,949 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-27 17:48:07,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:07,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:07,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:08,235 INFO L124 PetriNetUnfolderBase]: 1257/2716 cut-off events. [2024-06-27 17:48:08,235 INFO L125 PetriNetUnfolderBase]: For 44930/45205 co-relation queries the response was YES. [2024-06-27 17:48:08,248 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-27 17:48:08,260 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 93 selfloop transitions, 69 changer transitions 0/194 dead transitions. [2024-06-27 17:48:08,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 194 transitions, 2919 flow [2024-06-27 17:48:08,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2024-06-27 17:48:08,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6639344262295082 [2024-06-27 17:48:08,262 INFO L175 Difference]: Start difference. First operand has 143 places, 158 transitions, 2194 flow. Second operand 6 states and 243 transitions. [2024-06-27 17:48:08,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 194 transitions, 2919 flow [2024-06-27 17:48:08,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 194 transitions, 2757 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-27 17:48:08,325 INFO L231 Difference]: Finished difference. Result has 148 places, 167 transitions, 2408 flow [2024-06-27 17:48:08,325 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-27 17:48:08,325 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 92 predicate places. [2024-06-27 17:48:08,325 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 167 transitions, 2408 flow [2024-06-27 17:48:08,326 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-27 17:48:08,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:08,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:08,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 17:48:08,327 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-27 17:48:08,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash -901477339, now seen corresponding path program 3 times [2024-06-27 17:48:08,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:08,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103774349] [2024-06-27 17:48:08,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:08,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:08,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:08,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103774349] [2024-06-27 17:48:08,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103774349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:08,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:08,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:08,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053554837] [2024-06-27 17:48:08,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:08,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:08,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:08,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:08,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:08,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:08,423 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-27 17:48:08,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:08,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:08,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:08,749 INFO L124 PetriNetUnfolderBase]: 1261/2724 cut-off events. [2024-06-27 17:48:08,749 INFO L125 PetriNetUnfolderBase]: For 48731/49048 co-relation queries the response was YES. [2024-06-27 17:48:08,763 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-27 17:48:08,775 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 80 selfloop transitions, 76 changer transitions 0/188 dead transitions. [2024-06-27 17:48:08,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 188 transitions, 2950 flow [2024-06-27 17:48:08,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2024-06-27 17:48:08,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6366120218579235 [2024-06-27 17:48:08,776 INFO L175 Difference]: Start difference. First operand has 148 places, 167 transitions, 2408 flow. Second operand 6 states and 233 transitions. [2024-06-27 17:48:08,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 188 transitions, 2950 flow [2024-06-27 17:48:08,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 188 transitions, 2843 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-27 17:48:08,851 INFO L231 Difference]: Finished difference. Result has 153 places, 174 transitions, 2633 flow [2024-06-27 17:48:08,851 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-27 17:48:08,851 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 97 predicate places. [2024-06-27 17:48:08,852 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 174 transitions, 2633 flow [2024-06-27 17:48:08,852 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-27 17:48:08,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:08,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:08,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 17:48:08,852 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-27 17:48:08,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash -132336749, now seen corresponding path program 4 times [2024-06-27 17:48:08,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:08,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963457917] [2024-06-27 17:48:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:08,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963457917] [2024-06-27 17:48:08,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963457917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:08,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:08,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:48:08,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428898626] [2024-06-27 17:48:08,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:08,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:48:08,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:08,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:48:08,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:48:08,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 61 [2024-06-27 17:48:08,886 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-27 17:48:08,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:08,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 61 [2024-06-27 17:48:08,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:09,054 INFO L124 PetriNetUnfolderBase]: 581/1481 cut-off events. [2024-06-27 17:48:09,054 INFO L125 PetriNetUnfolderBase]: For 24243/24363 co-relation queries the response was YES. [2024-06-27 17:48:09,061 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-27 17:48:09,066 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 32 selfloop transitions, 41 changer transitions 0/157 dead transitions. [2024-06-27 17:48:09,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 157 transitions, 2417 flow [2024-06-27 17:48:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:48:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:48:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2024-06-27 17:48:09,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.740983606557377 [2024-06-27 17:48:09,067 INFO L175 Difference]: Start difference. First operand has 153 places, 174 transitions, 2633 flow. Second operand 5 states and 226 transitions. [2024-06-27 17:48:09,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 157 transitions, 2417 flow [2024-06-27 17:48:09,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 157 transitions, 2151 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-27 17:48:09,104 INFO L231 Difference]: Finished difference. Result has 146 places, 148 transitions, 2081 flow [2024-06-27 17:48:09,105 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-27 17:48:09,105 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 90 predicate places. [2024-06-27 17:48:09,105 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 148 transitions, 2081 flow [2024-06-27 17:48:09,105 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-27 17:48:09,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:09,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:09,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 17:48:09,106 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-27 17:48:09,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1126552301, now seen corresponding path program 1 times [2024-06-27 17:48:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:09,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345440216] [2024-06-27 17:48:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:09,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:09,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345440216] [2024-06-27 17:48:09,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345440216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:09,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:09,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:09,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790450882] [2024-06-27 17:48:09,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:09,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:09,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:09,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:09,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:09,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:09,219 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-27 17:48:09,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:09,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:09,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:09,403 INFO L124 PetriNetUnfolderBase]: 762/1720 cut-off events. [2024-06-27 17:48:09,403 INFO L125 PetriNetUnfolderBase]: For 30442/30619 co-relation queries the response was YES. [2024-06-27 17:48:09,412 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-27 17:48:09,418 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 68 selfloop transitions, 66 changer transitions 0/163 dead transitions. [2024-06-27 17:48:09,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 163 transitions, 2515 flow [2024-06-27 17:48:09,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 231 transitions. [2024-06-27 17:48:09,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6311475409836066 [2024-06-27 17:48:09,421 INFO L175 Difference]: Start difference. First operand has 146 places, 148 transitions, 2081 flow. Second operand 6 states and 231 transitions. [2024-06-27 17:48:09,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 163 transitions, 2515 flow [2024-06-27 17:48:09,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 163 transitions, 2501 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:48:09,466 INFO L231 Difference]: Finished difference. Result has 151 places, 153 transitions, 2290 flow [2024-06-27 17:48:09,466 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-27 17:48:09,466 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 95 predicate places. [2024-06-27 17:48:09,467 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 153 transitions, 2290 flow [2024-06-27 17:48:09,467 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-27 17:48:09,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:09,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:09,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 17:48:09,468 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-27 17:48:09,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:09,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1685623661, now seen corresponding path program 2 times [2024-06-27 17:48:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:09,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301509901] [2024-06-27 17:48:09,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:09,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:09,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:09,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301509901] [2024-06-27 17:48:09,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301509901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:09,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:09,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594669343] [2024-06-27 17:48:09,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:09,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:09,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:09,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:09,577 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-27 17:48:09,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:09,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:09,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:09,781 INFO L124 PetriNetUnfolderBase]: 765/1740 cut-off events. [2024-06-27 17:48:09,781 INFO L125 PetriNetUnfolderBase]: For 34185/34351 co-relation queries the response was YES. [2024-06-27 17:48:09,790 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-27 17:48:09,812 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 78 selfloop transitions, 62 changer transitions 1/170 dead transitions. [2024-06-27 17:48:09,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 170 transitions, 2755 flow [2024-06-27 17:48:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-06-27 17:48:09,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2024-06-27 17:48:09,814 INFO L175 Difference]: Start difference. First operand has 151 places, 153 transitions, 2290 flow. Second operand 6 states and 234 transitions. [2024-06-27 17:48:09,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 170 transitions, 2755 flow [2024-06-27 17:48:09,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 170 transitions, 2683 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-27 17:48:09,862 INFO L231 Difference]: Finished difference. Result has 155 places, 156 transitions, 2403 flow [2024-06-27 17:48:09,863 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-27 17:48:09,863 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 99 predicate places. [2024-06-27 17:48:09,863 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 156 transitions, 2403 flow [2024-06-27 17:48:09,863 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-27 17:48:09,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:09,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:09,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 17:48:09,864 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-27 17:48:09,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:09,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1685951951, now seen corresponding path program 3 times [2024-06-27 17:48:09,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:09,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741587870] [2024-06-27 17:48:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:09,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:09,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:09,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741587870] [2024-06-27 17:48:09,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741587870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:09,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:09,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:09,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823651047] [2024-06-27 17:48:09,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:09,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:09,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:09,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:09,985 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-27 17:48:09,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:09,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:09,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:10,177 INFO L124 PetriNetUnfolderBase]: 757/1731 cut-off events. [2024-06-27 17:48:10,177 INFO L125 PetriNetUnfolderBase]: For 36514/36673 co-relation queries the response was YES. [2024-06-27 17:48:10,185 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-27 17:48:10,212 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 79 selfloop transitions, 63 changer transitions 2/173 dead transitions. [2024-06-27 17:48:10,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 173 transitions, 2832 flow [2024-06-27 17:48:10,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-06-27 17:48:10,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6475409836065574 [2024-06-27 17:48:10,214 INFO L175 Difference]: Start difference. First operand has 155 places, 156 transitions, 2403 flow. Second operand 6 states and 237 transitions. [2024-06-27 17:48:10,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 173 transitions, 2832 flow [2024-06-27 17:48:10,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 173 transitions, 2702 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-27 17:48:10,260 INFO L231 Difference]: Finished difference. Result has 158 places, 156 transitions, 2408 flow [2024-06-27 17:48:10,260 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-27 17:48:10,261 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 102 predicate places. [2024-06-27 17:48:10,261 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 156 transitions, 2408 flow [2024-06-27 17:48:10,261 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-27 17:48:10,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:10,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:10,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 17:48:10,262 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-27 17:48:10,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -32934813, now seen corresponding path program 1 times [2024-06-27 17:48:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:10,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120161517] [2024-06-27 17:48:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:10,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:10,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120161517] [2024-06-27 17:48:10,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120161517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:10,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:10,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:10,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334622044] [2024-06-27 17:48:10,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:10,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:10,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:10,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:10,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:10,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:10,399 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-27 17:48:10,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:10,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:10,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:10,598 INFO L124 PetriNetUnfolderBase]: 789/1780 cut-off events. [2024-06-27 17:48:10,598 INFO L125 PetriNetUnfolderBase]: For 40619/40898 co-relation queries the response was YES. [2024-06-27 17:48:10,606 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-27 17:48:10,612 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 119 selfloop transitions, 32 changer transitions 1/181 dead transitions. [2024-06-27 17:48:10,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 181 transitions, 2896 flow [2024-06-27 17:48:10,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 241 transitions. [2024-06-27 17:48:10,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6584699453551912 [2024-06-27 17:48:10,613 INFO L175 Difference]: Start difference. First operand has 158 places, 156 transitions, 2408 flow. Second operand 6 states and 241 transitions. [2024-06-27 17:48:10,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 181 transitions, 2896 flow [2024-06-27 17:48:10,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 181 transitions, 2722 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-27 17:48:10,672 INFO L231 Difference]: Finished difference. Result has 159 places, 158 transitions, 2341 flow [2024-06-27 17:48:10,673 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-27 17:48:10,673 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 103 predicate places. [2024-06-27 17:48:10,673 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 158 transitions, 2341 flow [2024-06-27 17:48:10,674 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-27 17:48:10,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:10,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:10,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 17:48:10,674 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-27 17:48:10,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash -899487443, now seen corresponding path program 2 times [2024-06-27 17:48:10,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:10,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071889432] [2024-06-27 17:48:10,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:10,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:10,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071889432] [2024-06-27 17:48:10,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071889432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:10,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:10,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051648666] [2024-06-27 17:48:10,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:10,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:10,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:10,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:10,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:10,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:10,808 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-27 17:48:10,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:10,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:10,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:11,109 INFO L124 PetriNetUnfolderBase]: 801/1815 cut-off events. [2024-06-27 17:48:11,109 INFO L125 PetriNetUnfolderBase]: For 41802/42054 co-relation queries the response was YES. [2024-06-27 17:48:11,117 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-27 17:48:11,123 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 120 selfloop transitions, 29 changer transitions 1/179 dead transitions. [2024-06-27 17:48:11,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 179 transitions, 2802 flow [2024-06-27 17:48:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 238 transitions. [2024-06-27 17:48:11,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2024-06-27 17:48:11,126 INFO L175 Difference]: Start difference. First operand has 159 places, 158 transitions, 2341 flow. Second operand 6 states and 238 transitions. [2024-06-27 17:48:11,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 179 transitions, 2802 flow [2024-06-27 17:48:11,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 179 transitions, 2727 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 17:48:11,179 INFO L231 Difference]: Finished difference. Result has 162 places, 160 transitions, 2374 flow [2024-06-27 17:48:11,179 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-27 17:48:11,180 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 106 predicate places. [2024-06-27 17:48:11,180 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 160 transitions, 2374 flow [2024-06-27 17:48:11,180 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-27 17:48:11,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:11,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:11,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 17:48:11,181 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-27 17:48:11,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash -206039453, now seen corresponding path program 3 times [2024-06-27 17:48:11,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:11,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897378865] [2024-06-27 17:48:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:11,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:11,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897378865] [2024-06-27 17:48:11,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897378865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:11,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:11,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:11,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713309385] [2024-06-27 17:48:11,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:11,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:11,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:11,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:11,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:11,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:11,315 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-27 17:48:11,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:11,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:11,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:11,505 INFO L124 PetriNetUnfolderBase]: 776/1781 cut-off events. [2024-06-27 17:48:11,505 INFO L125 PetriNetUnfolderBase]: For 41282/41449 co-relation queries the response was YES. [2024-06-27 17:48:11,514 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-27 17:48:11,519 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 96 selfloop transitions, 49 changer transitions 1/175 dead transitions. [2024-06-27 17:48:11,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 175 transitions, 2779 flow [2024-06-27 17:48:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 235 transitions. [2024-06-27 17:48:11,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6420765027322405 [2024-06-27 17:48:11,521 INFO L175 Difference]: Start difference. First operand has 162 places, 160 transitions, 2374 flow. Second operand 6 states and 235 transitions. [2024-06-27 17:48:11,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 175 transitions, 2779 flow [2024-06-27 17:48:11,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 175 transitions, 2729 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 17:48:11,575 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 2430 flow [2024-06-27 17:48:11,576 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-27 17:48:11,576 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 109 predicate places. [2024-06-27 17:48:11,576 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 2430 flow [2024-06-27 17:48:11,576 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-27 17:48:11,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:11,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:11,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 17:48:11,577 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-27 17:48:11,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:11,577 INFO L85 PathProgramCache]: Analyzing trace with hash -806955875, now seen corresponding path program 1 times [2024-06-27 17:48:11,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:11,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311847074] [2024-06-27 17:48:11,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:11,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:11,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-27 17:48:11,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:11,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311847074] [2024-06-27 17:48:11,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311847074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:11,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:11,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:48:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855072702] [2024-06-27 17:48:11,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:11,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:48:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:48:11,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:48:11,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:11,659 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-27 17:48:11,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:11,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:11,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:11,874 INFO L124 PetriNetUnfolderBase]: 752/1722 cut-off events. [2024-06-27 17:48:11,874 INFO L125 PetriNetUnfolderBase]: For 41853/41976 co-relation queries the response was YES. [2024-06-27 17:48:11,884 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-27 17:48:11,890 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 108 selfloop transitions, 38 changer transitions 0/175 dead transitions. [2024-06-27 17:48:11,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 175 transitions, 2840 flow [2024-06-27 17:48:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:48:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:48:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 208 transitions. [2024-06-27 17:48:11,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6819672131147541 [2024-06-27 17:48:11,892 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 2430 flow. Second operand 5 states and 208 transitions. [2024-06-27 17:48:11,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 175 transitions, 2840 flow [2024-06-27 17:48:11,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 175 transitions, 2721 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 17:48:11,951 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 2404 flow [2024-06-27 17:48:11,951 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-27 17:48:11,951 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 109 predicate places. [2024-06-27 17:48:11,952 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 2404 flow [2024-06-27 17:48:11,952 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-27 17:48:11,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:11,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:11,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 17:48:11,952 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-27 17:48:11,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash 580753810, now seen corresponding path program 1 times [2024-06-27 17:48:11,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:11,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997617197] [2024-06-27 17:48:11,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:11,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:11,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:11,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997617197] [2024-06-27 17:48:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997617197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:11,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:11,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:48:11,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332137602] [2024-06-27 17:48:11,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:11,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:48:11,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:11,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:48:11,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:48:11,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2024-06-27 17:48:11,987 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-27 17:48:11,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:11,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2024-06-27 17:48:11,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:12,092 INFO L124 PetriNetUnfolderBase]: 357/903 cut-off events. [2024-06-27 17:48:12,093 INFO L125 PetriNetUnfolderBase]: For 11740/11761 co-relation queries the response was YES. [2024-06-27 17:48:12,097 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-27 17:48:12,099 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 40 selfloop transitions, 16 changer transitions 0/140 dead transitions. [2024-06-27 17:48:12,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 140 transitions, 1874 flow [2024-06-27 17:48:12,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:48:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:48:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2024-06-27 17:48:12,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7147540983606557 [2024-06-27 17:48:12,100 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 2404 flow. Second operand 5 states and 218 transitions. [2024-06-27 17:48:12,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 140 transitions, 1874 flow [2024-06-27 17:48:12,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 140 transitions, 1628 flow, removed 7 selfloop flow, removed 17 redundant places. [2024-06-27 17:48:12,126 INFO L231 Difference]: Finished difference. Result has 156 places, 129 transitions, 1553 flow [2024-06-27 17:48:12,126 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-27 17:48:12,127 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 100 predicate places. [2024-06-27 17:48:12,127 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 129 transitions, 1553 flow [2024-06-27 17:48:12,127 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-27 17:48:12,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:12,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:12,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 17:48:12,128 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-27 17:48:12,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1174985420, now seen corresponding path program 1 times [2024-06-27 17:48:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154887397] [2024-06-27 17:48:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:12,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:12,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:12,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154887397] [2024-06-27 17:48:12,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154887397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:12,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:12,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:12,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938571409] [2024-06-27 17:48:12,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:12,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:12,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:12,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:12,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:12,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:12,256 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-27 17:48:12,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:12,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:12,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:12,404 INFO L124 PetriNetUnfolderBase]: 504/1191 cut-off events. [2024-06-27 17:48:12,405 INFO L125 PetriNetUnfolderBase]: For 23362/23534 co-relation queries the response was YES. [2024-06-27 17:48:12,410 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-27 17:48:12,414 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 89 selfloop transitions, 22 changer transitions 1/144 dead transitions. [2024-06-27 17:48:12,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 144 transitions, 1940 flow [2024-06-27 17:48:12,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2024-06-27 17:48:12,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6202185792349727 [2024-06-27 17:48:12,417 INFO L175 Difference]: Start difference. First operand has 156 places, 129 transitions, 1553 flow. Second operand 6 states and 227 transitions. [2024-06-27 17:48:12,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 144 transitions, 1940 flow [2024-06-27 17:48:12,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 144 transitions, 1940 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:48:12,452 INFO L231 Difference]: Finished difference. Result has 162 places, 133 transitions, 1657 flow [2024-06-27 17:48:12,452 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-27 17:48:12,453 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 106 predicate places. [2024-06-27 17:48:12,453 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 133 transitions, 1657 flow [2024-06-27 17:48:12,453 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-27 17:48:12,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:12,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:12,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 17:48:12,454 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-27 17:48:12,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2046865642, now seen corresponding path program 2 times [2024-06-27 17:48:12,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:12,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207358971] [2024-06-27 17:48:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:12,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:12,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207358971] [2024-06-27 17:48:12,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207358971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:12,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:12,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:12,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940822597] [2024-06-27 17:48:12,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:12,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:12,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:12,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:12,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:12,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:12,594 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-27 17:48:12,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:12,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:12,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:12,762 INFO L124 PetriNetUnfolderBase]: 480/1152 cut-off events. [2024-06-27 17:48:12,762 INFO L125 PetriNetUnfolderBase]: For 22343/22436 co-relation queries the response was YES. [2024-06-27 17:48:12,767 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-27 17:48:12,770 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 81 selfloop transitions, 31 changer transitions 0/144 dead transitions. [2024-06-27 17:48:12,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 144 transitions, 1951 flow [2024-06-27 17:48:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2024-06-27 17:48:12,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6229508196721312 [2024-06-27 17:48:12,781 INFO L175 Difference]: Start difference. First operand has 162 places, 133 transitions, 1657 flow. Second operand 6 states and 228 transitions. [2024-06-27 17:48:12,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 144 transitions, 1951 flow [2024-06-27 17:48:12,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 144 transitions, 1919 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 17:48:12,815 INFO L231 Difference]: Finished difference. Result has 165 places, 133 transitions, 1693 flow [2024-06-27 17:48:12,815 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-27 17:48:12,818 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 109 predicate places. [2024-06-27 17:48:12,818 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 133 transitions, 1693 flow [2024-06-27 17:48:12,818 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-27 17:48:12,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:12,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:12,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 17:48:12,819 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-27 17:48:12,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1597026124, now seen corresponding path program 3 times [2024-06-27 17:48:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:12,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535903345] [2024-06-27 17:48:12,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:12,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:12,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535903345] [2024-06-27 17:48:12,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535903345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:12,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:12,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:12,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435699014] [2024-06-27 17:48:12,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:12,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:12,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:12,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:12,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:12,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:13,000 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-27 17:48:13,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:13,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:13,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:13,123 INFO L124 PetriNetUnfolderBase]: 488/1159 cut-off events. [2024-06-27 17:48:13,124 INFO L125 PetriNetUnfolderBase]: For 22066/22237 co-relation queries the response was YES. [2024-06-27 17:48:13,128 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-27 17:48:13,131 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 89 selfloop transitions, 24 changer transitions 2/147 dead transitions. [2024-06-27 17:48:13,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 147 transitions, 2097 flow [2024-06-27 17:48:13,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2024-06-27 17:48:13,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6229508196721312 [2024-06-27 17:48:13,132 INFO L175 Difference]: Start difference. First operand has 165 places, 133 transitions, 1693 flow. Second operand 6 states and 228 transitions. [2024-06-27 17:48:13,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 147 transitions, 2097 flow [2024-06-27 17:48:13,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 147 transitions, 2016 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 17:48:13,169 INFO L231 Difference]: Finished difference. Result has 166 places, 133 transitions, 1666 flow [2024-06-27 17:48:13,169 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-27 17:48:13,170 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 110 predicate places. [2024-06-27 17:48:13,170 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 133 transitions, 1666 flow [2024-06-27 17:48:13,170 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-27 17:48:13,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:13,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:13,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 17:48:13,171 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-27 17:48:13,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1148378424, now seen corresponding path program 4 times [2024-06-27 17:48:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:13,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950213354] [2024-06-27 17:48:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:13,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950213354] [2024-06-27 17:48:13,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950213354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:13,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:13,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:13,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708946984] [2024-06-27 17:48:13,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:13,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:13,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:13,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:13,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:13,293 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-27 17:48:13,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:13,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:13,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:13,421 INFO L124 PetriNetUnfolderBase]: 485/1158 cut-off events. [2024-06-27 17:48:13,421 INFO L125 PetriNetUnfolderBase]: For 20860/21031 co-relation queries the response was YES. [2024-06-27 17:48:13,426 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-27 17:48:13,429 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 86 selfloop transitions, 28 changer transitions 3/149 dead transitions. [2024-06-27 17:48:13,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 149 transitions, 2089 flow [2024-06-27 17:48:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2024-06-27 17:48:13,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6256830601092896 [2024-06-27 17:48:13,430 INFO L175 Difference]: Start difference. First operand has 166 places, 133 transitions, 1666 flow. Second operand 6 states and 229 transitions. [2024-06-27 17:48:13,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 149 transitions, 2089 flow [2024-06-27 17:48:13,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 149 transitions, 2001 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 17:48:13,468 INFO L231 Difference]: Finished difference. Result has 167 places, 133 transitions, 1639 flow [2024-06-27 17:48:13,468 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-27 17:48:13,468 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 111 predicate places. [2024-06-27 17:48:13,468 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 133 transitions, 1639 flow [2024-06-27 17:48:13,469 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-27 17:48:13,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:13,469 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-27 17:48:13,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 17:48:13,469 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-27 17:48:13,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1585539295, now seen corresponding path program 1 times [2024-06-27 17:48:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:13,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271114948] [2024-06-27 17:48:13,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:13,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:13,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:13,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271114948] [2024-06-27 17:48:13,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271114948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:13,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:13,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:13,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934399835] [2024-06-27 17:48:13,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:13,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:13,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:13,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:13,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:13,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:13,588 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-27 17:48:13,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:13,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:13,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:13,738 INFO L124 PetriNetUnfolderBase]: 483/1151 cut-off events. [2024-06-27 17:48:13,739 INFO L125 PetriNetUnfolderBase]: For 19963/20134 co-relation queries the response was YES. [2024-06-27 17:48:13,743 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-27 17:48:13,746 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 79 selfloop transitions, 32 changer transitions 9/152 dead transitions. [2024-06-27 17:48:13,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 152 transitions, 1977 flow [2024-06-27 17:48:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 240 transitions. [2024-06-27 17:48:13,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6557377049180327 [2024-06-27 17:48:13,747 INFO L175 Difference]: Start difference. First operand has 167 places, 133 transitions, 1639 flow. Second operand 6 states and 240 transitions. [2024-06-27 17:48:13,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 152 transitions, 1977 flow [2024-06-27 17:48:13,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 152 transitions, 1892 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 17:48:13,786 INFO L231 Difference]: Finished difference. Result has 168 places, 131 transitions, 1592 flow [2024-06-27 17:48:13,786 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-27 17:48:13,787 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 112 predicate places. [2024-06-27 17:48:13,787 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 131 transitions, 1592 flow [2024-06-27 17:48:13,787 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-27 17:48:13,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:13,787 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-27 17:48:13,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 17:48:13,787 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-27 17:48:13,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:13,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1623546051, now seen corresponding path program 2 times [2024-06-27 17:48:13,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:13,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113053307] [2024-06-27 17:48:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:13,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:13,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113053307] [2024-06-27 17:48:13,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113053307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:13,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:13,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:13,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542970848] [2024-06-27 17:48:13,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:13,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:13,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:13,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:13,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:13,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:13,891 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-27 17:48:13,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:13,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:13,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:14,020 INFO L124 PetriNetUnfolderBase]: 480/1161 cut-off events. [2024-06-27 17:48:14,021 INFO L125 PetriNetUnfolderBase]: For 21447/21620 co-relation queries the response was YES. [2024-06-27 17:48:14,026 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-27 17:48:14,028 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 91 selfloop transitions, 21 changer transitions 4/148 dead transitions. [2024-06-27 17:48:14,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 148 transitions, 1889 flow [2024-06-27 17:48:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 238 transitions. [2024-06-27 17:48:14,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2024-06-27 17:48:14,030 INFO L175 Difference]: Start difference. First operand has 168 places, 131 transitions, 1592 flow. Second operand 6 states and 238 transitions. [2024-06-27 17:48:14,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 148 transitions, 1889 flow [2024-06-27 17:48:14,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 148 transitions, 1816 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 17:48:14,070 INFO L231 Difference]: Finished difference. Result has 169 places, 131 transitions, 1574 flow [2024-06-27 17:48:14,070 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-27 17:48:14,070 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 113 predicate places. [2024-06-27 17:48:14,071 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 131 transitions, 1574 flow [2024-06-27 17:48:14,071 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-27 17:48:14,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:14,071 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-27 17:48:14,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 17:48:14,071 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-27 17:48:14,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash -435373791, now seen corresponding path program 3 times [2024-06-27 17:48:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:14,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906939394] [2024-06-27 17:48:14,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:14,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906939394] [2024-06-27 17:48:14,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906939394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:14,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:14,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490804889] [2024-06-27 17:48:14,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:14,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:14,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:14,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:14,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:14,174 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-27 17:48:14,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:14,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:14,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:14,299 INFO L124 PetriNetUnfolderBase]: 450/1114 cut-off events. [2024-06-27 17:48:14,299 INFO L125 PetriNetUnfolderBase]: For 19600/19686 co-relation queries the response was YES. [2024-06-27 17:48:14,304 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-27 17:48:14,306 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 55 selfloop transitions, 51 changer transitions 9/147 dead transitions. [2024-06-27 17:48:14,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 147 transitions, 1910 flow [2024-06-27 17:48:14,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 235 transitions. [2024-06-27 17:48:14,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6420765027322405 [2024-06-27 17:48:14,308 INFO L175 Difference]: Start difference. First operand has 169 places, 131 transitions, 1574 flow. Second operand 6 states and 235 transitions. [2024-06-27 17:48:14,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 147 transitions, 1910 flow [2024-06-27 17:48:14,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 147 transitions, 1868 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 17:48:14,387 INFO L231 Difference]: Finished difference. Result has 171 places, 127 transitions, 1584 flow [2024-06-27 17:48:14,388 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-27 17:48:14,388 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 115 predicate places. [2024-06-27 17:48:14,388 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 127 transitions, 1584 flow [2024-06-27 17:48:14,388 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-27 17:48:14,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:14,389 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-27 17:48:14,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 17:48:14,389 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-27 17:48:14,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:14,389 INFO L85 PathProgramCache]: Analyzing trace with hash 767174888, now seen corresponding path program 1 times [2024-06-27 17:48:14,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:14,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457452185] [2024-06-27 17:48:14,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:14,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:14,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:14,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457452185] [2024-06-27 17:48:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457452185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:14,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599726115] [2024-06-27 17:48:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:14,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:14,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:14,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:14,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:14,521 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-27 17:48:14,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:14,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:14,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:14,656 INFO L124 PetriNetUnfolderBase]: 433/1086 cut-off events. [2024-06-27 17:48:14,657 INFO L125 PetriNetUnfolderBase]: For 21945/22029 co-relation queries the response was YES. [2024-06-27 17:48:14,662 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-27 17:48:14,664 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 73 selfloop transitions, 39 changer transitions 8/152 dead transitions. [2024-06-27 17:48:14,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 152 transitions, 2112 flow [2024-06-27 17:48:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2024-06-27 17:48:14,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 17:48:14,665 INFO L175 Difference]: Start difference. First operand has 171 places, 127 transitions, 1584 flow. Second operand 6 states and 244 transitions. [2024-06-27 17:48:14,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 152 transitions, 2112 flow [2024-06-27 17:48:14,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 152 transitions, 1971 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 17:48:14,703 INFO L231 Difference]: Finished difference. Result has 172 places, 125 transitions, 1521 flow [2024-06-27 17:48:14,703 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-27 17:48:14,703 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 116 predicate places. [2024-06-27 17:48:14,703 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 125 transitions, 1521 flow [2024-06-27 17:48:14,704 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-27 17:48:14,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:14,704 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-27 17:48:14,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 17:48:14,704 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-27 17:48:14,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:14,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1004363438, now seen corresponding path program 2 times [2024-06-27 17:48:14,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:14,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24338993] [2024-06-27 17:48:14,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:14,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:14,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:14,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24338993] [2024-06-27 17:48:14,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24338993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:14,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:14,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:14,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900734241] [2024-06-27 17:48:14,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:14,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:14,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:14,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:14,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:14,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:14,800 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-27 17:48:14,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:14,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:14,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:14,933 INFO L124 PetriNetUnfolderBase]: 431/1075 cut-off events. [2024-06-27 17:48:14,934 INFO L125 PetriNetUnfolderBase]: For 20943/21083 co-relation queries the response was YES. [2024-06-27 17:48:14,939 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-27 17:48:14,941 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 79 selfloop transitions, 27 changer transitions 4/142 dead transitions. [2024-06-27 17:48:14,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 142 transitions, 1852 flow [2024-06-27 17:48:14,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 238 transitions. [2024-06-27 17:48:14,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2024-06-27 17:48:14,943 INFO L175 Difference]: Start difference. First operand has 172 places, 125 transitions, 1521 flow. Second operand 6 states and 238 transitions. [2024-06-27 17:48:14,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 142 transitions, 1852 flow [2024-06-27 17:48:14,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 142 transitions, 1803 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 17:48:14,978 INFO L231 Difference]: Finished difference. Result has 175 places, 124 transitions, 1533 flow [2024-06-27 17:48:14,978 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-27 17:48:14,979 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 119 predicate places. [2024-06-27 17:48:14,979 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 124 transitions, 1533 flow [2024-06-27 17:48:14,979 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-27 17:48:14,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:14,979 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-27 17:48:14,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 17:48:14,980 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-27 17:48:14,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -774674828, now seen corresponding path program 3 times [2024-06-27 17:48:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:14,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676934292] [2024-06-27 17:48:14,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:14,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:15,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:15,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676934292] [2024-06-27 17:48:15,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676934292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:15,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:15,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:15,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329124015] [2024-06-27 17:48:15,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:15,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:15,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:15,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:15,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:15,083 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-27 17:48:15,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:15,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:15,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:15,239 INFO L124 PetriNetUnfolderBase]: 409/1039 cut-off events. [2024-06-27 17:48:15,239 INFO L125 PetriNetUnfolderBase]: For 20288/20437 co-relation queries the response was YES. [2024-06-27 17:48:15,243 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-27 17:48:15,245 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 83 selfloop transitions, 19 changer transitions 2/136 dead transitions. [2024-06-27 17:48:15,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 136 transitions, 1767 flow [2024-06-27 17:48:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2024-06-27 17:48:15,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6366120218579235 [2024-06-27 17:48:15,246 INFO L175 Difference]: Start difference. First operand has 175 places, 124 transitions, 1533 flow. Second operand 6 states and 233 transitions. [2024-06-27 17:48:15,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 136 transitions, 1767 flow [2024-06-27 17:48:15,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 136 transitions, 1729 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 17:48:15,280 INFO L231 Difference]: Finished difference. Result has 178 places, 123 transitions, 1522 flow [2024-06-27 17:48:15,280 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-27 17:48:15,280 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 122 predicate places. [2024-06-27 17:48:15,280 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 123 transitions, 1522 flow [2024-06-27 17:48:15,281 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-27 17:48:15,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:15,281 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-27 17:48:15,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 17:48:15,281 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-27 17:48:15,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:15,281 INFO L85 PathProgramCache]: Analyzing trace with hash 124981410, now seen corresponding path program 1 times [2024-06-27 17:48:15,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:15,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677378803] [2024-06-27 17:48:15,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:15,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:15,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:15,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677378803] [2024-06-27 17:48:15,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677378803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:15,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:15,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:48:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682349147] [2024-06-27 17:48:15,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:15,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:48:15,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:15,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:48:15,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:48:15,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2024-06-27 17:48:15,327 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-27 17:48:15,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:15,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2024-06-27 17:48:15,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:15,462 INFO L124 PetriNetUnfolderBase]: 458/1136 cut-off events. [2024-06-27 17:48:15,462 INFO L125 PetriNetUnfolderBase]: For 14748/14765 co-relation queries the response was YES. [2024-06-27 17:48:15,468 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-27 17:48:15,471 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 37 selfloop transitions, 21 changer transitions 8/145 dead transitions. [2024-06-27 17:48:15,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 145 transitions, 1746 flow [2024-06-27 17:48:15,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:48:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:48:15,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2024-06-27 17:48:15,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7311475409836066 [2024-06-27 17:48:15,472 INFO L175 Difference]: Start difference. First operand has 178 places, 123 transitions, 1522 flow. Second operand 5 states and 223 transitions. [2024-06-27 17:48:15,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 145 transitions, 1746 flow [2024-06-27 17:48:15,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 145 transitions, 1683 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 17:48:15,510 INFO L231 Difference]: Finished difference. Result has 179 places, 129 transitions, 1526 flow [2024-06-27 17:48:15,510 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-27 17:48:15,510 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 123 predicate places. [2024-06-27 17:48:15,510 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 129 transitions, 1526 flow [2024-06-27 17:48:15,510 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-27 17:48:15,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:15,511 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-27 17:48:15,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 17:48:15,511 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-27 17:48:15,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1027937388, now seen corresponding path program 2 times [2024-06-27 17:48:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563682278] [2024-06-27 17:48:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:15,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:15,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563682278] [2024-06-27 17:48:15,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563682278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:15,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:15,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:15,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075776635] [2024-06-27 17:48:15,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:15,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:15,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:15,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:15,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:15,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:15,609 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-27 17:48:15,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:15,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:15,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:15,734 INFO L124 PetriNetUnfolderBase]: 406/1060 cut-off events. [2024-06-27 17:48:15,734 INFO L125 PetriNetUnfolderBase]: For 18325/18410 co-relation queries the response was YES. [2024-06-27 17:48:15,740 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-27 17:48:15,742 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 72 selfloop transitions, 37 changer transitions 1/148 dead transitions. [2024-06-27 17:48:15,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 148 transitions, 1858 flow [2024-06-27 17:48:15,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-06-27 17:48:15,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6475409836065574 [2024-06-27 17:48:15,743 INFO L175 Difference]: Start difference. First operand has 179 places, 129 transitions, 1526 flow. Second operand 6 states and 237 transitions. [2024-06-27 17:48:15,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 148 transitions, 1858 flow [2024-06-27 17:48:15,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 148 transitions, 1854 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:48:15,780 INFO L231 Difference]: Finished difference. Result has 183 places, 128 transitions, 1576 flow [2024-06-27 17:48:15,780 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-27 17:48:15,780 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 127 predicate places. [2024-06-27 17:48:15,781 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 128 transitions, 1576 flow [2024-06-27 17:48:15,781 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-27 17:48:15,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:15,781 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-27 17:48:15,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 17:48:15,781 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-27 17:48:15,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:15,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1322562120, now seen corresponding path program 3 times [2024-06-27 17:48:15,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:15,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922386924] [2024-06-27 17:48:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:15,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:15,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:15,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922386924] [2024-06-27 17:48:15,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922386924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:15,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:15,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:15,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582749866] [2024-06-27 17:48:15,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:15,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:15,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:15,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:15,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:15,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:15,890 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-27 17:48:15,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:15,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:15,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:16,046 INFO L124 PetriNetUnfolderBase]: 398/1049 cut-off events. [2024-06-27 17:48:16,046 INFO L125 PetriNetUnfolderBase]: For 18578/18661 co-relation queries the response was YES. [2024-06-27 17:48:16,051 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-27 17:48:16,053 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 77 selfloop transitions, 33 changer transitions 1/149 dead transitions. [2024-06-27 17:48:16,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 149 transitions, 1924 flow [2024-06-27 17:48:16,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2024-06-27 17:48:16,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6475409836065574 [2024-06-27 17:48:16,054 INFO L175 Difference]: Start difference. First operand has 183 places, 128 transitions, 1576 flow. Second operand 6 states and 237 transitions. [2024-06-27 17:48:16,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 149 transitions, 1924 flow [2024-06-27 17:48:16,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 149 transitions, 1838 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 17:48:16,093 INFO L231 Difference]: Finished difference. Result has 184 places, 127 transitions, 1539 flow [2024-06-27 17:48:16,093 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-27 17:48:16,095 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 128 predicate places. [2024-06-27 17:48:16,095 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 127 transitions, 1539 flow [2024-06-27 17:48:16,095 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-27 17:48:16,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:16,095 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-27 17:48:16,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 17:48:16,095 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-27 17:48:16,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1295010910, now seen corresponding path program 4 times [2024-06-27 17:48:16,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:16,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114967086] [2024-06-27 17:48:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:16,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:16,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:16,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114967086] [2024-06-27 17:48:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114967086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:16,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:16,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:16,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211993860] [2024-06-27 17:48:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:16,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:16,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:16,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:16,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:16,200 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-27 17:48:16,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:16,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:16,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:16,324 INFO L124 PetriNetUnfolderBase]: 382/1013 cut-off events. [2024-06-27 17:48:16,324 INFO L125 PetriNetUnfolderBase]: For 17246/17323 co-relation queries the response was YES. [2024-06-27 17:48:16,329 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-27 17:48:16,332 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 55 selfloop transitions, 39 changer transitions 12/144 dead transitions. [2024-06-27 17:48:16,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 144 transitions, 1801 flow [2024-06-27 17:48:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-06-27 17:48:16,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2024-06-27 17:48:16,334 INFO L175 Difference]: Start difference. First operand has 184 places, 127 transitions, 1539 flow. Second operand 6 states and 234 transitions. [2024-06-27 17:48:16,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 144 transitions, 1801 flow [2024-06-27 17:48:16,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 144 transitions, 1652 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-27 17:48:16,376 INFO L231 Difference]: Finished difference. Result has 182 places, 118 transitions, 1340 flow [2024-06-27 17:48:16,376 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-27 17:48:16,376 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 126 predicate places. [2024-06-27 17:48:16,376 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 118 transitions, 1340 flow [2024-06-27 17:48:16,377 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-27 17:48:16,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:16,377 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-27 17:48:16,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 17:48:16,377 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-27 17:48:16,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1162907657, now seen corresponding path program 1 times [2024-06-27 17:48:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:16,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310280322] [2024-06-27 17:48:16,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:16,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:16,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310280322] [2024-06-27 17:48:16,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310280322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:16,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:16,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:16,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065937560] [2024-06-27 17:48:16,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:16,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:16,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:16,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:16,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:16,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:16,466 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-27 17:48:16,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:16,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:16,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:16,565 INFO L124 PetriNetUnfolderBase]: 340/902 cut-off events. [2024-06-27 17:48:16,565 INFO L125 PetriNetUnfolderBase]: For 15485/15553 co-relation queries the response was YES. [2024-06-27 17:48:16,570 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-27 17:48:16,572 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 47 selfloop transitions, 39 changer transitions 3/127 dead transitions. [2024-06-27 17:48:16,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 127 transitions, 1540 flow [2024-06-27 17:48:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2024-06-27 17:48:16,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6092896174863388 [2024-06-27 17:48:16,586 INFO L175 Difference]: Start difference. First operand has 182 places, 118 transitions, 1340 flow. Second operand 6 states and 223 transitions. [2024-06-27 17:48:16,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 127 transitions, 1540 flow [2024-06-27 17:48:16,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 127 transitions, 1393 flow, removed 9 selfloop flow, removed 18 redundant places. [2024-06-27 17:48:16,616 INFO L231 Difference]: Finished difference. Result has 167 places, 115 transitions, 1248 flow [2024-06-27 17:48:16,616 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-27 17:48:16,617 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 111 predicate places. [2024-06-27 17:48:16,617 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 115 transitions, 1248 flow [2024-06-27 17:48:16,617 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-27 17:48:16,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:16,618 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-27 17:48:16,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 17:48:16,618 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-27 17:48:16,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:16,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1223791350, now seen corresponding path program 1 times [2024-06-27 17:48:16,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:16,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927597137] [2024-06-27 17:48:16,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:16,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:16,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:16,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927597137] [2024-06-27 17:48:16,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927597137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:16,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:16,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:16,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297479530] [2024-06-27 17:48:16,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:16,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:16,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:16,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:16,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:16,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:16,732 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-27 17:48:16,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:16,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:16,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:16,832 INFO L124 PetriNetUnfolderBase]: 320/859 cut-off events. [2024-06-27 17:48:16,832 INFO L125 PetriNetUnfolderBase]: For 13751/13845 co-relation queries the response was YES. [2024-06-27 17:48:16,835 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-27 17:48:16,837 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 70 selfloop transitions, 16 changer transitions 5/129 dead transitions. [2024-06-27 17:48:16,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 129 transitions, 1539 flow [2024-06-27 17:48:16,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2024-06-27 17:48:16,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6147540983606558 [2024-06-27 17:48:16,838 INFO L175 Difference]: Start difference. First operand has 167 places, 115 transitions, 1248 flow. Second operand 6 states and 225 transitions. [2024-06-27 17:48:16,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 129 transitions, 1539 flow [2024-06-27 17:48:16,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 129 transitions, 1420 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-27 17:48:16,862 INFO L231 Difference]: Finished difference. Result has 163 places, 114 transitions, 1155 flow [2024-06-27 17:48:16,862 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-27 17:48:16,863 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 107 predicate places. [2024-06-27 17:48:16,863 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 114 transitions, 1155 flow [2024-06-27 17:48:16,863 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-27 17:48:16,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:16,863 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-27 17:48:16,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 17:48:16,864 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-27 17:48:16,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:16,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1979298508, now seen corresponding path program 2 times [2024-06-27 17:48:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:16,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479108332] [2024-06-27 17:48:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:16,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:16,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:16,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479108332] [2024-06-27 17:48:16,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479108332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:16,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:16,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:16,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656122605] [2024-06-27 17:48:16,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:16,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:16,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:16,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:16,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:16,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:16,946 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-27 17:48:16,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:16,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:16,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:17,035 INFO L124 PetriNetUnfolderBase]: 304/820 cut-off events. [2024-06-27 17:48:17,035 INFO L125 PetriNetUnfolderBase]: For 11048/11139 co-relation queries the response was YES. [2024-06-27 17:48:17,039 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-27 17:48:17,041 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 65 selfloop transitions, 8 changer transitions 17/125 dead transitions. [2024-06-27 17:48:17,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 125 transitions, 1413 flow [2024-06-27 17:48:17,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2024-06-27 17:48:17,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6120218579234973 [2024-06-27 17:48:17,042 INFO L175 Difference]: Start difference. First operand has 163 places, 114 transitions, 1155 flow. Second operand 6 states and 224 transitions. [2024-06-27 17:48:17,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 125 transitions, 1413 flow [2024-06-27 17:48:17,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 125 transitions, 1375 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 17:48:17,065 INFO L231 Difference]: Finished difference. Result has 163 places, 102 transitions, 989 flow [2024-06-27 17:48:17,066 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-27 17:48:17,066 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 107 predicate places. [2024-06-27 17:48:17,066 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 102 transitions, 989 flow [2024-06-27 17:48:17,066 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-27 17:48:17,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:17,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:48:17,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 17:48:17,067 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-27 17:48:17,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:17,067 INFO L85 PathProgramCache]: Analyzing trace with hash -134097142, now seen corresponding path program 3 times [2024-06-27 17:48:17,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:17,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972712843] [2024-06-27 17:48:17,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:17,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:17,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:17,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972712843] [2024-06-27 17:48:17,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972712843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:17,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:17,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:17,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768029395] [2024-06-27 17:48:17,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:17,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:17,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:17,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:17,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:17,158 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-27 17:48:17,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:17,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:17,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:17,237 INFO L124 PetriNetUnfolderBase]: 244/688 cut-off events. [2024-06-27 17:48:17,237 INFO L125 PetriNetUnfolderBase]: For 8077/8122 co-relation queries the response was YES. [2024-06-27 17:48:17,239 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-27 17:48:17,240 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 35 selfloop transitions, 5 changer transitions 51/111 dead transitions. [2024-06-27 17:48:17,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 111 transitions, 1165 flow [2024-06-27 17:48:17,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2024-06-27 17:48:17,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6038251366120219 [2024-06-27 17:48:17,241 INFO L175 Difference]: Start difference. First operand has 163 places, 102 transitions, 989 flow. Second operand 6 states and 221 transitions. [2024-06-27 17:48:17,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 111 transitions, 1165 flow [2024-06-27 17:48:17,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 111 transitions, 1102 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-27 17:48:17,253 INFO L231 Difference]: Finished difference. Result has 151 places, 57 transitions, 478 flow [2024-06-27 17:48:17,254 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-27 17:48:17,254 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 95 predicate places. [2024-06-27 17:48:17,254 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 57 transitions, 478 flow [2024-06-27 17:48:17,254 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-27 17:48:17,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:17,255 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-27 17:48:17,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 17:48:17,255 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-27 17:48:17,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash 390150710, now seen corresponding path program 1 times [2024-06-27 17:48:17,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:17,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709876225] [2024-06-27 17:48:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:17,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:17,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:17,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709876225] [2024-06-27 17:48:17,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709876225] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:17,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:17,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:17,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887398801] [2024-06-27 17:48:17,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:17,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:17,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:17,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:17,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:17,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:17,373 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-27 17:48:17,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:17,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:17,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:17,415 INFO L124 PetriNetUnfolderBase]: 124/338 cut-off events. [2024-06-27 17:48:17,415 INFO L125 PetriNetUnfolderBase]: For 3814/3844 co-relation queries the response was YES. [2024-06-27 17:48:17,416 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-27 17:48:17,417 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 27 selfloop transitions, 12 changer transitions 7/66 dead transitions. [2024-06-27 17:48:17,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 66 transitions, 604 flow [2024-06-27 17:48:17,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-06-27 17:48:17,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.587431693989071 [2024-06-27 17:48:17,422 INFO L175 Difference]: Start difference. First operand has 151 places, 57 transitions, 478 flow. Second operand 6 states and 215 transitions. [2024-06-27 17:48:17,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 66 transitions, 604 flow [2024-06-27 17:48:17,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 66 transitions, 451 flow, removed 12 selfloop flow, removed 36 redundant places. [2024-06-27 17:48:17,427 INFO L231 Difference]: Finished difference. Result has 95 places, 54 transitions, 342 flow [2024-06-27 17:48:17,428 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-27 17:48:17,428 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 39 predicate places. [2024-06-27 17:48:17,428 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 54 transitions, 342 flow [2024-06-27 17:48:17,428 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-27 17:48:17,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:48:17,428 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-27 17:48:17,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 17:48:17,429 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-27 17:48:17,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:48:17,429 INFO L85 PathProgramCache]: Analyzing trace with hash 307958884, now seen corresponding path program 2 times [2024-06-27 17:48:17,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:48:17,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251077564] [2024-06-27 17:48:17,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:48:17,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:48:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:48:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:48:17,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:48:17,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251077564] [2024-06-27 17:48:17,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251077564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:48:17,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:48:17,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:48:17,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855553352] [2024-06-27 17:48:17,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:48:17,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:48:17,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:48:17,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:48:17,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:48:17,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-06-27 17:48:17,525 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-27 17:48:17,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:48:17,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-06-27 17:48:17,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:48:17,560 INFO L124 PetriNetUnfolderBase]: 90/268 cut-off events. [2024-06-27 17:48:17,560 INFO L125 PetriNetUnfolderBase]: For 1131/1157 co-relation queries the response was YES. [2024-06-27 17:48:17,562 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-27 17:48:17,562 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 0 selfloop transitions, 0 changer transitions 60/60 dead transitions. [2024-06-27 17:48:17,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 60 transitions, 402 flow [2024-06-27 17:48:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:48:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:48:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-06-27 17:48:17,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5792349726775956 [2024-06-27 17:48:17,564 INFO L175 Difference]: Start difference. First operand has 95 places, 54 transitions, 342 flow. Second operand 6 states and 212 transitions. [2024-06-27 17:48:17,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 60 transitions, 402 flow [2024-06-27 17:48:17,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 60 transitions, 333 flow, removed 1 selfloop flow, removed 22 redundant places. [2024-06-27 17:48:17,565 INFO L231 Difference]: Finished difference. Result has 76 places, 0 transitions, 0 flow [2024-06-27 17:48:17,565 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-27 17:48:17,566 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2024-06-27 17:48:17,566 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 0 transitions, 0 flow [2024-06-27 17:48:17,566 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-27 17:48:17,568 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-06-27 17:48:17,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-06-27 17:48:17,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-06-27 17:48:17,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-06-27 17:48:17,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-06-27 17:48:17,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-06-27 17:48:17,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-06-27 17:48:17,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-06-27 17:48:17,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 17:48:17,571 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-27 17:48:17,574 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:48:17,574 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:48:17,577 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 17:48:17,577 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 17:48:17,578 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:48:17 BasicIcfg [2024-06-27 17:48:17,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:48:17,578 INFO L158 Benchmark]: Toolchain (without parser) took 16757.95ms. Allocated memory was 180.4MB in the beginning and 511.7MB in the end (delta: 331.4MB). Free memory was 104.9MB in the beginning and 250.1MB in the end (delta: -145.3MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. [2024-06-27 17:48:17,579 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:48:17,579 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:48:17,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.72ms. Allocated memory is still 180.4MB. Free memory was 104.9MB in the beginning and 78.7MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-06-27 17:48:17,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.45ms. Allocated memory is still 180.4MB. Free memory was 78.7MB in the beginning and 76.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:48:17,579 INFO L158 Benchmark]: Boogie Preprocessor took 72.58ms. Allocated memory is still 180.4MB. Free memory was 76.8MB in the beginning and 74.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:48:17,580 INFO L158 Benchmark]: RCFGBuilder took 504.02ms. Allocated memory is still 180.4MB. Free memory was 74.4MB in the beginning and 129.3MB in the end (delta: -54.9MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-06-27 17:48:17,580 INFO L158 Benchmark]: TraceAbstraction took 15683.49ms. Allocated memory was 180.4MB in the beginning and 511.7MB in the end (delta: 331.4MB). Free memory was 129.1MB in the beginning and 250.1MB in the end (delta: -121.0MB). Peak memory consumption was 211.4MB. Max. memory is 16.1GB. [2024-06-27 17:48:17,581 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.72ms. Allocated memory is still 180.4MB. Free memory was 104.9MB in the beginning and 78.7MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.45ms. Allocated memory is still 180.4MB. Free memory was 78.7MB in the beginning and 76.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.58ms. Allocated memory is still 180.4MB. Free memory was 76.8MB in the beginning and 74.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 504.02ms. Allocated memory is still 180.4MB. Free memory was 74.4MB in the beginning and 129.3MB in the end (delta: -54.9MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15683.49ms. Allocated memory was 180.4MB in the beginning and 511.7MB in the end (delta: 331.4MB). Free memory was 129.1MB in the beginning and 250.1MB in the end (delta: -121.0MB). Peak memory consumption was 211.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.6s, OverallIterations: 47, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5035 SdHoareTripleChecker+Valid, 4.1s 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.3s 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-27 17:48:17,603 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