./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/queue.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/queue.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/queue.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-7724a2d-m [2024-06-28 02:47:46,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:47:46,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:47:46,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:47:46,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:47:46,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:47:46,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:47:46,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:47:46,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:47:46,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:47:46,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:47:46,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:47:46,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:47:46,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:47:46,259 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:47:46,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:47:46,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:47:46,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:47:46,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:47:46,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:47:46,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:47:46,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:47:46,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:47:46,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:47:46,261 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:47:46,261 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:47:46,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:47:46,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:47:46,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:47:46,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:47:46,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:47:46,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:47:46,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:47:46,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:47:46,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:47:46,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:47:46,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:47:46,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:47:46,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:47:46,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:47:46,265 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:47:46,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:47:46,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:47:46,265 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-28 02:47:46,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:47:46,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:47:46,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:47:46,468 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:47:46,469 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:47:46,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/queue.yml/witness.yml [2024-06-28 02:47:46,605 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:47:46,605 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:47:46,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2024-06-28 02:47:47,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:47:47,887 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:47:47,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2024-06-28 02:47:47,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29d27935/da4f05b579c54d349185a9df21b53c23/FLAGdb581caf6 [2024-06-28 02:47:47,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29d27935/da4f05b579c54d349185a9df21b53c23 [2024-06-28 02:47:47,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:47:47,910 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:47:47,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:47:47,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:47:47,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:47:47,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:47:46" (1/2) ... [2024-06-28 02:47:47,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3884df5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:47:47, skipping insertion in model container [2024-06-28 02:47:47,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:47:46" (1/2) ... [2024-06-28 02:47:47,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4a48499e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:47:47, skipping insertion in model container [2024-06-28 02:47:47,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:47:47" (2/2) ... [2024-06-28 02:47:47,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3884df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:47, skipping insertion in model container [2024-06-28 02:47:47,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:47:47" (2/2) ... [2024-06-28 02:47:47,919 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:47:47,961 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:47:47,962 INFO L97 edCorrectnessWitness]: Location invariant before [L1065-L1065] (! multithreaded || (m_locked || (((0 <= queue.head && 0 <= queue.tail) && queue.head <= 20) && queue.tail <= 20))) && (! multithreaded || (((0 <= queue.head && 0 <= queue.tail) && queue.head <= 20) && queue.tail <= 20)) [2024-06-28 02:47:47,962 INFO L97 edCorrectnessWitness]: Location invariant before [L1064-L1064] (! multithreaded || (m_locked || (((0 <= queue.head && 0 <= queue.tail) && queue.head <= 20) && queue.tail <= 20))) && (! multithreaded || (((0 <= queue.head && 0 <= queue.tail) && queue.head <= 20) && queue.tail <= 20)) [2024-06-28 02:47:47,962 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-28 02:47:47,962 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:47:47,963 INFO L106 edCorrectnessWitness]: ghost_update [L1048-L1048] m_locked = 0; [2024-06-28 02:47:47,963 INFO L106 edCorrectnessWitness]: ghost_update [L1020-L1020] m_locked = 1; [2024-06-28 02:47:47,963 INFO L106 edCorrectnessWitness]: ghost_update [L1029-L1029] m_locked = 0; [2024-06-28 02:47:47,963 INFO L106 edCorrectnessWitness]: ghost_update [L1039-L1039] m_locked = 1; [2024-06-28 02:47:47,963 INFO L106 edCorrectnessWitness]: ghost_update [L1063-L1063] multithreaded = 1; [2024-06-28 02:47:47,964 INFO L106 edCorrectnessWitness]: ghost_update [L1008-L1008] m_locked = 1; [2024-06-28 02:47:47,964 INFO L106 edCorrectnessWitness]: ghost_update [L1017-L1017] m_locked = 0; [2024-06-28 02:47:47,997 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:47:48,366 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:47:48,376 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:47:48,506 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:47:48,568 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:47:48,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48 WrapperNode [2024-06-28 02:47:48,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:47:48,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:47:48,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:47:48,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:47:48,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (1/1) ... [2024-06-28 02:47:48,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (1/1) ... [2024-06-28 02:47:48,663 INFO L138 Inliner]: procedures = 274, calls = 432, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1724 [2024-06-28 02:47:48,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:47:48,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:47:48,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:47:48,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:47:48,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (1/1) ... [2024-06-28 02:47:48,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (1/1) ... [2024-06-28 02:47:48,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (1/1) ... [2024-06-28 02:47:48,705 INFO L175 MemorySlicer]: Split 419 memory accesses to 5 slices as follows [2, 8, 5, 4, 400]. 95 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 8, 5, 0, 0]. The 18 writes are split as follows [0, 0, 0, 3, 15]. [2024-06-28 02:47:48,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (1/1) ... [2024-06-28 02:47:48,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (1/1) ... [2024-06-28 02:47:48,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (1/1) ... [2024-06-28 02:47:48,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (1/1) ... [2024-06-28 02:47:48,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (1/1) ... [2024-06-28 02:47:48,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (1/1) ... [2024-06-28 02:47:48,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:47:48,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:47:48,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:47:48,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:47:48,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (1/1) ... [2024-06-28 02:47:48,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:47:48,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:47:48,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 02:47:48,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 02:47:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-28 02:47:48,854 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-28 02:47:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-28 02:47:48,854 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-28 02:47:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-28 02:47:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 02:47:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 02:47:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-28 02:47:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-28 02:47:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-06-28 02:47:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 02:47:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 02:47:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-28 02:47:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-28 02:47:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-06-28 02:47:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-28 02:47:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:47:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:47:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 02:47:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-28 02:47:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-28 02:47:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-06-28 02:47:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:47:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:47:48,861 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:47:49,069 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:47:49,071 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:47:50,014 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:47:50,014 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:47:54,827 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:47:54,827 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-28 02:47:54,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:47:54 BoogieIcfgContainer [2024-06-28 02:47:54,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:47:54,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:47:54,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:47:54,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:47:54,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:47:46" (1/4) ... [2024-06-28 02:47:54,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@864c8c9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:47:54, skipping insertion in model container [2024-06-28 02:47:54,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:47:47" (2/4) ... [2024-06-28 02:47:54,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@864c8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:47:54, skipping insertion in model container [2024-06-28 02:47:54,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:47:48" (3/4) ... [2024-06-28 02:47:54,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@864c8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:47:54, skipping insertion in model container [2024-06-28 02:47:54,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:47:54" (4/4) ... [2024-06-28 02:47:54,836 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2024-06-28 02:47:54,850 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:47:54,851 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-28 02:47:54,851 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:47:54,910 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-28 02:47:54,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 44 transitions, 102 flow [2024-06-28 02:47:55,038 INFO L124 PetriNetUnfolderBase]: 5/42 cut-off events. [2024-06-28 02:47:55,041 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-28 02:47:55,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 42 events. 5/42 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-06-28 02:47:55,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 44 transitions, 102 flow [2024-06-28 02:47:55,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 38 transitions, 85 flow [2024-06-28 02:47:55,058 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:47:55,066 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;@30cdd5d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:47:55,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-28 02:47:55,076 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:47:55,076 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-28 02:47:55,077 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:47:55,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:47:55,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-28 02:47:55,078 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:47:55,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:47:55,082 INFO L85 PathProgramCache]: Analyzing trace with hash -351486515, now seen corresponding path program 1 times [2024-06-28 02:47:55,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:47:55,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043398342] [2024-06-28 02:47:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:47:55,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:47:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:47:56,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-28 02:47:56,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:47:56,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043398342] [2024-06-28 02:47:56,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043398342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:47:56,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:47:56,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:47:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859959558] [2024-06-28 02:47:56,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:47:56,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:47:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:47:56,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:47:56,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:47:56,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2024-06-28 02:47:56,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:47:56,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:47:56,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2024-06-28 02:47:56,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:47:57,030 INFO L124 PetriNetUnfolderBase]: 689/1151 cut-off events. [2024-06-28 02:47:57,030 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-28 02:47:57,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2290 conditions, 1151 events. 689/1151 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5141 event pairs, 201 based on Foata normal form. 29/1034 useless extension candidates. Maximal degree in co-relation 2223. Up to 1004 conditions per place. [2024-06-28 02:47:57,039 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 39 selfloop transitions, 3 changer transitions 4/50 dead transitions. [2024-06-28 02:47:57,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 204 flow [2024-06-28 02:47:57,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:47:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:47:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-06-28 02:47:57,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-06-28 02:47:57,051 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 85 flow. Second operand 3 states and 67 transitions. [2024-06-28 02:47:57,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 204 flow [2024-06-28 02:47:57,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 02:47:57,057 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 92 flow [2024-06-28 02:47:57,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2024-06-28 02:47:57,061 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2024-06-28 02:47:57,062 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 92 flow [2024-06-28 02:47:57,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:47:57,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:47:57,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:47:57,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:47:57,063 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:47:57,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:47:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash 28056771, now seen corresponding path program 1 times [2024-06-28 02:47:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:47:57,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543392275] [2024-06-28 02:47:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:47:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:47:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:47:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:47:57,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:47:57,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543392275] [2024-06-28 02:47:57,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543392275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:47:57,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:47:57,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:47:57,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628341657] [2024-06-28 02:47:57,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:47:57,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:47:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:47:57,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:47:57,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:47:57,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2024-06-28 02:47:57,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 92 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:47:57,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:47:57,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2024-06-28 02:47:57,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:47:58,398 INFO L124 PetriNetUnfolderBase]: 525/903 cut-off events. [2024-06-28 02:47:58,400 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-06-28 02:47:58,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 903 events. 525/903 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3899 event pairs, 104 based on Foata normal form. 20/866 useless extension candidates. Maximal degree in co-relation 1526. Up to 678 conditions per place. [2024-06-28 02:47:58,404 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 58 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2024-06-28 02:47:58,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 70 transitions, 302 flow [2024-06-28 02:47:58,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:47:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:47:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-28 02:47:58,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-28 02:47:58,411 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 92 flow. Second operand 6 states and 99 transitions. [2024-06-28 02:47:58,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 70 transitions, 302 flow [2024-06-28 02:47:58,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 70 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:47:58,414 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 140 flow [2024-06-28 02:47:58,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2024-06-28 02:47:58,415 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-06-28 02:47:58,415 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 140 flow [2024-06-28 02:47:58,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:47:58,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:47:58,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:47:58,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:47:58,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:47:58,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:47:58,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1675274584, now seen corresponding path program 1 times [2024-06-28 02:47:58,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:47:58,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269545638] [2024-06-28 02:47:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:47:58,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:47:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:47:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:47:59,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:47:59,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269545638] [2024-06-28 02:47:59,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269545638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:47:59,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:47:59,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:47:59,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561367354] [2024-06-28 02:47:59,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:47:59,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:47:59,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:47:59,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:47:59,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:47:59,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2024-06-28 02:47:59,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:47:59,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:47:59,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2024-06-28 02:47:59,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:47:59,646 INFO L124 PetriNetUnfolderBase]: 593/1047 cut-off events. [2024-06-28 02:47:59,646 INFO L125 PetriNetUnfolderBase]: For 537/540 co-relation queries the response was YES. [2024-06-28 02:47:59,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2594 conditions, 1047 events. 593/1047 cut-off events. For 537/540 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4705 event pairs, 100 based on Foata normal form. 26/1012 useless extension candidates. Maximal degree in co-relation 1872. Up to 668 conditions per place. [2024-06-28 02:47:59,651 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 59 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2024-06-28 02:47:59,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 346 flow [2024-06-28 02:47:59,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:47:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:47:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-06-28 02:47:59,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2024-06-28 02:47:59,653 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 140 flow. Second operand 4 states and 86 transitions. [2024-06-28 02:47:59,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 346 flow [2024-06-28 02:47:59,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 69 transitions, 334 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-28 02:47:59,655 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 160 flow [2024-06-28 02:47:59,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2024-06-28 02:47:59,656 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2024-06-28 02:47:59,656 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 160 flow [2024-06-28 02:47:59,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:47:59,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:47:59,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:47:59,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:47:59,657 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:47:59,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:47:59,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2038130495, now seen corresponding path program 1 times [2024-06-28 02:47:59,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:47:59,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577865663] [2024-06-28 02:47:59,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:47:59,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:47:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:48:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:48:00,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:48:00,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577865663] [2024-06-28 02:48:00,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577865663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:48:00,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:48:00,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:48:00,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77944057] [2024-06-28 02:48:00,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:48:00,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:48:00,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:48:00,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:48:00,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:48:00,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2024-06-28 02:48:00,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:48:00,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:48:00,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2024-06-28 02:48:00,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:48:00,739 INFO L124 PetriNetUnfolderBase]: 572/1011 cut-off events. [2024-06-28 02:48:00,739 INFO L125 PetriNetUnfolderBase]: For 692/695 co-relation queries the response was YES. [2024-06-28 02:48:00,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 1011 events. 572/1011 cut-off events. For 692/695 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4565 event pairs, 177 based on Foata normal form. 20/971 useless extension candidates. Maximal degree in co-relation 2139. Up to 792 conditions per place. [2024-06-28 02:48:00,744 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 53 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2024-06-28 02:48:00,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 352 flow [2024-06-28 02:48:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:48:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:48:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2024-06-28 02:48:00,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44886363636363635 [2024-06-28 02:48:00,746 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 160 flow. Second operand 4 states and 79 transitions. [2024-06-28 02:48:00,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 352 flow [2024-06-28 02:48:00,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 342 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-28 02:48:00,749 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 208 flow [2024-06-28 02:48:00,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2024-06-28 02:48:00,749 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2024-06-28 02:48:00,750 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 208 flow [2024-06-28 02:48:00,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:48:00,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:48:00,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:48:00,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:48:00,750 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:48:00,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:48:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash -827605882, now seen corresponding path program 1 times [2024-06-28 02:48:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:48:00,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42355267] [2024-06-28 02:48:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:48:00,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:48:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:48:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:48:01,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:48:01,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42355267] [2024-06-28 02:48:01,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42355267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:48:01,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:48:01,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:48:01,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457889843] [2024-06-28 02:48:01,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:48:01,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:48:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:48:01,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:48:01,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:48:01,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2024-06-28 02:48:01,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:48:01,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:48:01,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2024-06-28 02:48:01,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:48:02,300 INFO L124 PetriNetUnfolderBase]: 597/1049 cut-off events. [2024-06-28 02:48:02,300 INFO L125 PetriNetUnfolderBase]: For 1269/1272 co-relation queries the response was YES. [2024-06-28 02:48:02,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3013 conditions, 1049 events. 597/1049 cut-off events. For 1269/1272 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4690 event pairs, 78 based on Foata normal form. 7/995 useless extension candidates. Maximal degree in co-relation 2228. Up to 648 conditions per place. [2024-06-28 02:48:02,306 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 81 selfloop transitions, 15 changer transitions 0/99 dead transitions. [2024-06-28 02:48:02,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 99 transitions, 552 flow [2024-06-28 02:48:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:48:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:48:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-28 02:48:02,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40584415584415584 [2024-06-28 02:48:02,308 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 208 flow. Second operand 7 states and 125 transitions. [2024-06-28 02:48:02,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 99 transitions, 552 flow [2024-06-28 02:48:02,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 99 transitions, 532 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-28 02:48:02,312 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 295 flow [2024-06-28 02:48:02,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=295, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2024-06-28 02:48:02,312 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2024-06-28 02:48:02,313 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 295 flow [2024-06-28 02:48:02,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:48:02,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:48:02,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:48:02,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:48:02,313 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:48:02,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:48:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash 943959313, now seen corresponding path program 1 times [2024-06-28 02:48:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:48:02,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287342248] [2024-06-28 02:48:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:48:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:48:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:48:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:48:02,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:48:02,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287342248] [2024-06-28 02:48:02,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287342248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:48:02,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:48:02,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:48:02,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696562765] [2024-06-28 02:48:02,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:48:02,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:48:02,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:48:02,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:48:02,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:48:02,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2024-06-28 02:48:02,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 295 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:48:02,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:48:02,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2024-06-28 02:48:02,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:48:02,893 INFO L124 PetriNetUnfolderBase]: 422/787 cut-off events. [2024-06-28 02:48:02,893 INFO L125 PetriNetUnfolderBase]: For 1429/1435 co-relation queries the response was YES. [2024-06-28 02:48:02,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2335 conditions, 787 events. 422/787 cut-off events. For 1429/1435 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3423 event pairs, 133 based on Foata normal form. 52/798 useless extension candidates. Maximal degree in co-relation 1343. Up to 443 conditions per place. [2024-06-28 02:48:02,897 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 42 selfloop transitions, 14 changer transitions 0/60 dead transitions. [2024-06-28 02:48:02,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 393 flow [2024-06-28 02:48:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:48:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:48:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-06-28 02:48:02,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-06-28 02:48:02,898 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 295 flow. Second operand 3 states and 65 transitions. [2024-06-28 02:48:02,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 393 flow [2024-06-28 02:48:02,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 371 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 02:48:02,901 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 237 flow [2024-06-28 02:48:02,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-28 02:48:02,902 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2024-06-28 02:48:02,902 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 237 flow [2024-06-28 02:48:02,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:48:02,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:48:02,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:48:02,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:48:02,903 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:48:02,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:48:02,903 INFO L85 PathProgramCache]: Analyzing trace with hash 114025884, now seen corresponding path program 1 times [2024-06-28 02:48:02,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:48:02,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507739746] [2024-06-28 02:48:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:48:02,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:48:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:48:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:48:03,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:48:03,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507739746] [2024-06-28 02:48:03,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507739746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:48:03,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:48:03,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:48:03,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041363692] [2024-06-28 02:48:03,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:48:03,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:48:03,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:48:03,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:48:03,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:48:03,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2024-06-28 02:48:03,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-28 02:48:03,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:48:03,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2024-06-28 02:48:03,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:48:04,184 INFO L124 PetriNetUnfolderBase]: 479/913 cut-off events. [2024-06-28 02:48:04,184 INFO L125 PetriNetUnfolderBase]: For 1887/1887 co-relation queries the response was YES. [2024-06-28 02:48:04,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 913 events. 479/913 cut-off events. For 1887/1887 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4022 event pairs, 115 based on Foata normal form. 19/892 useless extension candidates. Maximal degree in co-relation 1925. Up to 465 conditions per place. [2024-06-28 02:48:04,189 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 67 selfloop transitions, 7 changer transitions 2/80 dead transitions. [2024-06-28 02:48:04,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 487 flow [2024-06-28 02:48:04,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:48:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:48:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-28 02:48:04,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2024-06-28 02:48:04,190 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 237 flow. Second operand 5 states and 106 transitions. [2024-06-28 02:48:04,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 487 flow [2024-06-28 02:48:04,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:48:04,193 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 262 flow [2024-06-28 02:48:04,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-06-28 02:48:04,194 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2024-06-28 02:48:04,194 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 262 flow [2024-06-28 02:48:04,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-28 02:48:04,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:48:04,194 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-28 02:48:04,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:48:04,194 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:48:04,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:48:04,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1568713866, now seen corresponding path program 1 times [2024-06-28 02:48:04,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:48:04,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875192881] [2024-06-28 02:48:04,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:48:04,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:48:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:48:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:48:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:48:04,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875192881] [2024-06-28 02:48:04,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875192881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:48:04,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:48:04,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:48:04,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685754873] [2024-06-28 02:48:04,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:48:04,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:48:04,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:48:04,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:48:04,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:48:04,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2024-06-28 02:48:04,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:48:04,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:48:04,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2024-06-28 02:48:04,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:48:05,216 INFO L124 PetriNetUnfolderBase]: 456/878 cut-off events. [2024-06-28 02:48:05,216 INFO L125 PetriNetUnfolderBase]: For 1866/1873 co-relation queries the response was YES. [2024-06-28 02:48:05,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2618 conditions, 878 events. 456/878 cut-off events. For 1866/1873 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3940 event pairs, 105 based on Foata normal form. 17/861 useless extension candidates. Maximal degree in co-relation 1899. Up to 530 conditions per place. [2024-06-28 02:48:05,221 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 58 selfloop transitions, 10 changer transitions 2/74 dead transitions. [2024-06-28 02:48:05,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 74 transitions, 470 flow [2024-06-28 02:48:05,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:48:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:48:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-06-28 02:48:05,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40454545454545454 [2024-06-28 02:48:05,223 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 262 flow. Second operand 5 states and 89 transitions. [2024-06-28 02:48:05,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 74 transitions, 470 flow [2024-06-28 02:48:05,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 453 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 02:48:05,226 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 267 flow [2024-06-28 02:48:05,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-06-28 02:48:05,227 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2024-06-28 02:48:05,227 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 267 flow [2024-06-28 02:48:05,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:48:05,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:48:05,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:48:05,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:48:05,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:48:05,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:48:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2137410572, now seen corresponding path program 1 times [2024-06-28 02:48:05,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:48:05,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262597462] [2024-06-28 02:48:05,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:48:05,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:48:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:48:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:48:05,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:48:05,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262597462] [2024-06-28 02:48:05,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262597462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:48:05,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:48:05,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:48:05,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492441092] [2024-06-28 02:48:05,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:48:05,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:48:05,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:48:05,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:48:05,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:48:05,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2024-06-28 02:48:05,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:48:05,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:48:05,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2024-06-28 02:48:05,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:48:06,171 INFO L124 PetriNetUnfolderBase]: 445/874 cut-off events. [2024-06-28 02:48:06,172 INFO L125 PetriNetUnfolderBase]: For 2434/2434 co-relation queries the response was YES. [2024-06-28 02:48:06,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 874 events. 445/874 cut-off events. For 2434/2434 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3861 event pairs, 137 based on Foata normal form. 18/890 useless extension candidates. Maximal degree in co-relation 2035. Up to 387 conditions per place. [2024-06-28 02:48:06,176 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 59 selfloop transitions, 5 changer transitions 1/69 dead transitions. [2024-06-28 02:48:06,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 486 flow [2024-06-28 02:48:06,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:48:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:48:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2024-06-28 02:48:06,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-06-28 02:48:06,178 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 267 flow. Second operand 4 states and 78 transitions. [2024-06-28 02:48:06,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 486 flow [2024-06-28 02:48:06,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 466 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 02:48:06,181 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 271 flow [2024-06-28 02:48:06,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-06-28 02:48:06,182 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2024-06-28 02:48:06,182 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 271 flow [2024-06-28 02:48:06,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:48:06,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:48:06,183 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:48:06,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:48:06,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:48:06,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:48:06,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1428045440, now seen corresponding path program 1 times [2024-06-28 02:48:06,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:48:06,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111674448] [2024-06-28 02:48:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:48:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:48:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:48:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:48:07,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:48:07,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111674448] [2024-06-28 02:48:07,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111674448] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 02:48:07,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988414652] [2024-06-28 02:48:07,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:48:07,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:48:07,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:48:07,126 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-28 02:48:07,127 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-28 02:48:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:48:07,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-28 02:48:07,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 02:48:07,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-06-28 02:48:07,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 128 [2024-06-28 02:48:07,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:48:07,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:48:07,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 79 [2024-06-28 02:48:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:48:08,249 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 02:48:08,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-28 02:48:08,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-28 02:48:08,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-28 02:48:08,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-28 02:48:09,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-28 02:48:09,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-28 02:48:09,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-28 02:48:09,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-28 02:48:09,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-28 02:48:09,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-28 02:48:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:48:09,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988414652] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 02:48:09,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 02:48:09,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2024-06-28 02:48:09,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631444450] [2024-06-28 02:48:09,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 02:48:09,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-28 02:48:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:48:09,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-28 02:48:09,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-06-28 02:48:09,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2024-06-28 02:48:09,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 271 flow. Second operand has 17 states, 17 states have (on average 9.176470588235293) internal successors, (156), 17 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:48:09,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:48:09,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2024-06-28 02:48:09,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:48:10,779 INFO L124 PetriNetUnfolderBase]: 724/1434 cut-off events. [2024-06-28 02:48:10,780 INFO L125 PetriNetUnfolderBase]: For 5200/5207 co-relation queries the response was YES. [2024-06-28 02:48:10,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4411 conditions, 1434 events. 724/1434 cut-off events. For 5200/5207 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6838 event pairs, 43 based on Foata normal form. 70/1502 useless extension candidates. Maximal degree in co-relation 3760. Up to 208 conditions per place. [2024-06-28 02:48:10,788 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 116 selfloop transitions, 43 changer transitions 13/176 dead transitions. [2024-06-28 02:48:10,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 176 transitions, 1076 flow [2024-06-28 02:48:10,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-28 02:48:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-28 02:48:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 282 transitions. [2024-06-28 02:48:10,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2024-06-28 02:48:10,789 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 271 flow. Second operand 18 states and 282 transitions. [2024-06-28 02:48:10,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 176 transitions, 1076 flow [2024-06-28 02:48:10,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 176 transitions, 1059 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 02:48:10,794 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 581 flow [2024-06-28 02:48:10,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=581, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2024-06-28 02:48:10,795 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2024-06-28 02:48:10,795 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 581 flow [2024-06-28 02:48:10,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.176470588235293) internal successors, (156), 17 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:48:10,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:48:10,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:48:10,811 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-28 02:48:11,008 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,SelfDestructingSolverStorable9 [2024-06-28 02:48:11,009 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:48:11,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:48:11,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1445372915, now seen corresponding path program 1 times [2024-06-28 02:48:11,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:48:11,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930046240] [2024-06-28 02:48:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:48:11,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:48:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:48:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:48:12,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:48:12,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930046240] [2024-06-28 02:48:12,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930046240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:48:12,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:48:12,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:48:12,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031400285] [2024-06-28 02:48:12,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:48:12,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:48:12,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:48:12,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:48:12,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:48:12,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2024-06-28 02:48:12,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 581 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 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-28 02:48:12,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:48:12,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2024-06-28 02:48:12,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:48:12,423 INFO L124 PetriNetUnfolderBase]: 813/1605 cut-off events. [2024-06-28 02:48:12,423 INFO L125 PetriNetUnfolderBase]: For 5085/5085 co-relation queries the response was YES. [2024-06-28 02:48:12,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5471 conditions, 1605 events. 813/1605 cut-off events. For 5085/5085 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7747 event pairs, 213 based on Foata normal form. 15/1618 useless extension candidates. Maximal degree in co-relation 3512. Up to 873 conditions per place. [2024-06-28 02:48:12,431 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 96 selfloop transitions, 11 changer transitions 1/112 dead transitions. [2024-06-28 02:48:12,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 112 transitions, 998 flow [2024-06-28 02:48:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:48:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:48:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2024-06-28 02:48:12,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2024-06-28 02:48:12,434 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 581 flow. Second operand 5 states and 98 transitions. [2024-06-28 02:48:12,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 112 transitions, 998 flow [2024-06-28 02:48:12,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 112 transitions, 790 flow, removed 93 selfloop flow, removed 7 redundant places. [2024-06-28 02:48:12,442 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 503 flow [2024-06-28 02:48:12,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=503, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2024-06-28 02:48:12,443 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2024-06-28 02:48:12,443 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 503 flow [2024-06-28 02:48:12,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 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-28 02:48:12,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:48:12,443 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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-28 02:48:12,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 02:48:12,444 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:48:12,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:48:12,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1916307991, now seen corresponding path program 1 times [2024-06-28 02:48:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:48:12,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514425726] [2024-06-28 02:48:12,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:48:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:48:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:48:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:48:13,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:48:13,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514425726] [2024-06-28 02:48:13,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514425726] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 02:48:13,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694039358] [2024-06-28 02:48:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:48:13,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:48:13,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:48:13,761 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-28 02:48:13,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-28 02:48:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:48:14,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 34 conjunts are in the unsatisfiable core [2024-06-28 02:48:14,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 02:48:14,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-28 02:48:14,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 186 [2024-06-28 02:48:14,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2024-06-28 02:48:14,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 145 [2024-06-28 02:48:14,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:48:14,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 114 [2024-06-28 02:48:15,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 153 [2024-06-28 02:48:15,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2024-06-28 02:48:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:48:15,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 02:48:15,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-28 02:48:15,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-06-28 02:48:15,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-06-28 02:48:16,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 02:48:16,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2024-06-28 02:48:35,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 231 [2024-06-28 02:48:36,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 02:48:36,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 57014 treesize of output 31794 [2024-06-28 02:49:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:49:29,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694039358] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 02:49:29,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 02:49:29,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 27 [2024-06-28 02:49:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554475200] [2024-06-28 02:49:29,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 02:49:29,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-06-28 02:49:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:49:29,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-06-28 02:49:29,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=578, Unknown=6, NotChecked=0, Total=812 [2024-06-28 02:49:29,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2024-06-28 02:49:29,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 76 transitions, 503 flow. Second operand has 29 states, 29 states have (on average 7.793103448275862) internal successors, (226), 29 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:49:29,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:49:29,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2024-06-28 02:49:29,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:49:41,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:49:51,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:49:55,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:50:25,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:50:26,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:50:31,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:50:35,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:50:39,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:50:43,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:50:47,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:50:50,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:50:54,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:50:56,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:51:00,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:51:05,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:51:09,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:51:13,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:51:17,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:51:21,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:51:25,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:51:52,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:51:56,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:52:00,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:52:06,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:52:10,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:52:14,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:52:18,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:52:22,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:52:42,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:52:47,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:52:51,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:52:55,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:52:59,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:02,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:03,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:05,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:10,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:14,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:15,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:17,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:21,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:25,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:29,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:33,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:37,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:39,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:47,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:49,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:50,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:52,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:53:56,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:00,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:04,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:08,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:12,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:15,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:19,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:25,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:29,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:33,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:37,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:41,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:45,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:49,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:53,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:54:57,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:55:01,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:55:01,515 INFO L124 PetriNetUnfolderBase]: 1657/3238 cut-off events. [2024-06-28 02:55:01,515 INFO L125 PetriNetUnfolderBase]: For 7211/7212 co-relation queries the response was YES. [2024-06-28 02:55:01,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10076 conditions, 3238 events. 1657/3238 cut-off events. For 7211/7212 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 17629 event pairs, 107 based on Foata normal form. 25/3261 useless extension candidates. Maximal degree in co-relation 9394. Up to 505 conditions per place. [2024-06-28 02:55:01,532 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 169 selfloop transitions, 101 changer transitions 10/283 dead transitions. [2024-06-28 02:55:01,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 283 transitions, 2033 flow [2024-06-28 02:55:01,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-06-28 02:55:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-06-28 02:55:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 312 transitions. [2024-06-28 02:55:01,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.308300395256917 [2024-06-28 02:55:01,537 INFO L175 Difference]: Start difference. First operand has 72 places, 76 transitions, 503 flow. Second operand 23 states and 312 transitions. [2024-06-28 02:55:01,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 283 transitions, 2033 flow [2024-06-28 02:55:01,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 283 transitions, 2011 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-28 02:55:01,548 INFO L231 Difference]: Finished difference. Result has 100 places, 150 transitions, 1397 flow [2024-06-28 02:55:01,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1397, PETRI_PLACES=100, PETRI_TRANSITIONS=150} [2024-06-28 02:55:01,548 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2024-06-28 02:55:01,549 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 150 transitions, 1397 flow [2024-06-28 02:55:01,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.793103448275862) internal successors, (226), 29 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:55:01,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:55:01,549 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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-28 02:55:01,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-28 02:55:01,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-06-28 02:55:01,762 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:55:01,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:55:01,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1797279320, now seen corresponding path program 2 times [2024-06-28 02:55:01,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:55:01,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066770840] [2024-06-28 02:55:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:55:01,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:55:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:55:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:55:03,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:55:03,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066770840] [2024-06-28 02:55:03,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066770840] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 02:55:03,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634667049] [2024-06-28 02:55:03,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 02:55:03,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:55:03,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:55:03,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-28 02:55:03,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-28 02:55:03,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 02:55:03,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 02:55:03,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 48 conjunts are in the unsatisfiable core [2024-06-28 02:55:03,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 02:55:03,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-06-28 02:55:03,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-28 02:55:04,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-06-28 02:55:04,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 109 [2024-06-28 02:55:04,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:55:04,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 114 [2024-06-28 02:55:04,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:55:04,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 149 [2024-06-28 02:55:04,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-06-28 02:55:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:55:04,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 02:55:04,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-28 02:55:05,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-06-28 02:55:05,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-06-28 02:55:05,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 02:55:05,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 62 [2024-06-28 02:55:19,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 02:55:19,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8582 treesize of output 8290 [2024-06-28 02:55:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:55:49,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634667049] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 02:55:49,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 02:55:49,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 10] total 23 [2024-06-28 02:55:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854162778] [2024-06-28 02:55:49,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 02:55:49,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-06-28 02:55:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:55:49,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-06-28 02:55:49,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=398, Unknown=4, NotChecked=0, Total=600 [2024-06-28 02:55:49,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2024-06-28 02:55:49,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 150 transitions, 1397 flow. Second operand has 25 states, 25 states have (on average 8.36) internal successors, (209), 25 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:55:49,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:55:49,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2024-06-28 02:55:49,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:56:12,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:56:21,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:56:25,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:56:29,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:56:33,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:56:34,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:56:39,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:56:43,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:56:47,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 02:56:47,916 INFO L124 PetriNetUnfolderBase]: 1917/3768 cut-off events. [2024-06-28 02:56:47,917 INFO L125 PetriNetUnfolderBase]: For 16925/16926 co-relation queries the response was YES. [2024-06-28 02:56:47,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12597 conditions, 3768 events. 1917/3768 cut-off events. For 16925/16926 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21096 event pairs, 216 based on Foata normal form. 211/3977 useless extension candidates. Maximal degree in co-relation 11842. Up to 654 conditions per place. [2024-06-28 02:56:47,935 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 187 selfloop transitions, 60 changer transitions 18/268 dead transitions. [2024-06-28 02:56:47,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 268 transitions, 2513 flow [2024-06-28 02:56:47,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-28 02:56:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-28 02:56:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 228 transitions. [2024-06-28 02:56:47,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-28 02:56:47,937 INFO L175 Difference]: Start difference. First operand has 100 places, 150 transitions, 1397 flow. Second operand 15 states and 228 transitions. [2024-06-28 02:56:47,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 268 transitions, 2513 flow [2024-06-28 02:56:47,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 268 transitions, 2191 flow, removed 140 selfloop flow, removed 8 redundant places. [2024-06-28 02:56:47,969 INFO L231 Difference]: Finished difference. Result has 112 places, 158 transitions, 1460 flow [2024-06-28 02:56:47,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1460, PETRI_PLACES=112, PETRI_TRANSITIONS=158} [2024-06-28 02:56:47,970 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2024-06-28 02:56:47,970 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 158 transitions, 1460 flow [2024-06-28 02:56:47,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.36) internal successors, (209), 25 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:56:47,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:56:47,971 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:56:47,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-06-28 02:56:48,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:56:48,184 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:56:48,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:56:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash 676182956, now seen corresponding path program 1 times [2024-06-28 02:56:48,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:56:48,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177822104] [2024-06-28 02:56:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:56:48,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:56:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:56:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:56:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:56:50,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177822104] [2024-06-28 02:56:50,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177822104] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 02:56:50,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094022969] [2024-06-28 02:56:50,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:56:50,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:56:50,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:56:50,679 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-28 02:56:50,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-28 02:56:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:56:51,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 38 conjunts are in the unsatisfiable core [2024-06-28 02:56:51,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 02:56:51,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-28 02:56:51,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2024-06-28 02:56:51,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:56:51,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 114 [2024-06-28 02:56:51,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:56:51,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:56:51,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:56:51,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2024-06-28 02:56:51,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:56:52,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2024-06-28 02:56:52,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-06-28 02:56:52,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-06-28 02:56:52,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 117 [2024-06-28 02:56:52,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:56:52,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 170 [2024-06-28 02:56:52,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:56:52,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 211 [2024-06-28 02:56:52,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:56:52,760 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-28 02:56:52,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 55 [2024-06-28 02:56:52,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 02:56:52,795 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-28 02:56:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 02:56:52,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 02:56:53,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-28 02:56:53,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-28 02:56:53,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-28 02:56:53,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-06-28 02:56:54,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 02:56:54,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 76 [2024-06-28 02:56:54,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 02:56:54,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 54 [2024-06-28 02:56:56,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 02:56:56,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 76 [2024-06-28 02:56:56,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 02:56:56,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 54 [2024-06-28 02:57:02,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 02:57:02,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 25 case distinctions, treesize of input 16049 treesize of output 8787 [2024-06-28 02:57:11,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-06-28 02:57:11,855 INFO L349 Elim1Store]: treesize reduction 8, result has 93.2 percent of original size [2024-06-28 02:57:11,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 149129 treesize of output 85106 [2024-06-28 02:57:12,469 INFO L349 Elim1Store]: treesize reduction 68, result has 41.9 percent of original size [2024-06-28 02:57:12,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 35811 treesize of output 21008 [2024-06-28 02:57:12,742 INFO L349 Elim1Store]: treesize reduction 8, result has 93.2 percent of original size [2024-06-28 02:57:12,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 9569 treesize of output 5474 [2024-06-28 02:57:13,268 INFO L349 Elim1Store]: treesize reduction 8, result has 93.2 percent of original size [2024-06-28 02:57:13,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 81516 treesize of output 43969 [2024-06-28 02:57:13,615 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-06-28 02:57:13,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 269 treesize of output 192 [2024-06-28 02:57:13,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 02:57:13,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 55 [2024-06-28 02:57:13,729 INFO L349 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2024-06-28 02:57:13,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 406 treesize of output 237 [2024-06-28 02:57:13,824 INFO L349 Elim1Store]: treesize reduction 8, result has 88.4 percent of original size [2024-06-28 02:57:13,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 397 treesize of output 292 [2024-06-28 02:57:13,987 INFO L349 Elim1Store]: treesize reduction 8, result has 88.4 percent of original size [2024-06-28 02:57:13,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 802 treesize of output 519 [2024-06-28 02:57:14,162 INFO L349 Elim1Store]: treesize reduction 8, result has 88.4 percent of original size [2024-06-28 02:57:14,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 1591 treesize of output 964 [2024-06-28 02:57:14,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-28 02:57:46,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-06-28 02:57:47,423 INFO L349 Elim1Store]: treesize reduction 8, result has 97.4 percent of original size [2024-06-28 02:57:47,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 395627 treesize of output 222104 [2024-06-28 02:57:48,078 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-06-28 02:57:48,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 7520 treesize of output 4301 [2024-06-28 02:59:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 17 refuted. 8 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 02:59:22,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094022969] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 02:59:22,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 02:59:22,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 31 [2024-06-28 02:59:22,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503248494] [2024-06-28 02:59:22,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 02:59:22,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-06-28 02:59:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:59:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-06-28 02:59:22,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=762, Unknown=16, NotChecked=0, Total=1056 [2024-06-28 02:59:22,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2024-06-28 02:59:22,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 158 transitions, 1460 flow. Second operand has 33 states, 33 states have (on average 8.484848484848484) internal successors, (280), 33 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:59:22,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:59:22,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2024-06-28 02:59:22,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:59:29,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-28 02:59:33,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-28 02:59:37,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-28 02:59:48,722 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification. DAG size of input: 1655 DAG size of output: 1259 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-28 02:59:52,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 03:00:02,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 03:00:18,040 WARN L293 SmtUtils]: Spent 10.33s on a formula simplification. DAG size of input: 1663 DAG size of output: 1263 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-28 03:00:36,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 03:00:38,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 03:00:50,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 03:00:54,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 03:00:58,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 03:01:09,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 03:01:13,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 03:01:38,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 03:01:43,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 03:01:53,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15