./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c ./goblint.2024-05-21_14-57-05.files/protection/popl20-proofs-counter-add-4-semi-Q67.wvr.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 14:30:44,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 14:30:44,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 14:30:44,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 14:30:44,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 14:30:44,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 14:30:44,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 14:30:44,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 14:30:44,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 14:30:44,745 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 14:30:44,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 14:30:44,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 14:30:44,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 14:30:44,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 14:30:44,747 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 14:30:44,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 14:30:44,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 14:30:44,748 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 14:30:44,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 14:30:44,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 14:30:44,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 14:30:44,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 14:30:44,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 14:30:44,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 14:30:44,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 14:30:44,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 14:30:44,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 14:30:44,752 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 14:30:44,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 14:30:44,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 14:30:44,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 14:30:44,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 14:30:44,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 14:30:44,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 14:30:44,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 14:30:44,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 14:30:44,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 14:30:44,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 14:30:44,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 14:30:44,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 14:30:44,756 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 14:30:44,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 14:30:44,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 14:30:44,757 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 14:30:44,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 14:30:44,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 14:30:44,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 14:30:44,969 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 14:30:44,970 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 14:30:44,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml [2024-06-04 14:30:45,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 14:30:45,118 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 14:30:45,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-06-04 14:30:46,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 14:30:46,498 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 14:30:46,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-06-04 14:30:46,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e696dbc/6055b7e67908499db4376cf016f25f51/FLAG2462279ab [2024-06-04 14:30:46,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e696dbc/6055b7e67908499db4376cf016f25f51 [2024-06-04 14:30:46,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 14:30:46,517 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 14:30:46,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 14:30:46,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 14:30:46,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 14:30:46,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 02:30:45" (1/2) ... [2024-06-04 14:30:46,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64aff93b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 02:30:46, skipping insertion in model container [2024-06-04 14:30:46,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 02:30:45" (1/2) ... [2024-06-04 14:30:46,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@27a16b2a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 02:30:46, skipping insertion in model container [2024-06-04 14:30:46,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 02:30:46" (2/2) ... [2024-06-04 14:30:46,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64aff93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46, skipping insertion in model container [2024-06-04 14:30:46,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 02:30:46" (2/2) ... [2024-06-04 14:30:46,531 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 14:30:46,552 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 14:30:46,553 INFO L97 edCorrectnessWitness]: Location invariant before [L97-L97] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-06-04 14:30:46,553 INFO L97 edCorrectnessWitness]: Location invariant before [L98-L98] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-06-04 14:30:46,553 INFO L97 edCorrectnessWitness]: Location invariant before [L99-L99] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-06-04 14:30:46,553 INFO L97 edCorrectnessWitness]: Location invariant before [L96-L96] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-06-04 14:30:46,554 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 14:30:46,554 INFO L106 edCorrectnessWitness]: ghost_update [L95-L95] multithreaded = 1; [2024-06-04 14:30:46,571 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 14:30:46,764 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 14:30:46,772 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 14:30:46,838 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 14:30:46,853 INFO L206 MainTranslator]: Completed translation [2024-06-04 14:30:46,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46 WrapperNode [2024-06-04 14:30:46,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 14:30:46,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 14:30:46,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 14:30:46,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 14:30:46,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (1/1) ... [2024-06-04 14:30:46,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (1/1) ... [2024-06-04 14:30:46,920 INFO L138 Inliner]: procedures = 21, calls = 23, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 123 [2024-06-04 14:30:46,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 14:30:46,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 14:30:46,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 14:30:46,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 14:30:46,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (1/1) ... [2024-06-04 14:30:46,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (1/1) ... [2024-06-04 14:30:46,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (1/1) ... [2024-06-04 14:30:46,970 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-04 14:30:46,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (1/1) ... [2024-06-04 14:30:46,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (1/1) ... [2024-06-04 14:30:46,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (1/1) ... [2024-06-04 14:30:46,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (1/1) ... [2024-06-04 14:30:46,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (1/1) ... [2024-06-04 14:30:46,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (1/1) ... [2024-06-04 14:30:46,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 14:30:47,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 14:30:47,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 14:30:47,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 14:30:47,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (1/1) ... [2024-06-04 14:30:47,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 14:30:47,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 14:30:47,038 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-04 14:30:47,062 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-04 14:30:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 14:30:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-04 14:30:47,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-04 14:30:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-04 14:30:47,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-04 14:30:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-04 14:30:47,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-04 14:30:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-04 14:30:47,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-04 14:30:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 14:30:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 14:30:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 14:30:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 14:30:47,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 14:30:47,087 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 14:30:47,202 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 14:30:47,205 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 14:30:47,415 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 14:30:47,416 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 14:30:47,627 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 14:30:47,627 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-04 14:30:47,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 02:30:47 BoogieIcfgContainer [2024-06-04 14:30:47,628 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 14:30:47,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 14:30:47,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 14:30:47,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 14:30:47,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 02:30:45" (1/4) ... [2024-06-04 14:30:47,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5990eea3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 02:30:47, skipping insertion in model container [2024-06-04 14:30:47,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 02:30:46" (2/4) ... [2024-06-04 14:30:47,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5990eea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 02:30:47, skipping insertion in model container [2024-06-04 14:30:47,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:30:46" (3/4) ... [2024-06-04 14:30:47,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5990eea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 02:30:47, skipping insertion in model container [2024-06-04 14:30:47,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 02:30:47" (4/4) ... [2024-06-04 14:30:47,641 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-06-04 14:30:47,658 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 14:30:47,659 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-04 14:30:47,659 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 14:30:47,769 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-04 14:30:47,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 116 flow [2024-06-04 14:30:47,849 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2024-06-04 14:30:47,853 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 14:30:47,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 40 events. 4/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-06-04 14:30:47,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 44 transitions, 116 flow [2024-06-04 14:30:47,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 97 flow [2024-06-04 14:30:47,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 14:30:47,876 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;@3b751243, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 14:30:47,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-04 14:30:47,881 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 14:30:47,881 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 14:30:47,881 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 14:30:47,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:30:47,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 14:30:47,882 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:30:47,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:30:47,887 INFO L85 PathProgramCache]: Analyzing trace with hash -944096943, now seen corresponding path program 1 times [2024-06-04 14:30:47,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:30:47,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761773853] [2024-06-04 14:30:47,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:30:47,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:30:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:30:48,214 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-04 14:30:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:30:48,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761773853] [2024-06-04 14:30:48,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761773853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:30:48,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:30:48,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 14:30:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271904076] [2024-06-04 14:30:48,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:30:48,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 14:30:48,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:30:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 14:30:48,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 14:30:48,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-04 14:30:48,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:48,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:30:48,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-04 14:30:48,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:30:48,662 INFO L124 PetriNetUnfolderBase]: 2119/2911 cut-off events. [2024-06-04 14:30:48,662 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-06-04 14:30:48,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5731 conditions, 2911 events. 2119/2911 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12604 event pairs, 248 based on Foata normal form. 24/2853 useless extension candidates. Maximal degree in co-relation 5135. Up to 2289 conditions per place. [2024-06-04 14:30:48,694 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 40 selfloop transitions, 4 changer transitions 6/59 dead transitions. [2024-06-04 14:30:48,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 257 flow [2024-06-04 14:30:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 14:30:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 14:30:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-06-04 14:30:48,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2024-06-04 14:30:48,708 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 97 flow. Second operand 3 states and 93 transitions. [2024-06-04 14:30:48,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 257 flow [2024-06-04 14:30:48,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 233 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-04 14:30:48,721 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 107 flow [2024-06-04 14:30:48,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-06-04 14:30:48,727 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2024-06-04 14:30:48,727 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 107 flow [2024-06-04 14:30:48,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:48,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:30:48,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:30:48,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 14:30:48,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:30:48,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:30:48,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2144871828, now seen corresponding path program 1 times [2024-06-04 14:30:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:30:48,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138298081] [2024-06-04 14:30:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:30:48,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:30:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:30:48,907 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-04 14:30:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:30:48,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138298081] [2024-06-04 14:30:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138298081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:30:48,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:30:48,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 14:30:48,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976352500] [2024-06-04 14:30:48,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:30:48,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 14:30:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:30:48,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 14:30:48,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 14:30:48,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-04 14:30:48,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:48,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:30:48,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-04 14:30:48,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:30:49,215 INFO L124 PetriNetUnfolderBase]: 2017/2775 cut-off events. [2024-06-04 14:30:49,216 INFO L125 PetriNetUnfolderBase]: For 490/490 co-relation queries the response was YES. [2024-06-04 14:30:49,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6398 conditions, 2775 events. 2017/2775 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 12334 event pairs, 200 based on Foata normal form. 42/2768 useless extension candidates. Maximal degree in co-relation 1469. Up to 1819 conditions per place. [2024-06-04 14:30:49,235 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 52 selfloop transitions, 6 changer transitions 0/67 dead transitions. [2024-06-04 14:30:49,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 67 transitions, 292 flow [2024-06-04 14:30:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 14:30:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 14:30:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-06-04 14:30:49,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2024-06-04 14:30:49,238 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 107 flow. Second operand 4 states and 114 transitions. [2024-06-04 14:30:49,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 67 transitions, 292 flow [2024-06-04 14:30:49,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 14:30:49,240 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 132 flow [2024-06-04 14:30:49,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2024-06-04 14:30:49,241 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2024-06-04 14:30:49,242 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 132 flow [2024-06-04 14:30:49,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:49,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:30:49,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:30:49,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 14:30:49,243 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:30:49,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:30:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1965480304, now seen corresponding path program 1 times [2024-06-04 14:30:49,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:30:49,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241366946] [2024-06-04 14:30:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:30:49,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:30:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:30:49,290 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-04 14:30:49,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:30:49,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241366946] [2024-06-04 14:30:49,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241366946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:30:49,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:30:49,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 14:30:49,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043415202] [2024-06-04 14:30:49,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:30:49,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 14:30:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:30:49,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 14:30:49,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 14:30:49,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-06-04 14:30:49,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:49,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:30:49,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-06-04 14:30:49,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:30:49,522 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][42], [60#true, Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), thread4Thread1of1ForFork3InUse, 65#true, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, 8#L56true, 26#L67true, 28#L44true, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-04 14:30:49,523 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-06-04 14:30:49,523 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-04 14:30:49,523 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-04 14:30:49,523 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-04 14:30:49,527 INFO L124 PetriNetUnfolderBase]: 1666/2424 cut-off events. [2024-06-04 14:30:49,527 INFO L125 PetriNetUnfolderBase]: For 1590/1631 co-relation queries the response was YES. [2024-06-04 14:30:49,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6009 conditions, 2424 events. 1666/2424 cut-off events. For 1590/1631 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11233 event pairs, 219 based on Foata normal form. 40/2388 useless extension candidates. Maximal degree in co-relation 2156. Up to 1942 conditions per place. [2024-06-04 14:30:49,546 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 40 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2024-06-04 14:30:49,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 259 flow [2024-06-04 14:30:49,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 14:30:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 14:30:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-06-04 14:30:49,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6893939393939394 [2024-06-04 14:30:49,551 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 132 flow. Second operand 3 states and 91 transitions. [2024-06-04 14:30:49,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 259 flow [2024-06-04 14:30:49,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 14:30:49,554 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 148 flow [2024-06-04 14:30:49,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-06-04 14:30:49,556 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2024-06-04 14:30:49,556 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 148 flow [2024-06-04 14:30:49,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:49,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:30:49,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:30:49,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 14:30:49,557 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:30:49,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:30:49,558 INFO L85 PathProgramCache]: Analyzing trace with hash -339600869, now seen corresponding path program 1 times [2024-06-04 14:30:49,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:30:49,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467485503] [2024-06-04 14:30:49,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:30:49,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:30:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:30:49,735 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-04 14:30:49,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:30:49,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467485503] [2024-06-04 14:30:49,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467485503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:30:49,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:30:49,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:30:49,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802925292] [2024-06-04 14:30:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:30:49,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 14:30:49,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:30:49,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 14:30:49,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-04 14:30:49,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-04 14:30:49,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:49,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:30:49,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-04 14:30:49,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:30:50,103 INFO L124 PetriNetUnfolderBase]: 1999/2849 cut-off events. [2024-06-04 14:30:50,103 INFO L125 PetriNetUnfolderBase]: For 1748/1748 co-relation queries the response was YES. [2024-06-04 14:30:50,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7353 conditions, 2849 events. 1999/2849 cut-off events. For 1748/1748 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 13365 event pairs, 279 based on Foata normal form. 40/2844 useless extension candidates. Maximal degree in co-relation 2091. Up to 1309 conditions per place. [2024-06-04 14:30:50,121 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 61 selfloop transitions, 8 changer transitions 2/80 dead transitions. [2024-06-04 14:30:50,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 80 transitions, 391 flow [2024-06-04 14:30:50,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 14:30:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 14:30:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-06-04 14:30:50,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-06-04 14:30:50,123 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 148 flow. Second operand 5 states and 137 transitions. [2024-06-04 14:30:50,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 80 transitions, 391 flow [2024-06-04 14:30:50,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 80 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 14:30:50,126 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 169 flow [2024-06-04 14:30:50,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-06-04 14:30:50,128 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2024-06-04 14:30:50,128 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 169 flow [2024-06-04 14:30:50,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:50,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:30:50,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:30:50,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 14:30:50,129 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:30:50,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:30:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1011646885, now seen corresponding path program 1 times [2024-06-04 14:30:50,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:30:50,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818967872] [2024-06-04 14:30:50,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:30:50,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:30:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:30:50,257 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-04 14:30:50,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:30:50,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818967872] [2024-06-04 14:30:50,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818967872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:30:50,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:30:50,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:30:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856864029] [2024-06-04 14:30:50,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:30:50,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 14:30:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:30:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 14:30:50,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 14:30:50,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-04 14:30:50,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:50,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:30:50,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-04 14:30:50,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:30:50,602 INFO L124 PetriNetUnfolderBase]: 2051/2907 cut-off events. [2024-06-04 14:30:50,602 INFO L125 PetriNetUnfolderBase]: For 2966/2966 co-relation queries the response was YES. [2024-06-04 14:30:50,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7875 conditions, 2907 events. 2051/2907 cut-off events. For 2966/2966 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13487 event pairs, 325 based on Foata normal form. 24/2895 useless extension candidates. Maximal degree in co-relation 4421. Up to 2042 conditions per place. [2024-06-04 14:30:50,619 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 59 selfloop transitions, 8 changer transitions 0/76 dead transitions. [2024-06-04 14:30:50,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 76 transitions, 397 flow [2024-06-04 14:30:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 14:30:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 14:30:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-06-04 14:30:50,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5954545454545455 [2024-06-04 14:30:50,623 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 169 flow. Second operand 5 states and 131 transitions. [2024-06-04 14:30:50,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 76 transitions, 397 flow [2024-06-04 14:30:50,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 383 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 14:30:50,630 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 194 flow [2024-06-04 14:30:50,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-06-04 14:30:50,631 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2024-06-04 14:30:50,631 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 194 flow [2024-06-04 14:30:50,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:50,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:30:50,632 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-04 14:30:50,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 14:30:50,632 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:30:50,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:30:50,633 INFO L85 PathProgramCache]: Analyzing trace with hash -895527621, now seen corresponding path program 1 times [2024-06-04 14:30:50,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:30:50,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255029154] [2024-06-04 14:30:50,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:30:50,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:30:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:30:50,780 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-04 14:30:50,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:30:50,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255029154] [2024-06-04 14:30:50,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255029154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:30:50,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:30:50,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:30:50,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942961900] [2024-06-04 14:30:50,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:30:50,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 14:30:50,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:30:50,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 14:30:50,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-04 14:30:50,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-04 14:30:50,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:50,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:30:50,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-04 14:30:50,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:30:51,134 INFO L124 PetriNetUnfolderBase]: 2167/3103 cut-off events. [2024-06-04 14:30:51,134 INFO L125 PetriNetUnfolderBase]: For 3967/3967 co-relation queries the response was YES. [2024-06-04 14:30:51,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8805 conditions, 3103 events. 2167/3103 cut-off events. For 3967/3967 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 14856 event pairs, 312 based on Foata normal form. 24/3082 useless extension candidates. Maximal degree in co-relation 4945. Up to 1757 conditions per place. [2024-06-04 14:30:51,158 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 60 selfloop transitions, 8 changer transitions 3/80 dead transitions. [2024-06-04 14:30:51,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 443 flow [2024-06-04 14:30:51,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 14:30:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 14:30:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-06-04 14:30:51,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-04 14:30:51,160 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 194 flow. Second operand 5 states and 132 transitions. [2024-06-04 14:30:51,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 443 flow [2024-06-04 14:30:51,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 427 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 14:30:51,174 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 206 flow [2024-06-04 14:30:51,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-06-04 14:30:51,176 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2024-06-04 14:30:51,176 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 206 flow [2024-06-04 14:30:51,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:51,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:30:51,177 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-04 14:30:51,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 14:30:51,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:30:51,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:30:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1046436920, now seen corresponding path program 1 times [2024-06-04 14:30:51,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:30:51,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171712979] [2024-06-04 14:30:51,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:30:51,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:30:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:30:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:30:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:30:51,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171712979] [2024-06-04 14:30:51,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171712979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:30:51,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:30:51,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 14:30:51,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293531913] [2024-06-04 14:30:51,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:30:51,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:30:51,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:30:51,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:30:51,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:30:51,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-04 14:30:51,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:51,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:30:51,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-04 14:30:51,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:30:51,735 INFO L124 PetriNetUnfolderBase]: 2143/3070 cut-off events. [2024-06-04 14:30:51,736 INFO L125 PetriNetUnfolderBase]: For 4564/4564 co-relation queries the response was YES. [2024-06-04 14:30:51,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8972 conditions, 3070 events. 2143/3070 cut-off events. For 4564/4564 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 14591 event pairs, 332 based on Foata normal form. 24/3054 useless extension candidates. Maximal degree in co-relation 6309. Up to 1918 conditions per place. [2024-06-04 14:30:51,755 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 66 selfloop transitions, 9 changer transitions 4/88 dead transitions. [2024-06-04 14:30:51,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 88 transitions, 484 flow [2024-06-04 14:30:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:30:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:30:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-06-04 14:30:51,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5871212121212122 [2024-06-04 14:30:51,757 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 206 flow. Second operand 6 states and 155 transitions. [2024-06-04 14:30:51,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 88 transitions, 484 flow [2024-06-04 14:30:51,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 88 transitions, 470 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 14:30:51,773 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 216 flow [2024-06-04 14:30:51,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-06-04 14:30:51,774 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2024-06-04 14:30:51,774 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 216 flow [2024-06-04 14:30:51,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:51,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:30:51,775 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-04 14:30:51,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 14:30:51,775 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:30:51,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:30:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2145955907, now seen corresponding path program 1 times [2024-06-04 14:30:51,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:30:51,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018011674] [2024-06-04 14:30:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:30:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:30:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:30:51,892 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-04 14:30:51,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:30:51,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018011674] [2024-06-04 14:30:51,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018011674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:30:51,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:30:51,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:30:51,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958716306] [2024-06-04 14:30:51,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:30:51,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 14:30:51,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:30:51,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 14:30:51,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 14:30:51,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-04 14:30:51,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:51,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:30:51,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-04 14:30:51,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:30:52,191 INFO L124 PetriNetUnfolderBase]: 2187/3136 cut-off events. [2024-06-04 14:30:52,191 INFO L125 PetriNetUnfolderBase]: For 5371/5371 co-relation queries the response was YES. [2024-06-04 14:30:52,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9325 conditions, 3136 events. 2187/3136 cut-off events. For 5371/5371 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14989 event pairs, 420 based on Foata normal form. 16/3122 useless extension candidates. Maximal degree in co-relation 6895. Up to 2330 conditions per place. [2024-06-04 14:30:52,210 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 57 selfloop transitions, 8 changer transitions 2/76 dead transitions. [2024-06-04 14:30:52,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 76 transitions, 444 flow [2024-06-04 14:30:52,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 14:30:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 14:30:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-06-04 14:30:52,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2024-06-04 14:30:52,212 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 216 flow. Second operand 5 states and 126 transitions. [2024-06-04 14:30:52,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 76 transitions, 444 flow [2024-06-04 14:30:52,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 426 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-04 14:30:52,233 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 237 flow [2024-06-04 14:30:52,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-04 14:30:52,235 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2024-06-04 14:30:52,235 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 237 flow [2024-06-04 14:30:52,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:52,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:30:52,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:30:52,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 14:30:52,236 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:30:52,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:30:52,237 INFO L85 PathProgramCache]: Analyzing trace with hash -150469172, now seen corresponding path program 1 times [2024-06-04 14:30:52,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:30:52,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274397504] [2024-06-04 14:30:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:30:52,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:30:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:30:52,303 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-04 14:30:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:30:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274397504] [2024-06-04 14:30:52,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274397504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:30:52,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:30:52,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 14:30:52,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901225696] [2024-06-04 14:30:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:30:52,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 14:30:52,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:30:52,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 14:30:52,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 14:30:52,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-06-04 14:30:52,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:52,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:30:52,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-06-04 14:30:52,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:30:52,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][56], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, 26#L67true, Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 67#(= ~counter~0 0), 102#(= ~counter~0 0), Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 94#true, thread4Thread1of1ForFork3InUse, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 25#L79true, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,927 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,927 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-04 14:30:52,927 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,927 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,934 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][30], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 26#L67true, Black: 67#(= ~counter~0 0), 100#true, Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 94#true, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 28#L44true, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,935 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,935 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-04 14:30:52,935 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-04 14:30:52,935 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][56], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 67#(= ~counter~0 0), 102#(= ~counter~0 0), Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 94#true, thread4Thread1of1ForFork3InUse, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 34#thread3EXITtrue, 25#L79true, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,937 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-04 14:30:52,937 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-04 14:30:52,937 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-04 14:30:52,937 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-04 14:30:52,938 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][56], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, 26#L67true, Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 67#(= ~counter~0 0), 102#(= ~counter~0 0), Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 94#true, thread4Thread1of1ForFork3InUse, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,938 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-04 14:30:52,938 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-04 14:30:52,938 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-04 14:30:52,938 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-04 14:30:52,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][63], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, 26#L67true, Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 67#(= ~counter~0 0), Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 100#true, 94#true, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,939 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-04 14:30:52,939 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 14:30:52,939 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 14:30:52,939 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-04 14:30:52,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][43], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 26#L67true, Black: 67#(= ~counter~0 0), Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 94#true, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 28#L44true, 103#(<= ~counter~0 1), Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,942 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-04 14:30:52,942 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-04 14:30:52,942 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-04 14:30:52,942 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-04 14:30:52,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][30], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 67#(= ~counter~0 0), Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 100#true, 94#true, thread4Thread1of1ForFork3InUse, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 34#thread3EXITtrue, 4#thread4EXITtrue, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 28#L44true, 13#thread2EXITtrue, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,943 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-04 14:30:52,943 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,943 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,943 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][30], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 67#(= ~counter~0 0), Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 100#true, 94#true, thread4Thread1of1ForFork3InUse, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 34#thread3EXITtrue, 4#thread4EXITtrue, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 28#L44true, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,944 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-04 14:30:52,944 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-04 14:30:52,944 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 14:30:52,944 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 14:30:52,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][63], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 67#(= ~counter~0 0), 100#true, Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 94#true, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 34#thread3EXITtrue, 4#thread4EXITtrue, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,945 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-04 14:30:52,945 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-04 14:30:52,946 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,946 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][56], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 67#(= ~counter~0 0), 102#(= ~counter~0 0), Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 94#true, thread4Thread1of1ForFork3InUse, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 34#thread3EXITtrue, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,947 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-04 14:30:52,947 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-04 14:30:52,947 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-04 14:30:52,947 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-04 14:30:52,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][43], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 26#L67true, Black: 67#(= ~counter~0 0), Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 94#true, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 28#L44true, 103#(<= ~counter~0 1), 13#thread2EXITtrue, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,948 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-06-04 14:30:52,949 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 14:30:52,949 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 14:30:52,949 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 14:30:52,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][43], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 67#(= ~counter~0 0), Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 94#true, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 34#thread3EXITtrue, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 28#L44true, 103#(<= ~counter~0 1), Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,950 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-06-04 14:30:52,950 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 14:30:52,950 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 14:30:52,950 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-04 14:30:52,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][43], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 67#(= ~counter~0 0), Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 94#true, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 34#thread3EXITtrue, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 28#L44true, 103#(<= ~counter~0 1), 13#thread2EXITtrue, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,951 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-06-04 14:30:52,951 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,951 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,951 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][19], [Black: 63#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, Black: 98#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 26#L67true, Black: 67#(= ~counter~0 0), Black: 73#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 100#true, 94#true, Black: 79#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, Black: 85#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 28#L44true, Black: 58#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 92#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-04 14:30:52,952 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-06-04 14:30:52,952 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,952 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,952 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-04 14:30:52,953 INFO L124 PetriNetUnfolderBase]: 5006/7369 cut-off events. [2024-06-04 14:30:52,954 INFO L125 PetriNetUnfolderBase]: For 16589/16815 co-relation queries the response was YES. [2024-06-04 14:30:52,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22043 conditions, 7369 events. 5006/7369 cut-off events. For 16589/16815 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 42930 event pairs, 880 based on Foata normal form. 297/7534 useless extension candidates. Maximal degree in co-relation 15952. Up to 3066 conditions per place. [2024-06-04 14:30:53,051 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 61 selfloop transitions, 23 changer transitions 0/94 dead transitions. [2024-06-04 14:30:53,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 639 flow [2024-06-04 14:30:53,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 14:30:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 14:30:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-06-04 14:30:53,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7159090909090909 [2024-06-04 14:30:53,058 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 237 flow. Second operand 4 states and 126 transitions. [2024-06-04 14:30:53,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 94 transitions, 639 flow [2024-06-04 14:30:53,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 94 transitions, 614 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 14:30:53,087 INFO L231 Difference]: Finished difference. Result has 55 places, 66 transitions, 514 flow [2024-06-04 14:30:53,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=514, PETRI_PLACES=55, PETRI_TRANSITIONS=66} [2024-06-04 14:30:53,088 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2024-06-04 14:30:53,088 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 66 transitions, 514 flow [2024-06-04 14:30:53,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:53,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:30:53,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:30:53,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 14:30:53,089 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:30:53,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:30:53,089 INFO L85 PathProgramCache]: Analyzing trace with hash 886697932, now seen corresponding path program 1 times [2024-06-04 14:30:53,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:30:53,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096570331] [2024-06-04 14:30:53,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:30:53,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:30:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:30:53,245 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-04 14:30:53,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:30:53,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096570331] [2024-06-04 14:30:53,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096570331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:30:53,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:30:53,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 14:30:53,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818890585] [2024-06-04 14:30:53,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:30:53,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:30:53,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:30:53,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:30:53,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:30:53,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-04 14:30:53,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 66 transitions, 514 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:53,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:30:53,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-04 14:30:53,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:30:54,004 INFO L124 PetriNetUnfolderBase]: 5225/7577 cut-off events. [2024-06-04 14:30:54,005 INFO L125 PetriNetUnfolderBase]: For 24534/24534 co-relation queries the response was YES. [2024-06-04 14:30:54,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27029 conditions, 7577 events. 5225/7577 cut-off events. For 24534/24534 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 43099 event pairs, 984 based on Foata normal form. 48/7600 useless extension candidates. Maximal degree in co-relation 19116. Up to 5530 conditions per place. [2024-06-04 14:30:54,050 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 84 selfloop transitions, 16 changer transitions 6/115 dead transitions. [2024-06-04 14:30:54,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 115 transitions, 976 flow [2024-06-04 14:30:54,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:30:54,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:30:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-06-04 14:30:54,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-06-04 14:30:54,052 INFO L175 Difference]: Start difference. First operand has 55 places, 66 transitions, 514 flow. Second operand 6 states and 148 transitions. [2024-06-04 14:30:54,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 115 transitions, 976 flow [2024-06-04 14:30:54,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 115 transitions, 962 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-06-04 14:30:54,094 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 577 flow [2024-06-04 14:30:54,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=577, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2024-06-04 14:30:54,095 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2024-06-04 14:30:54,095 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 577 flow [2024-06-04 14:30:54,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:54,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:30:54,096 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:30:54,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 14:30:54,096 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:30:54,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:30:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash 346491752, now seen corresponding path program 2 times [2024-06-04 14:30:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:30:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808647244] [2024-06-04 14:30:54,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:30:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:30:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:30:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:30:54,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:30:54,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808647244] [2024-06-04 14:30:54,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808647244] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-04 14:30:54,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967991494] [2024-06-04 14:30:54,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-04 14:30:54,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-04 14:30:54,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 14:30:54,288 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-04 14:30:54,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-04 14:30:54,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-04 14:30:54,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-04 14:30:54,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-04 14:30:54,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-04 14:30:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:30:54,718 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-04 14:30:54,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967991494] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:30:54,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-04 14:30:54,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-06-04 14:30:54,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254663008] [2024-06-04 14:30:54,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:30:54,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:30:54,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:30:54,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:30:54,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-04 14:30:54,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-04 14:30:54,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 577 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:54,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:30:54,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-04 14:30:54,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:30:56,030 INFO L124 PetriNetUnfolderBase]: 9245/13647 cut-off events. [2024-06-04 14:30:56,031 INFO L125 PetriNetUnfolderBase]: For 55663/55663 co-relation queries the response was YES. [2024-06-04 14:30:56,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47875 conditions, 13647 events. 9245/13647 cut-off events. For 55663/55663 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 86292 event pairs, 1812 based on Foata normal form. 312/13882 useless extension candidates. Maximal degree in co-relation 34146. Up to 3537 conditions per place. [2024-06-04 14:30:56,084 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 0 selfloop transitions, 0 changer transitions 165/165 dead transitions. [2024-06-04 14:30:56,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 165 transitions, 1616 flow [2024-06-04 14:30:56,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:30:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:30:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-06-04 14:30:56,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.577922077922078 [2024-06-04 14:30:56,090 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 577 flow. Second operand 7 states and 178 transitions. [2024-06-04 14:30:56,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 165 transitions, 1616 flow [2024-06-04 14:30:56,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 165 transitions, 1579 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 14:30:56,212 INFO L231 Difference]: Finished difference. Result has 62 places, 0 transitions, 0 flow [2024-06-04 14:30:56,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=62, PETRI_TRANSITIONS=0} [2024-06-04 14:30:56,213 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2024-06-04 14:30:56,214 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 0 transitions, 0 flow [2024-06-04 14:30:56,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:30:56,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 8 remaining) [2024-06-04 14:30:56,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 8 remaining) [2024-06-04 14:30:56,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-06-04 14:30:56,217 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-06-04 14:30:56,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-06-04 14:30:56,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-06-04 14:30:56,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-06-04 14:30:56,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-06-04 14:30:56,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-04 14:30:56,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-06-04 14:30:56,433 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:30:56,437 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 14:30:56,437 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 14:30:56,441 INFO L507 ceAbstractionStarter]: Automizer considered 4 witness invariants [2024-06-04 14:30:56,441 INFO L508 ceAbstractionStarter]: WitnessConsidered=4 [2024-06-04 14:30:56,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 02:30:56 BasicIcfg [2024-06-04 14:30:56,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 14:30:56,443 INFO L158 Benchmark]: Toolchain (without parser) took 9926.22ms. Allocated memory was 153.1MB in the beginning and 1.0GB in the end (delta: 882.9MB). Free memory was 122.3MB in the beginning and 725.8MB in the end (delta: -603.5MB). Peak memory consumption was 369.1MB. Max. memory is 16.1GB. [2024-06-04 14:30:56,443 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 94.4MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 14:30:56,443 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory was 118.9MB in the beginning and 118.9MB in the end (delta: 24.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 14:30:56,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.49ms. Allocated memory is still 153.1MB. Free memory was 122.3MB in the beginning and 115.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-04 14:30:56,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.16ms. Allocated memory is still 153.1MB. Free memory was 115.0MB in the beginning and 113.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-04 14:30:56,448 INFO L158 Benchmark]: Boogie Preprocessor took 77.98ms. Allocated memory is still 153.1MB. Free memory was 113.2MB in the beginning and 110.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-04 14:30:56,448 INFO L158 Benchmark]: RCFGBuilder took 627.97ms. Allocated memory is still 153.1MB. Free memory was 110.8MB in the beginning and 71.3MB in the end (delta: 39.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-06-04 14:30:56,449 INFO L158 Benchmark]: TraceAbstraction took 8810.03ms. Allocated memory was 153.1MB in the beginning and 1.0GB in the end (delta: 882.9MB). Free memory was 70.4MB in the beginning and 725.8MB in the end (delta: -655.5MB). Peak memory consumption was 318.5MB. Max. memory is 16.1GB. [2024-06-04 14:30:56,450 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.18ms. Allocated memory is still 94.4MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory was 118.9MB in the beginning and 118.9MB in the end (delta: 24.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.49ms. Allocated memory is still 153.1MB. Free memory was 122.3MB in the beginning and 115.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.16ms. Allocated memory is still 153.1MB. Free memory was 115.0MB in the beginning and 113.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.98ms. Allocated memory is still 153.1MB. Free memory was 113.2MB in the beginning and 110.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 627.97ms. Allocated memory is still 153.1MB. Free memory was 110.8MB in the beginning and 71.3MB in the end (delta: 39.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8810.03ms. Allocated memory was 153.1MB in the beginning and 1.0GB in the end (delta: 882.9MB). Free memory was 70.4MB in the beginning and 725.8MB in the end (delta: -655.5MB). Peak memory consumption was 318.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 96]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 97]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 98]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 99]: 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 9 procedures, 61 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: 8.6s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 540 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 428 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1858 IncrementalHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 23 mSDtfsCounter, 1858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=577occurred in iteration=10, InterpolantAutomatonStates: 53, 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, 1.8s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 2399 SizeOfPredicates, 0 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2/4 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-04 14:30:56,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE