./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-05-21_14-57-05.files/mutex-meet/queue.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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-05-21_14-57-05.files/mutex-meet/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-cde23df-m [2024-06-14 14:21:46,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:21:46,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:21:46,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:21:46,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:21:46,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:21:46,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:21:46,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:21:46,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:21:46,348 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:21:46,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:21:46,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:21:46,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:21:46,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:21:46,350 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:21:46,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:21:46,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:21:46,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:21:46,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:21:46,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:21:46,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:21:46,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:21:46,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:21:46,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:21:46,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:21:46,357 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:21:46,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:21:46,357 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:21:46,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:21:46,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:21:46,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:21:46,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:21:46,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:21:46,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:21:46,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:21:46,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:21:46,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:21:46,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:21:46,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:21:46,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:21:46,360 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:21:46,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:21:46,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:21:46,364 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-14 14:21:46,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:21:46,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:21:46,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:21:46,576 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:21:46,576 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:21:46,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2024-06-14 14:21:47,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:21:47,912 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:21:47,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2024-06-14 14:21:47,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f26f4ca3/780a671786ad41058a942c074e285dfe/FLAGdb273e5e6 [2024-06-14 14:21:47,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f26f4ca3/780a671786ad41058a942c074e285dfe [2024-06-14 14:21:47,952 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:21:47,953 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:21:47,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/queue.yml/witness.yml [2024-06-14 14:21:48,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:21:48,046 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:21:48,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:21:48,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:21:48,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:21:48,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:21:47" (1/2) ... [2024-06-14 14:21:48,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47be67ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:21:48, skipping insertion in model container [2024-06-14 14:21:48,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:21:47" (1/2) ... [2024-06-14 14:21:48,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6bef6c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:21:48, skipping insertion in model container [2024-06-14 14:21:48,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:21:48" (2/2) ... [2024-06-14 14:21:48,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47be67ae and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48, skipping insertion in model container [2024-06-14 14:21:48,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:21:48" (2/2) ... [2024-06-14 14:21:48,058 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:21:48,146 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:21:48,147 INFO L97 edCorrectnessWitness]: Location invariant before [L1065-L1065] ((! multithreaded || (m_locked || ((((-1LL + (long long )dequeue_flag) + (long long )enqueue_flag >= 0LL && (1LL - (long long )dequeue_flag) + (long long )enqueue_flag >= 0LL) && (1LL + (long long )dequeue_flag) - (long long )enqueue_flag >= 0LL) && (1LL - (long long )dequeue_flag) - (long long )enqueue_flag >= 0LL))) && (! multithreaded || (m_locked || 0 <= queue.head))) && (! multithreaded || 0 <= queue.head) [2024-06-14 14:21:48,147 INFO L97 edCorrectnessWitness]: Location invariant before [L1064-L1064] ((! multithreaded || (m_locked || ((((-1LL + (long long )dequeue_flag) + (long long )enqueue_flag >= 0LL && (1LL - (long long )dequeue_flag) + (long long )enqueue_flag >= 0LL) && (1LL + (long long )dequeue_flag) - (long long )enqueue_flag >= 0LL) && (1LL - (long long )dequeue_flag) - (long long )enqueue_flag >= 0LL))) && (! multithreaded || (m_locked || 0 <= queue.head))) && (! multithreaded || 0 <= queue.head) [2024-06-14 14:21:48,147 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:21:48,147 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-14 14:21:48,147 INFO L106 edCorrectnessWitness]: ghost_update [L1048-L1048] m_locked = 0; [2024-06-14 14:21:48,148 INFO L106 edCorrectnessWitness]: ghost_update [L1039-L1039] m_locked = 1; [2024-06-14 14:21:48,148 INFO L106 edCorrectnessWitness]: ghost_update [L1063-L1063] multithreaded = 1; [2024-06-14 14:21:48,149 INFO L106 edCorrectnessWitness]: ghost_update [L1017-L1017] m_locked = 0; [2024-06-14 14:21:48,149 INFO L106 edCorrectnessWitness]: ghost_update [L1008-L1008] m_locked = 1; [2024-06-14 14:21:48,149 INFO L106 edCorrectnessWitness]: ghost_update [L1020-L1020] m_locked = 1; [2024-06-14 14:21:48,149 INFO L106 edCorrectnessWitness]: ghost_update [L1029-L1029] m_locked = 0; [2024-06-14 14:21:48,190 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:21:48,531 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:21:48,541 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-14 14:21:48,635 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:21:48,689 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:21:48,690 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48 WrapperNode [2024-06-14 14:21:48,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:21:48,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:21:48,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:21:48,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:21:48,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (1/1) ... [2024-06-14 14:21:48,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (1/1) ... [2024-06-14 14:21:48,766 INFO L138 Inliner]: procedures = 274, calls = 156, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 632 [2024-06-14 14:21:48,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:21:48,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:21:48,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:21:48,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:21:48,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (1/1) ... [2024-06-14 14:21:48,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (1/1) ... [2024-06-14 14:21:48,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (1/1) ... [2024-06-14 14:21:48,826 INFO L175 MemorySlicer]: Split 143 memory accesses to 5 slices as follows [2, 8, 5, 4, 124]. 87 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-14 14:21:48,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (1/1) ... [2024-06-14 14:21:48,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (1/1) ... [2024-06-14 14:21:48,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (1/1) ... [2024-06-14 14:21:48,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (1/1) ... [2024-06-14 14:21:48,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (1/1) ... [2024-06-14 14:21:48,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (1/1) ... [2024-06-14 14:21:48,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:21:48,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:21:48,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:21:48,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:21:48,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (1/1) ... [2024-06-14 14:21:48,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:21:48,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:21:48,909 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-14 14:21:48,910 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-14 14:21:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-14 14:21:48,952 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-14 14:21:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-14 14:21:48,952 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-14 14:21:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-14 14:21:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-14 14:21:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-14 14:21:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-14 14:21:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-14 14:21:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-06-14 14:21:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-14 14:21:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-14 14:21:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-14 14:21:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-14 14:21:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-06-14 14:21:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-14 14:21:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:21:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:21:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-14 14:21:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-14 14:21:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-14 14:21:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-06-14 14:21:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:21:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:21:48,960 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:21:49,148 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:21:49,150 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:21:49,700 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:21:49,700 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:21:50,499 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:21:50,499 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-14 14:21:50,500 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:21:50 BoogieIcfgContainer [2024-06-14 14:21:50,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:21:50,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:21:50,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:21:50,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:21:50,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:21:47" (1/4) ... [2024-06-14 14:21:50,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67dbf09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:21:50, skipping insertion in model container [2024-06-14 14:21:50,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:21:48" (2/4) ... [2024-06-14 14:21:50,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67dbf09b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:21:50, skipping insertion in model container [2024-06-14 14:21:50,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:21:48" (3/4) ... [2024-06-14 14:21:50,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67dbf09b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:21:50, skipping insertion in model container [2024-06-14 14:21:50,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:21:50" (4/4) ... [2024-06-14 14:21:50,506 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2024-06-14 14:21:50,521 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:21:50,521 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 14:21:50,521 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:21:50,567 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-14 14:21:50,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 45 transitions, 104 flow [2024-06-14 14:21:50,613 INFO L124 PetriNetUnfolderBase]: 5/43 cut-off events. [2024-06-14 14:21:50,614 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-14 14:21:50,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 5/43 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 72 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-06-14 14:21:50,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 45 transitions, 104 flow [2024-06-14 14:21:50,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 39 transitions, 87 flow [2024-06-14 14:21:50,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:21:50,689 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;@43d0f209, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:21:50,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:21:50,710 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:21:50,711 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-14 14:21:50,711 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:21:50,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:21:50,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:21:50,712 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-14 14:21:50,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:21:50,716 INFO L85 PathProgramCache]: Analyzing trace with hash 533197106, now seen corresponding path program 1 times [2024-06-14 14:21:50,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:21:50,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363547364] [2024-06-14 14:21:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:21:50,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:21:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:21:51,289 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-14 14:21:51,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:21:51,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363547364] [2024-06-14 14:21:51,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363547364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:21:51,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:21:51,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:21:51,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74255875] [2024-06-14 14:21:51,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:21:51,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:21:51,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:21:51,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:21:51,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:21:51,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2024-06-14 14:21:51,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:21:51,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:21:51,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2024-06-14 14:21:51,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:21:51,772 INFO L124 PetriNetUnfolderBase]: 614/1038 cut-off events. [2024-06-14 14:21:51,772 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-14 14:21:51,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 1038 events. 614/1038 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4581 event pairs, 135 based on Foata normal form. 29/936 useless extension candidates. Maximal degree in co-relation 1992. Up to 836 conditions per place. [2024-06-14 14:21:51,778 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 41 selfloop transitions, 2 changer transitions 4/50 dead transitions. [2024-06-14 14:21:51,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 206 flow [2024-06-14 14:21:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:21:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:21:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-06-14 14:21:51,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-06-14 14:21:51,788 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 87 flow. Second operand 3 states and 65 transitions. [2024-06-14 14:21:51,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 206 flow [2024-06-14 14:21:51,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 200 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 14:21:51,792 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 83 flow [2024-06-14 14:21:51,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-14 14:21:51,796 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-14 14:21:51,796 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 83 flow [2024-06-14 14:21:51,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:21:51,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:21:51,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:21:51,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:21:51,797 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-14 14:21:51,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:21:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1687683864, now seen corresponding path program 1 times [2024-06-14 14:21:51,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:21:51,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447355671] [2024-06-14 14:21:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:21:51,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:21:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:21:52,076 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-14 14:21:52,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:21:52,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447355671] [2024-06-14 14:21:52,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447355671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:21:52,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:21:52,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 14:21:52,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979850344] [2024-06-14 14:21:52,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:21:52,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:21:52,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:21:52,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:21:52,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-14 14:21:52,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2024-06-14 14:21:52,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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-14 14:21:52,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:21:52,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2024-06-14 14:21:52,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:21:52,338 INFO L124 PetriNetUnfolderBase]: 495/854 cut-off events. [2024-06-14 14:21:52,338 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-06-14 14:21:52,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1803 conditions, 854 events. 495/854 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3627 event pairs, 96 based on Foata normal form. 20/819 useless extension candidates. Maximal degree in co-relation 1404. Up to 625 conditions per place. [2024-06-14 14:21:52,342 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 61 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2024-06-14 14:21:52,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 71 transitions, 300 flow [2024-06-14 14:21:52,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:21:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:21:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-14 14:21:52,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-14 14:21:52,344 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 83 flow. Second operand 5 states and 95 transitions. [2024-06-14 14:21:52,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 71 transitions, 300 flow [2024-06-14 14:21:52,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 71 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:21:52,346 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 130 flow [2024-06-14 14:21:52,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2024-06-14 14:21:52,347 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-06-14 14:21:52,347 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 130 flow [2024-06-14 14:21:52,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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-14 14:21:52,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:21:52,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:21:52,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:21:52,348 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-14 14:21:52,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:21:52,349 INFO L85 PathProgramCache]: Analyzing trace with hash 904710221, now seen corresponding path program 1 times [2024-06-14 14:21:52,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:21:52,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539231847] [2024-06-14 14:21:52,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:21:52,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:21:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:21:52,705 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-14 14:21:52,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:21:52,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539231847] [2024-06-14 14:21:52,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539231847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:21:52,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:21:52,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:21:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041670443] [2024-06-14 14:21:52,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:21:52,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:21:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:21:52,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:21:52,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:21:52,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2024-06-14 14:21:52,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-14 14:21:52,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:21:52,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2024-06-14 14:21:52,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:21:52,894 INFO L124 PetriNetUnfolderBase]: 503/914 cut-off events. [2024-06-14 14:21:52,894 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2024-06-14 14:21:52,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 914 events. 503/914 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3909 event pairs, 138 based on Foata normal form. 48/918 useless extension candidates. Maximal degree in co-relation 1480. Up to 392 conditions per place. [2024-06-14 14:21:52,898 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 56 selfloop transitions, 4 changer transitions 3/66 dead transitions. [2024-06-14 14:21:52,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 318 flow [2024-06-14 14:21:52,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:21:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:21:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2024-06-14 14:21:52,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2024-06-14 14:21:52,900 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 130 flow. Second operand 4 states and 79 transitions. [2024-06-14 14:21:52,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 318 flow [2024-06-14 14:21:52,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 318 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-14 14:21:52,902 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 145 flow [2024-06-14 14:21:52,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-06-14 14:21:52,902 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2024-06-14 14:21:52,903 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 145 flow [2024-06-14 14:21:52,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-14 14:21:52,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:21:52,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:21:52,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:21:52,903 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:21:52,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:21:52,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1784142379, now seen corresponding path program 1 times [2024-06-14 14:21:52,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:21:52,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429131314] [2024-06-14 14:21:52,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:21:52,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:21:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:21:53,465 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-14 14:21:53,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:21:53,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429131314] [2024-06-14 14:21:53,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429131314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:21:53,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:21:53,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:21:53,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940197712] [2024-06-14 14:21:53,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:21:53,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:21:53,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:21:53,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:21:53,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:21:53,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2024-06-14 14:21:53,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:21:53,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:21:53,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2024-06-14 14:21:53,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:21:53,769 INFO L124 PetriNetUnfolderBase]: 511/947 cut-off events. [2024-06-14 14:21:53,769 INFO L125 PetriNetUnfolderBase]: For 469/473 co-relation queries the response was YES. [2024-06-14 14:21:53,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2311 conditions, 947 events. 511/947 cut-off events. For 469/473 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4273 event pairs, 60 based on Foata normal form. 9/956 useless extension candidates. Maximal degree in co-relation 1798. Up to 581 conditions per place. [2024-06-14 14:21:53,774 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 76 selfloop transitions, 14 changer transitions 2/95 dead transitions. [2024-06-14 14:21:53,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 95 transitions, 468 flow [2024-06-14 14:21:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:21:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:21:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-14 14:21:53,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4031746031746032 [2024-06-14 14:21:53,778 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 145 flow. Second operand 7 states and 127 transitions. [2024-06-14 14:21:53,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 95 transitions, 468 flow [2024-06-14 14:21:53,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 95 transitions, 458 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 14:21:53,784 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 216 flow [2024-06-14 14:21:53,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-14 14:21:53,785 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-06-14 14:21:53,785 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 216 flow [2024-06-14 14:21:53,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:21:53,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:21:53,786 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-14 14:21:53,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:21:53,786 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-14 14:21:53,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:21:53,786 INFO L85 PathProgramCache]: Analyzing trace with hash -526158863, now seen corresponding path program 1 times [2024-06-14 14:21:53,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:21:53,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243060442] [2024-06-14 14:21:53,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:21:53,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:21:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:21:54,492 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-14 14:21:54,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:21:54,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243060442] [2024-06-14 14:21:54,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243060442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:21:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:21:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 14:21:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932027834] [2024-06-14 14:21:54,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:21:54,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:21:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:21:54,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:21:54,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 14:21:54,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2024-06-14 14:21:54,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 216 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-14 14:21:54,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:21:54,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2024-06-14 14:21:54,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:21:54,733 INFO L124 PetriNetUnfolderBase]: 571/1065 cut-off events. [2024-06-14 14:21:54,733 INFO L125 PetriNetUnfolderBase]: For 1027/1027 co-relation queries the response was YES. [2024-06-14 14:21:54,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2878 conditions, 1065 events. 571/1065 cut-off events. For 1027/1027 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4728 event pairs, 118 based on Foata normal form. 35/1100 useless extension candidates. Maximal degree in co-relation 2203. Up to 386 conditions per place. [2024-06-14 14:21:54,738 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 67 selfloop transitions, 7 changer transitions 4/81 dead transitions. [2024-06-14 14:21:54,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 470 flow [2024-06-14 14:21:54,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:21:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:21:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-14 14:21:54,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4088888888888889 [2024-06-14 14:21:54,740 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 216 flow. Second operand 5 states and 92 transitions. [2024-06-14 14:21:54,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 470 flow [2024-06-14 14:21:54,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 81 transitions, 449 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-14 14:21:54,743 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 219 flow [2024-06-14 14:21:54,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-14 14:21:54,743 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2024-06-14 14:21:54,744 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 219 flow [2024-06-14 14:21:54,744 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-14 14:21:54,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:21:54,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:21:54,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:21:54,744 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-14 14:21:54,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:21:54,745 INFO L85 PathProgramCache]: Analyzing trace with hash 872374265, now seen corresponding path program 1 times [2024-06-14 14:21:54,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:21:54,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916567212] [2024-06-14 14:21:54,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:21:54,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:21:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:21:54,849 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-14 14:21:54,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:21:54,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916567212] [2024-06-14 14:21:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916567212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:21:54,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:21:54,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 14:21:54,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594721359] [2024-06-14 14:21:54,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:21:54,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:21:54,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:21:54,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:21:54,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:21:54,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2024-06-14 14:21:54,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:21:54,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:21:54,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2024-06-14 14:21:54,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:21:55,013 INFO L124 PetriNetUnfolderBase]: 421/839 cut-off events. [2024-06-14 14:21:55,013 INFO L125 PetriNetUnfolderBase]: For 695/699 co-relation queries the response was YES. [2024-06-14 14:21:55,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 839 events. 421/839 cut-off events. For 695/699 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3666 event pairs, 151 based on Foata normal form. 56/895 useless extension candidates. Maximal degree in co-relation 1400. Up to 425 conditions per place. [2024-06-14 14:21:55,017 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 42 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2024-06-14 14:21:55,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 342 flow [2024-06-14 14:21:55,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:21:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:21:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-06-14 14:21:55,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 14:21:55,018 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 219 flow. Second operand 3 states and 60 transitions. [2024-06-14 14:21:55,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 342 flow [2024-06-14 14:21:55,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 333 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 14:21:55,022 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 213 flow [2024-06-14 14:21:55,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2024-06-14 14:21:55,022 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2024-06-14 14:21:55,023 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 213 flow [2024-06-14 14:21:55,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:21:55,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:21:55,023 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-14 14:21:55,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:21:55,023 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:21:55,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:21:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1245637981, now seen corresponding path program 1 times [2024-06-14 14:21:55,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:21:55,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623695736] [2024-06-14 14:21:55,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:21:55,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:21:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:21:55,670 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-14 14:21:55,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:21:55,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623695736] [2024-06-14 14:21:55,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623695736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:21:55,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:21:55,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:21:55,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853146430] [2024-06-14 14:21:55,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:21:55,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:21:55,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:21:55,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:21:55,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:21:55,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2024-06-14 14:21:55,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 213 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-14 14:21:55,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:21:55,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2024-06-14 14:21:55,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:21:55,908 INFO L124 PetriNetUnfolderBase]: 485/960 cut-off events. [2024-06-14 14:21:55,909 INFO L125 PetriNetUnfolderBase]: For 923/923 co-relation queries the response was YES. [2024-06-14 14:21:55,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 960 events. 485/960 cut-off events. For 923/923 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4308 event pairs, 109 based on Foata normal form. 3/963 useless extension candidates. Maximal degree in co-relation 1725. Up to 514 conditions per place. [2024-06-14 14:21:55,914 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 71 selfloop transitions, 10 changer transitions 5/89 dead transitions. [2024-06-14 14:21:55,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 89 transitions, 501 flow [2024-06-14 14:21:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:21:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:21:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-14 14:21:55,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-14 14:21:55,917 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 213 flow. Second operand 7 states and 120 transitions. [2024-06-14 14:21:55,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 89 transitions, 501 flow [2024-06-14 14:21:55,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:21:55,922 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 267 flow [2024-06-14 14:21:55,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2024-06-14 14:21:55,922 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-06-14 14:21:55,923 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 267 flow [2024-06-14 14:21:55,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-14 14:21:55,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:21:55,923 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, 1] [2024-06-14 14:21:55,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:21:55,923 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-14 14:21:55,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:21:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash 434661402, now seen corresponding path program 1 times [2024-06-14 14:21:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:21:55,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311082127] [2024-06-14 14:21:55,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:21:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:21:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:21:56,876 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-14 14:21:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:21:56,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311082127] [2024-06-14 14:21:56,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311082127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:21:56,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:21:56,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:21:56,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000659582] [2024-06-14 14:21:56,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:21:56,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:21:56,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:21:56,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:21:56,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:21:56,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2024-06-14 14:21:56,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 267 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:21:56,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:21:56,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2024-06-14 14:21:56,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:21:57,234 INFO L124 PetriNetUnfolderBase]: 533/1052 cut-off events. [2024-06-14 14:21:57,234 INFO L125 PetriNetUnfolderBase]: For 1753/1753 co-relation queries the response was YES. [2024-06-14 14:21:57,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 1052 events. 533/1052 cut-off events. For 1753/1753 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4669 event pairs, 137 based on Foata normal form. 18/1070 useless extension candidates. Maximal degree in co-relation 2080. Up to 514 conditions per place. [2024-06-14 14:21:57,240 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 70 selfloop transitions, 8 changer transitions 6/87 dead transitions. [2024-06-14 14:21:57,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 87 transitions, 540 flow [2024-06-14 14:21:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:21:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:21:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-06-14 14:21:57,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2024-06-14 14:21:57,242 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 267 flow. Second operand 6 states and 112 transitions. [2024-06-14 14:21:57,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 87 transitions, 540 flow [2024-06-14 14:21:57,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 519 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 14:21:57,246 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 274 flow [2024-06-14 14:21:57,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2024-06-14 14:21:57,249 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-06-14 14:21:57,249 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 274 flow [2024-06-14 14:21:57,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:21:57,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:21:57,250 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, 1] [2024-06-14 14:21:57,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:21:57,250 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-14 14:21:57,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:21:57,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1421772022, now seen corresponding path program 1 times [2024-06-14 14:21:57,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:21:57,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293124727] [2024-06-14 14:21:57,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:21:57,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:21:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:21:58,168 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-14 14:21:58,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:21:58,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293124727] [2024-06-14 14:21:58,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293124727] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:21:58,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425241772] [2024-06-14 14:21:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:21:58,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:21:58,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:21:58,192 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-14 14:21:58,221 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-14 14:21:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:21:58,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-14 14:21:58,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:21:58,482 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-14 14:21:58,731 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 140 treesize of output 132 [2024-06-14 14:21:58,945 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-14 14:21:58,955 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 168 treesize of output 154 [2024-06-14 14:21:59,132 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 229 treesize of output 205 [2024-06-14 14:21:59,150 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-14 14:21:59,170 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-14 14:21:59,235 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-14 14:21:59,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:21:59,513 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-14 14:22:00,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:22:00,204 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-14 14:22:00,276 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-06-14 14:22:00,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2024-06-14 14:22:00,397 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-14 14:22:02,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:22:02,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1223 treesize of output 1223 [2024-06-14 14:22:02,997 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 30 treesize of output 18 [2024-06-14 14:22:06,407 INFO L349 Elim1Store]: treesize reduction 48, result has 46.1 percent of original size [2024-06-14 14:22:06,408 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 2750 treesize of output 1645 [2024-06-14 14:22:06,488 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-06-14 14:22:06,488 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 548 treesize of output 301 [2024-06-14 14:22:06,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:22:06,565 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-14 14:22:06,610 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-14 14:22:06,632 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-06-14 14:22:06,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 1536 treesize of output 909 [2024-06-14 14:22:06,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-06-14 14:22:06,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:22:06,741 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 59 treesize of output 55 [2024-06-14 14:22:06,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 398 treesize of output 230 [2024-06-14 14:22:06,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-06-14 14:22:06,889 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-14 14:22:06,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-06-14 14:22:06,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-06-14 14:22:07,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 398 treesize of output 222 [2024-06-14 14:22:07,059 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 30 treesize of output 18 [2024-06-14 14:22:07,370 INFO L349 Elim1Store]: treesize reduction 30, result has 55.2 percent of original size [2024-06-14 14:22:07,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 1970 treesize of output 1146 [2024-06-14 14:22:07,430 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 30 treesize of output 18 [2024-06-14 14:22:21,772 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-14 14:22:21,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425241772] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 14:22:21,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-14 14:22:21,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 22 [2024-06-14 14:22:21,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793055608] [2024-06-14 14:22:21,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-14 14:22:21,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-06-14 14:22:21,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:21,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-06-14 14:22:21,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2024-06-14 14:22:21,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2024-06-14 14:22:21,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 274 flow. Second operand has 24 states, 24 states have (on average 8.5) internal successors, (204), 24 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:21,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:21,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2024-06-14 14:22:21,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:30,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 14:22:35,771 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-14 14:22:39,913 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-14 14:22:56,583 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-14 14:23:00,600 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-14 14:23:02,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 14:23:07,622 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-14 14:23:12,908 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-14 14:23:16,924 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-14 14:23:21,015 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-14 14:23:21,139 INFO L124 PetriNetUnfolderBase]: 853/1648 cut-off events. [2024-06-14 14:23:21,139 INFO L125 PetriNetUnfolderBase]: For 3505/3511 co-relation queries the response was YES. [2024-06-14 14:23:21,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4945 conditions, 1648 events. 853/1648 cut-off events. For 3505/3511 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7365 event pairs, 64 based on Foata normal form. 15/1663 useless extension candidates. Maximal degree in co-relation 4269. Up to 233 conditions per place. [2024-06-14 14:23:21,150 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 127 selfloop transitions, 49 changer transitions 8/187 dead transitions. [2024-06-14 14:23:21,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 187 transitions, 1164 flow [2024-06-14 14:23:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-06-14 14:23:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-06-14 14:23:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 271 transitions. [2024-06-14 14:23:21,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3011111111111111 [2024-06-14 14:23:21,152 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 274 flow. Second operand 20 states and 271 transitions. [2024-06-14 14:23:21,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 187 transitions, 1164 flow [2024-06-14 14:23:21,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 187 transitions, 1146 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:23:21,159 INFO L231 Difference]: Finished difference. Result has 87 places, 82 transitions, 653 flow [2024-06-14 14:23:21,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=653, PETRI_PLACES=87, PETRI_TRANSITIONS=82} [2024-06-14 14:23:21,162 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2024-06-14 14:23:21,162 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 82 transitions, 653 flow [2024-06-14 14:23:21,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.5) internal successors, (204), 24 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:21,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:21,162 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, 1] [2024-06-14 14:23:21,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-14 14:23:21,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:23:21,377 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:21,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:21,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1564319742, now seen corresponding path program 1 times [2024-06-14 14:23:21,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:21,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007133500] [2024-06-14 14:23:21,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:21,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:22,577 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-14 14:23:22,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:22,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007133500] [2024-06-14 14:23:22,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007133500] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:23:22,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818132215] [2024-06-14 14:23:22,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:22,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:23:22,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:23:22,593 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-14 14:23:22,608 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-14 14:23:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:22,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 21 conjunts are in the unsatisfiable core [2024-06-14 14:23:22,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:23:22,849 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-14 14:23:23,010 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 140 treesize of output 132 [2024-06-14 14:23:23,028 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-14 14:23:23,118 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 168 treesize of output 154 [2024-06-14 14:23:23,127 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-14 14:23:23,132 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-14 14:23:23,255 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 203 treesize of output 185 [2024-06-14 14:23:23,294 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-14 14:23:23,631 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 282 treesize of output 254 [2024-06-14 14:23:23,647 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-14 14:23:23,657 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-14 14:23:23,673 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 76 treesize of output 59 [2024-06-14 14:23:23,698 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-14 14:23:23,760 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-14 14:23:23,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:23:23,961 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-14 14:23:24,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 399 treesize of output 223 [2024-06-14 14:23:25,383 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-14 14:23:26,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:23:26,021 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 294 treesize of output 190 [2024-06-14 14:23:29,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:23:29,513 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 486 treesize of output 302 [2024-06-14 14:23:29,525 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-14 14:23:29,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:23:29,623 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 7 new quantified variables, introduced 15 case distinctions, treesize of input 8851 treesize of output 5073 [2024-06-14 14:23:53,325 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-14 14:23:53,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818132215] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 14:23:53,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-14 14:23:53,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2024-06-14 14:23:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189302665] [2024-06-14 14:23:53,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-14 14:23:53,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-06-14 14:23:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:53,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-06-14 14:23:53,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=411, Unknown=2, NotChecked=0, Total=552 [2024-06-14 14:23:53,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2024-06-14 14:23:53,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 82 transitions, 653 flow. Second operand has 24 states, 24 states have (on average 8.5) internal successors, (204), 24 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:53,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:53,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2024-06-14 14:23:53,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:12,755 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-14 14:24:21,243 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-14 14:24:25,257 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-14 14:24:33,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-14 14:24:37,294 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-14 14:24:41,302 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-14 14:24:45,309 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-14 14:24:49,505 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-14 14:24:53,572 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-14 14:24:57,854 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-14 14:25:01,986 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-14 14:25:06,011 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-14 14:25:18,352 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-14 14:25:22,361 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-14 14:25:23,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 14:25:27,648 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-14 14:25:31,653 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-14 14:25:41,407 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-14 14:25:45,413 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-14 14:25:49,418 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-14 14:25:51,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 14:25:55,443 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-14 14:25:59,993 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-14 14:26:04,000 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-14 14:26:08,005 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-14 14:26:12,013 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-14 14:26:12,278 INFO L124 PetriNetUnfolderBase]: 2084/4007 cut-off events. [2024-06-14 14:26:12,279 INFO L125 PetriNetUnfolderBase]: For 20858/20864 co-relation queries the response was YES. [2024-06-14 14:26:12,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14128 conditions, 4007 events. 2084/4007 cut-off events. For 20858/20864 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 22846 event pairs, 170 based on Foata normal form. 84/4091 useless extension candidates. Maximal degree in co-relation 9486. Up to 662 conditions per place. [2024-06-14 14:26:12,305 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 229 selfloop transitions, 113 changer transitions 16/361 dead transitions. [2024-06-14 14:26:12,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 361 transitions, 2833 flow [2024-06-14 14:26:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-06-14 14:26:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-06-14 14:26:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 461 transitions. [2024-06-14 14:26:12,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2926984126984127 [2024-06-14 14:26:12,308 INFO L175 Difference]: Start difference. First operand has 87 places, 82 transitions, 653 flow. Second operand 35 states and 461 transitions. [2024-06-14 14:26:12,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 361 transitions, 2833 flow [2024-06-14 14:26:12,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 361 transitions, 2422 flow, removed 195 selfloop flow, removed 3 redundant places. [2024-06-14 14:26:12,350 INFO L231 Difference]: Finished difference. Result has 134 places, 167 transitions, 1569 flow [2024-06-14 14:26:12,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1569, PETRI_PLACES=134, PETRI_TRANSITIONS=167} [2024-06-14 14:26:12,350 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places. [2024-06-14 14:26:12,350 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 167 transitions, 1569 flow [2024-06-14 14:26:12,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.5) internal successors, (204), 24 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:12,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:12,351 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, 1] [2024-06-14 14:26:12,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-14 14:26:12,552 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,SelfDestructingSolverStorable9 [2024-06-14 14:26:12,553 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-14 14:26:12,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:12,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1161499288, now seen corresponding path program 2 times [2024-06-14 14:26:12,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:12,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955245195] [2024-06-14 14:26:12,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:12,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:13,619 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-14 14:26:13,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:13,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955245195] [2024-06-14 14:26:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955245195] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:26:13,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060894069] [2024-06-14 14:26:13,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-14 14:26:13,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:26:13,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:26:13,637 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-14 14:26:13,638 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-14 14:26:13,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-14 14:26:13,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-14 14:26:13,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 28 conjunts are in the unsatisfiable core [2024-06-14 14:26:13,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:26:13,977 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-14 14:26:14,123 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 140 treesize of output 132 [2024-06-14 14:26:14,140 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-14 14:26:14,215 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 168 treesize of output 154 [2024-06-14 14:26:14,222 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-14 14:26:14,231 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-14 14:26:14,362 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 201 treesize of output 183 [2024-06-14 14:26:14,404 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-14 14:26:14,666 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 297 treesize of output 265 [2024-06-14 14:26:14,693 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-14 14:26:14,705 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-14 14:26:14,715 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-14 14:26:14,720 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 76 treesize of output 59 [2024-06-14 14:26:14,743 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-14 14:26:14,819 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-14 14:26:14,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:26:15,070 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-14 14:26:15,584 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 30 treesize of output 18 [2024-06-14 14:26:16,441 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-14 14:26:16,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:26:16,789 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 68 treesize of output 60 [2024-06-14 14:26:16,876 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-06-14 14:26:16,877 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 219 treesize of output 127 [2024-06-14 14:26:17,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 8 treesize of output 4 [2024-06-14 14:26:17,124 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-06-14 14:26:17,124 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 46 treesize of output 26 [2024-06-14 14:26:17,198 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-06-14 14:26:17,198 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 46 treesize of output 26 [2024-06-14 14:26:24,028 INFO L349 Elim1Store]: treesize reduction 30, result has 55.2 percent of original size [2024-06-14 14:26:24,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 10980 treesize of output 6196 [2024-06-14 14:26:24,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:26:24,570 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 502 treesize of output 314 [2024-06-14 14:26:46,016 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-14 14:26:46,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060894069] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 14:26:46,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-14 14:26:46,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 19 [2024-06-14 14:26:46,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205285298] [2024-06-14 14:26:46,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-14 14:26:46,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-14 14:26:46,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:46,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-14 14:26:46,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=301, Unknown=2, NotChecked=0, Total=420 [2024-06-14 14:26:46,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2024-06-14 14:26:46,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 167 transitions, 1569 flow. Second operand has 21 states, 21 states have (on average 9.142857142857142) internal successors, (192), 21 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:46,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:46,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2024-06-14 14:26:46,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:50,861 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-14 14:26:58,172 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-14 14:27:11,668 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-14 14:27:16,229 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-14 14:27:20,239 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-14 14:27:24,247 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-14 14:27:28,256 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-14 14:27:32,553 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-14 14:27:36,560 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-14 14:27:40,567 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-14 14:27:44,799 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-14 14:27:48,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-14 14:27:53,118 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-14 14:27:54,312 INFO L124 PetriNetUnfolderBase]: 3169/6163 cut-off events. [2024-06-14 14:27:54,312 INFO L125 PetriNetUnfolderBase]: For 87011/87017 co-relation queries the response was YES. [2024-06-14 14:27:54,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19574 conditions, 6163 events. 3169/6163 cut-off events. For 87011/87017 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 37594 event pairs, 465 based on Foata normal form. 495/6658 useless extension candidates. Maximal degree in co-relation 17667. Up to 1136 conditions per place. [2024-06-14 14:27:54,365 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 266 selfloop transitions, 73 changer transitions 24/366 dead transitions. [2024-06-14 14:27:54,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 366 transitions, 3546 flow [2024-06-14 14:27:54,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-14 14:27:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-14 14:27:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 262 transitions. [2024-06-14 14:27:54,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34248366013071896 [2024-06-14 14:27:54,367 INFO L175 Difference]: Start difference. First operand has 134 places, 167 transitions, 1569 flow. Second operand 17 states and 262 transitions. [2024-06-14 14:27:54,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 366 transitions, 3546 flow [2024-06-14 14:27:54,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 366 transitions, 3352 flow, removed 84 selfloop flow, removed 3 redundant places. [2024-06-14 14:27:54,437 INFO L231 Difference]: Finished difference. Result has 155 places, 201 transitions, 2059 flow [2024-06-14 14:27:54,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2059, PETRI_PLACES=155, PETRI_TRANSITIONS=201} [2024-06-14 14:27:54,438 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places. [2024-06-14 14:27:54,438 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 201 transitions, 2059 flow [2024-06-14 14:27:54,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.142857142857142) internal successors, (192), 21 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:54,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:54,439 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:54,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-14 14:27:54,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:27:54,640 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-14 14:27:54,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash 54545710, now seen corresponding path program 1 times [2024-06-14 14:27:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:54,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967038238] [2024-06-14 14:27:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:54,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-14 14:27:58,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:58,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967038238] [2024-06-14 14:27:58,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967038238] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 14:27:58,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071726178] [2024-06-14 14:27:58,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:58,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 14:27:58,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:27:58,824 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-14 14:27:58,826 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-14 14:27:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:59,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 44 conjunts are in the unsatisfiable core [2024-06-14 14:27:59,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 14:27:59,161 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-14 14:27:59,376 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 106 treesize of output 98 [2024-06-14 14:27:59,477 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-14 14:27:59,487 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-14 14:27:59,492 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-14 14:27:59,626 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 101 treesize of output 95 [2024-06-14 14:27:59,635 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-14 14:28:00,571 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 147 treesize of output 129 [2024-06-14 14:28:00,597 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-14 14:28:00,601 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 21 treesize of output 9 [2024-06-14 14:28:00,794 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 220 treesize of output 188 [2024-06-14 14:28:00,814 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 154 treesize of output 122 [2024-06-14 14:28:01,184 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 257 treesize of output 223 [2024-06-14 14:28:01,205 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-14 14:28:01,214 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-14 14:28:01,234 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-14 14:28:01,263 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-14 14:28:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-06-14 14:28:01,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 14:28:01,648 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-14 14:28:03,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:28:03,306 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-14 14:28:03,659 INFO L349 Elim1Store]: treesize reduction 10, result has 67.7 percent of original size [2024-06-14 14:28:03,659 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 205 [2024-06-14 14:28:03,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:28:03,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2024-06-14 14:28:26,537 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 30 treesize of output 18 [2024-06-14 14:28:26,694 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-14 14:28:26,756 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-14 14:28:26,833 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2024-06-14 14:28:26,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 586 treesize of output 1 [2024-06-14 14:28:34,209 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 30 treesize of output 18 [2024-06-14 14:28:34,298 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-14 14:28:34,315 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-14 14:28:41,721 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-14 14:28:43,539 INFO L349 Elim1Store]: treesize reduction 8, result has 94.2 percent of original size [2024-06-14 14:28:43,540 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 151845 treesize of output 88887 [2024-06-14 14:29:51,543 INFO L349 Elim1Store]: treesize reduction 8, result has 99.2 percent of original size [2024-06-14 14:29:51,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 18 new quantified variables, introduced 120 case distinctions, treesize of input 169329 treesize of output 124048 [2024-06-14 14:30:06,300 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-14 14:30:06,600 INFO L349 Elim1Store]: treesize reduction 8, result has 94.2 percent of original size [2024-06-14 14:30:06,601 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 61018 treesize of output 34123 [2024-06-14 14:31:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 49 refuted. 3 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-14 14:31:07,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071726178] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 14:31:07,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-14 14:31:07,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 34 [2024-06-14 14:31:07,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120562485] [2024-06-14 14:31:07,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-14 14:31:07,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-06-14 14:31:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:07,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-06-14 14:31:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=958, Unknown=3, NotChecked=0, Total=1260 [2024-06-14 14:31:07,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2024-06-14 14:31:07,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 201 transitions, 2059 flow. Second operand has 36 states, 36 states have (on average 8.555555555555555) internal successors, (308), 36 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:07,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:07,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2024-06-14 14:31:07,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:14,160 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-14 14:31:18,288 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-14 14:31:22,370 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-14 14:31:28,962 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-14 14:31:57,373 WARN L293 SmtUtils]: Spent 10.13s on a formula simplification. DAG size of input: 1605 DAG size of output: 1601 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-14 14:32:28,077 WARN L293 SmtUtils]: Spent 6.78s on a formula simplification. DAG size of input: 1573 DAG size of output: 1432 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-14 14:32:47,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 14:32:49,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 14:33:13,223 WARN L293 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 1624 DAG size of output: 992 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-14 14:33:16,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 14:33:17,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 14:33:21,820 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-14 14:33:25,838 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-14 14:33:30,638 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-14 14:34:04,505 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-14 14:34:08,843 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-14 14:34:13,590 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-14 14:34:39,697 WARN L293 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 1556 DAG size of output: 1416 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-14 14:34:43,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 14:35:17,090 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-14 14:35:21,112 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-14 14:35:25,932 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-14 14:35:27,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 14:35:33,412 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-14 14:35:38,311 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-14 14:35:43,864 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-14 14:35:47,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 14:35:52,466 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-14 14:35:55,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15