./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue_longer.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/queue_longer.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/queue_longer.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 21:59:04,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 21:59:04,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 21:59:04,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 21:59:04,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 21:59:04,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 21:59:04,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 21:59:04,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 21:59:04,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 21:59:04,919 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 21:59:04,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 21:59:04,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 21:59:04,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 21:59:04,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 21:59:04,920 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 21:59:04,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 21:59:04,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 21:59:04,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 21:59:04,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 21:59:04,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 21:59:04,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 21:59:04,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 21:59:04,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 21:59:04,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 21:59:04,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 21:59:04,924 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 21:59:04,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 21:59:04,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 21:59:04,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 21:59:04,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 21:59:04,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 21:59:04,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 21:59:04,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 21:59:04,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 21:59:04,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 21:59:04,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 21:59:04,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 21:59:04,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 21:59:04,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 21:59:04,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 21:59:04,928 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 21:59:04,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 21:59:04,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 21:59:04,929 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 21:59:05,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 21:59:05,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 21:59:05,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 21:59:05,133 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 21:59:05,134 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 21:59:05,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/queue_longer.yml/witness.yml [2024-06-27 21:59:05,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 21:59:05,247 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 21:59:05,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2024-06-27 21:59:06,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 21:59:06,394 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 21:59:06,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2024-06-27 21:59:06,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d8ebf23/14698b76665e4c2ebecdc17e76463e3e/FLAG5a4561328 [2024-06-27 21:59:06,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d8ebf23/14698b76665e4c2ebecdc17e76463e3e [2024-06-27 21:59:06,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 21:59:06,440 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 21:59:06,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 21:59:06,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 21:59:06,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 21:59:06,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 09:59:05" (1/2) ... [2024-06-27 21:59:06,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550d7431 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:06, skipping insertion in model container [2024-06-27 21:59:06,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 09:59:05" (1/2) ... [2024-06-27 21:59:06,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1b594c44 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:06, skipping insertion in model container [2024-06-27 21:59:06,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 09:59:06" (2/2) ... [2024-06-27 21:59:06,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550d7431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:06, skipping insertion in model container [2024-06-27 21:59:06,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 09:59:06" (2/2) ... [2024-06-27 21:59:06,475 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 21:59:06,506 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 21:59:06,507 INFO L97 edCorrectnessWitness]: Location invariant before [L1063-L1063] ! multithreaded || (m_locked || ((-1LL + (long long )dequeue_flag) + (long long )enqueue_flag >= 0LL && (1LL - (long long )dequeue_flag) - (long long )enqueue_flag >= 0LL)) [2024-06-27 21:59:06,507 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)) [2024-06-27 21:59:06,507 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-27 21:59:06,508 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 21:59:06,508 INFO L106 edCorrectnessWitness]: ghost_update [L1008-L1008] m_locked = 1; [2024-06-27 21:59:06,508 INFO L106 edCorrectnessWitness]: ghost_update [L1029-L1029] m_locked = 0; [2024-06-27 21:59:06,509 INFO L106 edCorrectnessWitness]: ghost_update [L1062-L1062] multithreaded = 1; [2024-06-27 21:59:06,509 INFO L106 edCorrectnessWitness]: ghost_update [L1020-L1020] m_locked = 1; [2024-06-27 21:59:06,509 INFO L106 edCorrectnessWitness]: ghost_update [L1017-L1017] m_locked = 0; [2024-06-27 21:59:06,509 INFO L106 edCorrectnessWitness]: ghost_update [L1039-L1039] m_locked = 1; [2024-06-27 21:59:06,509 INFO L106 edCorrectnessWitness]: ghost_update [L1048-L1048] m_locked = 0; [2024-06-27 21:59:06,552 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 21:59:06,950 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-06-27 21:59:06,957 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-06-27 21:59:06,962 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-06-27 21:59:06,969 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 21:59:06,980 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 21:59:07,066 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] Start Parsing Local [2024-06-27 21:59:07,069 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] Start Parsing Local [2024-06-27 21:59:07,071 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 21:59:07,080 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 21:59:07,119 INFO L206 MainTranslator]: Completed translation [2024-06-27 21:59:07,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07 WrapperNode [2024-06-27 21:59:07,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 21:59:07,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 21:59:07,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 21:59:07,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 21:59:07,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,188 INFO L138 Inliner]: procedures = 274, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251 [2024-06-27 21:59:07,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 21:59:07,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 21:59:07,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 21:59:07,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 21:59:07,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,216 INFO L175 MemorySlicer]: Split 43 memory accesses to 4 slices as follows [2, 5, 4, 32]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 18 writes are split as follows [0, 0, 3, 15]. [2024-06-27 21:59:07,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 21:59:07,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 21:59:07,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 21:59:07,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 21:59:07,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 21:59:07,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:07,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 21:59:07,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 21:59:07,299 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-27 21:59:07,299 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-27 21:59:07,299 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-27 21:59:07,299 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-27 21:59:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 21:59:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 21:59:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 21:59:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 21:59:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-27 21:59:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 21:59:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 21:59:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 21:59:07,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-27 21:59:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 21:59:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 21:59:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 21:59:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 21:59:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 21:59:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-27 21:59:07,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 21:59:07,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 21:59:07,302 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 21:59:07,407 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 21:59:07,409 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 21:59:07,728 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 21:59:07,728 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 21:59:08,007 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 21:59:08,007 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 21:59:08,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 09:59:08 BoogieIcfgContainer [2024-06-27 21:59:08,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 21:59:08,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 21:59:08,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 21:59:08,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 21:59:08,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 09:59:05" (1/4) ... [2024-06-27 21:59:08,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2848b3ec and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 09:59:08, skipping insertion in model container [2024-06-27 21:59:08,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 09:59:06" (2/4) ... [2024-06-27 21:59:08,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2848b3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 09:59:08, skipping insertion in model container [2024-06-27 21:59:08,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:07" (3/4) ... [2024-06-27 21:59:08,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2848b3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 09:59:08, skipping insertion in model container [2024-06-27 21:59:08,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 09:59:08" (4/4) ... [2024-06-27 21:59:08,017 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-06-27 21:59:08,030 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 21:59:08,031 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 21:59:08,031 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 21:59:08,082 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 21:59:08,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 52 transitions, 118 flow [2024-06-27 21:59:08,137 INFO L124 PetriNetUnfolderBase]: 7/50 cut-off events. [2024-06-27 21:59:08,138 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 21:59:08,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 50 events. 7/50 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-06-27 21:59:08,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 52 transitions, 118 flow [2024-06-27 21:59:08,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 48 transitions, 105 flow [2024-06-27 21:59:08,149 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 21:59:08,153 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;@1c159c5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 21:59:08,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 21:59:08,155 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 21:59:08,156 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-06-27 21:59:08,156 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 21:59:08,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:08,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-27 21:59:08,157 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:08,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:08,160 INFO L85 PathProgramCache]: Analyzing trace with hash 646947, now seen corresponding path program 1 times [2024-06-27 21:59:08,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:08,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894932396] [2024-06-27 21:59:08,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:08,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:08,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:08,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894932396] [2024-06-27 21:59:08,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894932396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:08,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:08,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 21:59:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294997962] [2024-06-27 21:59:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:08,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 21:59:08,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:08,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 21:59:08,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 21:59:08,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 21:59:08,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 105 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:08,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:08,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 21:59:08,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:08,474 INFO L124 PetriNetUnfolderBase]: 439/840 cut-off events. [2024-06-27 21:59:08,475 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-06-27 21:59:08,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 840 events. 439/840 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4107 event pairs, 343 based on Foata normal form. 48/777 useless extension candidates. Maximal degree in co-relation 1538. Up to 721 conditions per place. [2024-06-27 21:59:08,485 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 32 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2024-06-27 21:59:08,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 159 flow [2024-06-27 21:59:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 21:59:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 21:59:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2024-06-27 21:59:08,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2024-06-27 21:59:08,496 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 105 flow. Second operand 2 states and 63 transitions. [2024-06-27 21:59:08,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 159 flow [2024-06-27 21:59:08,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:08,504 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 90 flow [2024-06-27 21:59:08,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2024-06-27 21:59:08,508 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2024-06-27 21:59:08,508 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 90 flow [2024-06-27 21:59:08,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:08,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:08,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:08,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 21:59:08,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:08,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 504170151, now seen corresponding path program 1 times [2024-06-27 21:59:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:08,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546208397] [2024-06-27 21:59:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:08,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:08,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546208397] [2024-06-27 21:59:08,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546208397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:08,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:08,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 21:59:08,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805583748] [2024-06-27 21:59:08,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:08,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:08,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:08,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:08,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:08,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 21:59:08,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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-27 21:59:08,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:08,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 21:59:08,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:08,895 INFO L124 PetriNetUnfolderBase]: 552/1056 cut-off events. [2024-06-27 21:59:08,895 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-06-27 21:59:08,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 1056 events. 552/1056 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4913 event pairs, 272 based on Foata normal form. 94/1088 useless extension candidates. Maximal degree in co-relation 1999. Up to 472 conditions per place. [2024-06-27 21:59:08,901 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 45 selfloop transitions, 3 changer transitions 1/58 dead transitions. [2024-06-27 21:59:08,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 221 flow [2024-06-27 21:59:08,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-06-27 21:59:08,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2024-06-27 21:59:08,903 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 90 flow. Second operand 3 states and 88 transitions. [2024-06-27 21:59:08,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 221 flow [2024-06-27 21:59:08,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 221 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 21:59:08,904 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 109 flow [2024-06-27 21:59:08,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-06-27 21:59:08,905 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-06-27 21:59:08,905 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 109 flow [2024-06-27 21:59:08,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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-27 21:59:08,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:08,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:08,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 21:59:08,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:08,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:08,906 INFO L85 PathProgramCache]: Analyzing trace with hash 264572176, now seen corresponding path program 1 times [2024-06-27 21:59:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:08,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520528893] [2024-06-27 21:59:08,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:08,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:09,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:09,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520528893] [2024-06-27 21:59:09,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520528893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:09,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:09,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 21:59:09,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595936155] [2024-06-27 21:59:09,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:09,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:09,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:09,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:09,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:09,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 21:59:09,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:09,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:09,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 21:59:09,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:09,111 INFO L124 PetriNetUnfolderBase]: 466/937 cut-off events. [2024-06-27 21:59:09,112 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-06-27 21:59:09,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 937 events. 466/937 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4439 event pairs, 344 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1876. Up to 754 conditions per place. [2024-06-27 21:59:09,116 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 39 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-06-27 21:59:09,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 209 flow [2024-06-27 21:59:09,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-06-27 21:59:09,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532051282051282 [2024-06-27 21:59:09,117 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 109 flow. Second operand 3 states and 83 transitions. [2024-06-27 21:59:09,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 209 flow [2024-06-27 21:59:09,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 21:59:09,119 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 108 flow [2024-06-27 21:59:09,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-06-27 21:59:09,120 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2024-06-27 21:59:09,120 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 108 flow [2024-06-27 21:59:09,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:09,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:09,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:09,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 21:59:09,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:09,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:09,121 INFO L85 PathProgramCache]: Analyzing trace with hash -388195476, now seen corresponding path program 1 times [2024-06-27 21:59:09,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:09,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461998720] [2024-06-27 21:59:09,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:09,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461998720] [2024-06-27 21:59:09,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461998720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:09,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:09,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 21:59:09,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228287699] [2024-06-27 21:59:09,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:09,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 21:59:09,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:09,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 21:59:09,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 21:59:09,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 21:59:09,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:09,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:09,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 21:59:09,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:09,576 INFO L124 PetriNetUnfolderBase]: 488/968 cut-off events. [2024-06-27 21:59:09,576 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-06-27 21:59:09,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 968 events. 488/968 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4562 event pairs, 139 based on Foata normal form. 0/932 useless extension candidates. Maximal degree in co-relation 1949. Up to 504 conditions per place. [2024-06-27 21:59:09,580 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 55 selfloop transitions, 5 changer transitions 2/72 dead transitions. [2024-06-27 21:59:09,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 299 flow [2024-06-27 21:59:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 21:59:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 21:59:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-06-27 21:59:09,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2024-06-27 21:59:09,585 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 108 flow. Second operand 5 states and 132 transitions. [2024-06-27 21:59:09,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 299 flow [2024-06-27 21:59:09,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:09,586 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 120 flow [2024-06-27 21:59:09,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-06-27 21:59:09,587 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2024-06-27 21:59:09,588 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 120 flow [2024-06-27 21:59:09,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:09,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:09,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:09,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 21:59:09,588 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:09,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1368784160, now seen corresponding path program 1 times [2024-06-27 21:59:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:09,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312649071] [2024-06-27 21:59:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:09,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:09,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312649071] [2024-06-27 21:59:09,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312649071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:09,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:09,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 21:59:09,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602201615] [2024-06-27 21:59:09,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:09,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 21:59:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:09,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 21:59:09,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 21:59:09,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 21:59:09,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:09,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:09,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 21:59:09,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:09,841 INFO L124 PetriNetUnfolderBase]: 714/1441 cut-off events. [2024-06-27 21:59:09,841 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2024-06-27 21:59:09,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2996 conditions, 1441 events. 714/1441 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7611 event pairs, 258 based on Foata normal form. 32/1442 useless extension candidates. Maximal degree in co-relation 2990. Up to 681 conditions per place. [2024-06-27 21:59:09,848 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 55 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2024-06-27 21:59:09,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 329 flow [2024-06-27 21:59:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 21:59:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 21:59:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-27 21:59:09,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2024-06-27 21:59:09,850 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 120 flow. Second operand 5 states and 116 transitions. [2024-06-27 21:59:09,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 329 flow [2024-06-27 21:59:09,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 319 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:09,854 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 171 flow [2024-06-27 21:59:09,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-06-27 21:59:09,856 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2024-06-27 21:59:09,856 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 171 flow [2024-06-27 21:59:09,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:09,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:09,857 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-27 21:59:09,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 21:59:09,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:09,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:09,858 INFO L85 PathProgramCache]: Analyzing trace with hash 517366238, now seen corresponding path program 1 times [2024-06-27 21:59:09,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:09,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029533561] [2024-06-27 21:59:09,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:09,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:10,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:10,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029533561] [2024-06-27 21:59:10,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029533561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:10,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:10,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 21:59:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354865040] [2024-06-27 21:59:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:10,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 21:59:10,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:10,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 21:59:10,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 21:59:10,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 21:59:10,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:10,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:10,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 21:59:10,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:10,232 INFO L124 PetriNetUnfolderBase]: 608/1202 cut-off events. [2024-06-27 21:59:10,232 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2024-06-27 21:59:10,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2911 conditions, 1202 events. 608/1202 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5894 event pairs, 311 based on Foata normal form. 54/1227 useless extension candidates. Maximal degree in co-relation 2903. Up to 650 conditions per place. [2024-06-27 21:59:10,237 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 49 selfloop transitions, 4 changer transitions 4/64 dead transitions. [2024-06-27 21:59:10,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 336 flow [2024-06-27 21:59:10,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 21:59:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 21:59:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-06-27 21:59:10,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44711538461538464 [2024-06-27 21:59:10,238 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 171 flow. Second operand 4 states and 93 transitions. [2024-06-27 21:59:10,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 336 flow [2024-06-27 21:59:10,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:10,240 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 167 flow [2024-06-27 21:59:10,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2024-06-27 21:59:10,240 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2024-06-27 21:59:10,241 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 167 flow [2024-06-27 21:59:10,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:10,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:10,241 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-27 21:59:10,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 21:59:10,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:10,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1815256343, now seen corresponding path program 1 times [2024-06-27 21:59:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:10,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899099123] [2024-06-27 21:59:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:10,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899099123] [2024-06-27 21:59:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899099123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:10,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:10,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 21:59:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077282434] [2024-06-27 21:59:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:10,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:10,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:10,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:10,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 21:59:10,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:10,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:10,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 21:59:10,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:10,437 INFO L124 PetriNetUnfolderBase]: 257/574 cut-off events. [2024-06-27 21:59:10,437 INFO L125 PetriNetUnfolderBase]: For 337/340 co-relation queries the response was YES. [2024-06-27 21:59:10,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 574 events. 257/574 cut-off events. For 337/340 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2367 event pairs, 85 based on Foata normal form. 34/598 useless extension candidates. Maximal degree in co-relation 1378. Up to 267 conditions per place. [2024-06-27 21:59:10,440 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 36 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2024-06-27 21:59:10,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 252 flow [2024-06-27 21:59:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-27 21:59:10,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2024-06-27 21:59:10,441 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 167 flow. Second operand 3 states and 85 transitions. [2024-06-27 21:59:10,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 252 flow [2024-06-27 21:59:10,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 225 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 21:59:10,443 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 128 flow [2024-06-27 21:59:10,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2024-06-27 21:59:10,445 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-06-27 21:59:10,445 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 128 flow [2024-06-27 21:59:10,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:10,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:10,445 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-27 21:59:10,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 21:59:10,446 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:10,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:10,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1496571921, now seen corresponding path program 1 times [2024-06-27 21:59:10,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:10,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936482977] [2024-06-27 21:59:10,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:10,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:11,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:11,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936482977] [2024-06-27 21:59:11,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936482977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:11,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:11,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 21:59:11,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914806847] [2024-06-27 21:59:11,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:11,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 21:59:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:11,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 21:59:11,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 21:59:11,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2024-06-27 21:59:11,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 128 flow. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:11,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:11,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2024-06-27 21:59:11,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:12,058 INFO L124 PetriNetUnfolderBase]: 568/1183 cut-off events. [2024-06-27 21:59:12,058 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2024-06-27 21:59:12,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1183 events. 568/1183 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6054 event pairs, 93 based on Foata normal form. 0/1171 useless extension candidates. Maximal degree in co-relation 2669. Up to 394 conditions per place. [2024-06-27 21:59:12,064 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 83 selfloop transitions, 24 changer transitions 8/121 dead transitions. [2024-06-27 21:59:12,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 121 transitions, 607 flow [2024-06-27 21:59:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 21:59:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 21:59:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 255 transitions. [2024-06-27 21:59:12,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35027472527472525 [2024-06-27 21:59:12,066 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 128 flow. Second operand 14 states and 255 transitions. [2024-06-27 21:59:12,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 121 transitions, 607 flow [2024-06-27 21:59:12,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 121 transitions, 559 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:12,069 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 292 flow [2024-06-27 21:59:12,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=292, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-06-27 21:59:12,069 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2024-06-27 21:59:12,069 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 292 flow [2024-06-27 21:59:12,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:12,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:12,070 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-27 21:59:12,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 21:59:12,070 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:12,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:12,070 INFO L85 PathProgramCache]: Analyzing trace with hash -914976723, now seen corresponding path program 2 times [2024-06-27 21:59:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:12,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023947992] [2024-06-27 21:59:12,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:12,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:12,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023947992] [2024-06-27 21:59:12,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023947992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:12,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:12,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 21:59:12,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128666272] [2024-06-27 21:59:12,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:12,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 21:59:12,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:12,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 21:59:12,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 21:59:12,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 21:59:12,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 292 flow. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:12,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:12,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 21:59:12,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:13,218 INFO L124 PetriNetUnfolderBase]: 437/995 cut-off events. [2024-06-27 21:59:13,218 INFO L125 PetriNetUnfolderBase]: For 1228/1228 co-relation queries the response was YES. [2024-06-27 21:59:13,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2823 conditions, 995 events. 437/995 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5329 event pairs, 103 based on Foata normal form. 0/986 useless extension candidates. Maximal degree in co-relation 2806. Up to 352 conditions per place. [2024-06-27 21:59:13,223 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 76 selfloop transitions, 21 changer transitions 8/113 dead transitions. [2024-06-27 21:59:13,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 742 flow [2024-06-27 21:59:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 21:59:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 21:59:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2024-06-27 21:59:13,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519230769230769 [2024-06-27 21:59:13,224 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 292 flow. Second operand 10 states and 235 transitions. [2024-06-27 21:59:13,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 742 flow [2024-06-27 21:59:13,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 113 transitions, 725 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:13,229 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 430 flow [2024-06-27 21:59:13,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=430, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-06-27 21:59:13,230 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 32 predicate places. [2024-06-27 21:59:13,230 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 430 flow [2024-06-27 21:59:13,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:13,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:13,230 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-27 21:59:13,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 21:59:13,231 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:13,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1774375265, now seen corresponding path program 3 times [2024-06-27 21:59:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:13,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818402358] [2024-06-27 21:59:13,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:13,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:13,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:13,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818402358] [2024-06-27 21:59:13,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818402358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:13,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:13,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 21:59:13,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895645546] [2024-06-27 21:59:13,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:13,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 21:59:13,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:13,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 21:59:13,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 21:59:13,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 21:59:13,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 430 flow. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:13,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:13,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 21:59:13,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:14,230 INFO L124 PetriNetUnfolderBase]: 494/1119 cut-off events. [2024-06-27 21:59:14,230 INFO L125 PetriNetUnfolderBase]: For 2847/2847 co-relation queries the response was YES. [2024-06-27 21:59:14,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3607 conditions, 1119 events. 494/1119 cut-off events. For 2847/2847 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6224 event pairs, 98 based on Foata normal form. 0/1108 useless extension candidates. Maximal degree in co-relation 3584. Up to 428 conditions per place. [2024-06-27 21:59:14,237 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 85 selfloop transitions, 20 changer transitions 5/118 dead transitions. [2024-06-27 21:59:14,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 118 transitions, 917 flow [2024-06-27 21:59:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 21:59:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 21:59:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2024-06-27 21:59:14,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051 [2024-06-27 21:59:14,239 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 430 flow. Second operand 9 states and 213 transitions. [2024-06-27 21:59:14,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 118 transitions, 917 flow [2024-06-27 21:59:14,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 118 transitions, 877 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:14,247 INFO L231 Difference]: Finished difference. Result has 89 places, 74 transitions, 528 flow [2024-06-27 21:59:14,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=528, PETRI_PLACES=89, PETRI_TRANSITIONS=74} [2024-06-27 21:59:14,248 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 41 predicate places. [2024-06-27 21:59:14,248 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 74 transitions, 528 flow [2024-06-27 21:59:14,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:14,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:14,249 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-27 21:59:14,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 21:59:14,249 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:14,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1787094793, now seen corresponding path program 4 times [2024-06-27 21:59:14,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:14,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564978855] [2024-06-27 21:59:14,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:14,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:15,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:15,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564978855] [2024-06-27 21:59:15,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564978855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:15,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:15,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 21:59:15,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006728493] [2024-06-27 21:59:15,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:15,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 21:59:15,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:15,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 21:59:15,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 21:59:15,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2024-06-27 21:59:15,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 74 transitions, 528 flow. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:15,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:15,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2024-06-27 21:59:15,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:15,748 INFO L124 PetriNetUnfolderBase]: 952/2013 cut-off events. [2024-06-27 21:59:15,748 INFO L125 PetriNetUnfolderBase]: For 6350/6350 co-relation queries the response was YES. [2024-06-27 21:59:15,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6678 conditions, 2013 events. 952/2013 cut-off events. For 6350/6350 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12204 event pairs, 53 based on Foata normal form. 0/2003 useless extension candidates. Maximal degree in co-relation 6651. Up to 494 conditions per place. [2024-06-27 21:59:15,759 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 115 selfloop transitions, 48 changer transitions 6/175 dead transitions. [2024-06-27 21:59:15,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 175 transitions, 1358 flow [2024-06-27 21:59:15,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 21:59:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 21:59:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 307 transitions. [2024-06-27 21:59:15,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36899038461538464 [2024-06-27 21:59:15,762 INFO L175 Difference]: Start difference. First operand has 89 places, 74 transitions, 528 flow. Second operand 16 states and 307 transitions. [2024-06-27 21:59:15,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 175 transitions, 1358 flow [2024-06-27 21:59:15,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 175 transitions, 1289 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 21:59:15,778 INFO L231 Difference]: Finished difference. Result has 103 places, 89 transitions, 745 flow [2024-06-27 21:59:15,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=745, PETRI_PLACES=103, PETRI_TRANSITIONS=89} [2024-06-27 21:59:15,779 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 55 predicate places. [2024-06-27 21:59:15,779 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 745 flow [2024-06-27 21:59:15,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:15,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:15,780 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-27 21:59:15,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 21:59:15,780 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:15,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:15,781 INFO L85 PathProgramCache]: Analyzing trace with hash -43932023, now seen corresponding path program 5 times [2024-06-27 21:59:15,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:15,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922814075] [2024-06-27 21:59:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:15,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:16,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922814075] [2024-06-27 21:59:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922814075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:16,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:16,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 21:59:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119049742] [2024-06-27 21:59:16,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:16,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 21:59:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:16,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 21:59:16,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 21:59:16,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 21:59:16,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 745 flow. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:16,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:16,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 21:59:16,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:16,839 INFO L124 PetriNetUnfolderBase]: 691/1576 cut-off events. [2024-06-27 21:59:16,839 INFO L125 PetriNetUnfolderBase]: For 7058/7058 co-relation queries the response was YES. [2024-06-27 21:59:16,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5683 conditions, 1576 events. 691/1576 cut-off events. For 7058/7058 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9701 event pairs, 355 based on Foata normal form. 0/1565 useless extension candidates. Maximal degree in co-relation 5652. Up to 1048 conditions per place. [2024-06-27 21:59:16,848 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 98 selfloop transitions, 18 changer transitions 4/128 dead transitions. [2024-06-27 21:59:16,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 128 transitions, 1243 flow [2024-06-27 21:59:16,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 21:59:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 21:59:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2024-06-27 21:59:16,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2024-06-27 21:59:16,849 INFO L175 Difference]: Start difference. First operand has 103 places, 89 transitions, 745 flow. Second operand 9 states and 204 transitions. [2024-06-27 21:59:16,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 128 transitions, 1243 flow [2024-06-27 21:59:16,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 128 transitions, 1096 flow, removed 41 selfloop flow, removed 8 redundant places. [2024-06-27 21:59:16,861 INFO L231 Difference]: Finished difference. Result has 108 places, 100 transitions, 834 flow [2024-06-27 21:59:16,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=834, PETRI_PLACES=108, PETRI_TRANSITIONS=100} [2024-06-27 21:59:16,863 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 60 predicate places. [2024-06-27 21:59:16,863 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 100 transitions, 834 flow [2024-06-27 21:59:16,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:16,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:16,863 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:16,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 21:59:16,864 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:16,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:16,864 INFO L85 PathProgramCache]: Analyzing trace with hash -555452417, now seen corresponding path program 1 times [2024-06-27 21:59:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:16,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755120804] [2024-06-27 21:59:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:16,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:17,715 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-27 21:59:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755120804] [2024-06-27 21:59:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755120804] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448619787] [2024-06-27 21:59:17,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:17,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:17,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:17,718 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-27 21:59:17,748 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-27 21:59:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:17,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 44 conjunts are in the unsatisfiable core [2024-06-27 21:59:17,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:17,950 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-27 21:59:18,122 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 149 treesize of output 131 [2024-06-27 21:59:18,129 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 27 treesize of output 16 [2024-06-27 21:59:18,163 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 11 treesize of output 7 [2024-06-27 21:59:18,329 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 94 treesize of output 92 [2024-06-27 21:59:18,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2024-06-27 21:59:18,349 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-27 21:59:18,591 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 45 treesize of output 37 [2024-06-27 21:59:18,594 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 47 treesize of output 35 [2024-06-27 21:59:18,614 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-27 21:59:18,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:18,884 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 58 treesize of output 46 [2024-06-27 21:59:19,340 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 21:59:19,341 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 14 treesize of output 18 [2024-06-27 21:59:19,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:19,401 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 13 treesize of output 22 [2024-06-27 21:59:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:22,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448619787] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:22,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:22,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-06-27 21:59:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000367179] [2024-06-27 21:59:22,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:22,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-06-27 21:59:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:22,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-06-27 21:59:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2024-06-27 21:59:22,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52 [2024-06-27 21:59:22,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 100 transitions, 834 flow. Second operand has 32 states, 32 states have (on average 11.40625) internal successors, (365), 32 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:22,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:22,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52 [2024-06-27 21:59:22,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:24,428 INFO L124 PetriNetUnfolderBase]: 1195/2467 cut-off events. [2024-06-27 21:59:24,429 INFO L125 PetriNetUnfolderBase]: For 11343/11343 co-relation queries the response was YES. [2024-06-27 21:59:24,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8770 conditions, 2467 events. 1195/2467 cut-off events. For 11343/11343 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14934 event pairs, 47 based on Foata normal form. 54/2509 useless extension candidates. Maximal degree in co-relation 8736. Up to 382 conditions per place. [2024-06-27 21:59:24,453 INFO L140 encePairwiseOnDemand]: 34/52 looper letters, 137 selfloop transitions, 69 changer transitions 6/217 dead transitions. [2024-06-27 21:59:24,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 217 transitions, 1948 flow [2024-06-27 21:59:24,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 21:59:24,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 21:59:24,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 302 transitions. [2024-06-27 21:59:24,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629807692307692 [2024-06-27 21:59:24,455 INFO L175 Difference]: Start difference. First operand has 108 places, 100 transitions, 834 flow. Second operand 16 states and 302 transitions. [2024-06-27 21:59:24,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 217 transitions, 1948 flow [2024-06-27 21:59:24,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 217 transitions, 1745 flow, removed 94 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:24,484 INFO L231 Difference]: Finished difference. Result has 126 places, 122 transitions, 1136 flow [2024-06-27 21:59:24,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1136, PETRI_PLACES=126, PETRI_TRANSITIONS=122} [2024-06-27 21:59:24,485 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 78 predicate places. [2024-06-27 21:59:24,485 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 122 transitions, 1136 flow [2024-06-27 21:59:24,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.40625) internal successors, (365), 32 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:24,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:24,486 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:24,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 21:59:24,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-06-27 21:59:24,700 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:24,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1479584115, now seen corresponding path program 2 times [2024-06-27 21:59:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:24,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919761721] [2024-06-27 21:59:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:25,632 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-27 21:59:25,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919761721] [2024-06-27 21:59:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919761721] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226424084] [2024-06-27 21:59:25,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 21:59:25,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:25,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:25,634 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-27 21:59:25,634 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-27 21:59:25,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 21:59:25,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 21:59:25,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjunts are in the unsatisfiable core [2024-06-27 21:59:25,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:25,832 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-27 21:59:25,956 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 155 treesize of output 145 [2024-06-27 21:59:26,043 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 11 treesize of output 7 [2024-06-27 21:59:26,214 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 120 treesize of output 118 [2024-06-27 21:59:26,218 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-27 21:59:26,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 21:59:26,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2024-06-27 21:59:26,423 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 59 treesize of output 51 [2024-06-27 21:59:26,425 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 65 treesize of output 53 [2024-06-27 21:59:26,442 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-27 21:59:26,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:26,591 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 58 treesize of output 46 [2024-06-27 21:59:26,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:26,974 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 13 treesize of output 22 [2024-06-27 21:59:26,987 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 21:59:26,988 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 14 treesize of output 18 [2024-06-27 21:59:27,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:27,918 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 126 treesize of output 114 [2024-06-27 21:59:27,931 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 19 treesize of output 17 [2024-06-27 21:59:27,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:27,941 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 126 treesize of output 114 [2024-06-27 21:59:27,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:27,956 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 60 treesize of output 54 [2024-06-27 21:59:27,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:27,973 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 60 treesize of output 54 [2024-06-27 21:59:27,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:27,991 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 60 treesize of output 54 [2024-06-27 21:59:28,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:28,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2024-06-27 21:59:28,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:28,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2024-06-27 21:59:28,047 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 15 treesize of output 13 [2024-06-27 21:59:28,049 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 24 treesize of output 18 [2024-06-27 21:59:28,058 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 15 treesize of output 13 [2024-06-27 21:59:28,061 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 24 treesize of output 18 [2024-06-27 21:59:28,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:28,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 5213 treesize of output 3076 [2024-06-27 21:59:28,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:28,903 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 13 treesize of output 22 [2024-06-27 21:59:28,918 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 21:59:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226424084] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:29,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:29,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-06-27 21:59:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562787164] [2024-06-27 21:59:29,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:29,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-06-27 21:59:29,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:29,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-06-27 21:59:29,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2024-06-27 21:59:30,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52 [2024-06-27 21:59:30,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 122 transitions, 1136 flow. Second operand has 32 states, 32 states have (on average 11.40625) internal successors, (365), 32 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:30,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:30,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52 [2024-06-27 21:59:30,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:32,268 INFO L124 PetriNetUnfolderBase]: 1232/2557 cut-off events. [2024-06-27 21:59:32,269 INFO L125 PetriNetUnfolderBase]: For 13511/13511 co-relation queries the response was YES. [2024-06-27 21:59:32,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9910 conditions, 2557 events. 1232/2557 cut-off events. For 13511/13511 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 15775 event pairs, 169 based on Foata normal form. 0/2542 useless extension candidates. Maximal degree in co-relation 9872. Up to 1306 conditions per place. [2024-06-27 21:59:32,285 INFO L140 encePairwiseOnDemand]: 35/52 looper letters, 142 selfloop transitions, 42 changer transitions 3/192 dead transitions. [2024-06-27 21:59:32,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 192 transitions, 1863 flow [2024-06-27 21:59:32,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 21:59:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 21:59:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 259 transitions. [2024-06-27 21:59:32,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33205128205128204 [2024-06-27 21:59:32,287 INFO L175 Difference]: Start difference. First operand has 126 places, 122 transitions, 1136 flow. Second operand 15 states and 259 transitions. [2024-06-27 21:59:32,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 192 transitions, 1863 flow [2024-06-27 21:59:32,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 192 transitions, 1728 flow, removed 31 selfloop flow, removed 9 redundant places. [2024-06-27 21:59:32,322 INFO L231 Difference]: Finished difference. Result has 134 places, 129 transitions, 1211 flow [2024-06-27 21:59:32,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1211, PETRI_PLACES=134, PETRI_TRANSITIONS=129} [2024-06-27 21:59:32,323 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 86 predicate places. [2024-06-27 21:59:32,323 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 1211 flow [2024-06-27 21:59:32,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.40625) internal successors, (365), 32 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:32,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:32,323 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:32,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 21:59:32,528 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,SelfDestructingSolverStorable13 [2024-06-27 21:59:32,528 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:32,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:32,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1119571019, now seen corresponding path program 3 times [2024-06-27 21:59:32,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:32,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205370741] [2024-06-27 21:59:32,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:32,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:33,582 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-27 21:59:33,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:33,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205370741] [2024-06-27 21:59:33,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205370741] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:33,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088353366] [2024-06-27 21:59:33,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 21:59:33,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:33,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:33,583 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-27 21:59:33,605 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-27 21:59:33,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 21:59:33,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 21:59:33,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 42 conjunts are in the unsatisfiable core [2024-06-27 21:59:33,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:33,788 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-27 21:59:33,961 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 117 treesize of output 107 [2024-06-27 21:59:33,964 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-27 21:59:34,000 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 11 treesize of output 7 [2024-06-27 21:59:34,145 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 94 treesize of output 92 [2024-06-27 21:59:34,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 21:59:34,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2024-06-27 21:59:34,344 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 45 treesize of output 37 [2024-06-27 21:59:34,346 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 47 treesize of output 35 [2024-06-27 21:59:34,363 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-27 21:59:34,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:34,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2024-06-27 21:59:34,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:34,954 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 13 treesize of output 22 [2024-06-27 21:59:34,965 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 21:59:34,965 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 14 treesize of output 18 [2024-06-27 21:59:36,038 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 15 treesize of output 13 [2024-06-27 21:59:36,041 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 24 treesize of output 18 [2024-06-27 21:59:36,050 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 15 treesize of output 13 [2024-06-27 21:59:36,053 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 24 treesize of output 18 [2024-06-27 21:59:36,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:36,064 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 126 treesize of output 114 [2024-06-27 21:59:36,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:36,084 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 126 treesize of output 114 [2024-06-27 21:59:36,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:36,104 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 60 treesize of output 54 [2024-06-27 21:59:36,121 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 19 treesize of output 17 [2024-06-27 21:59:36,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:36,132 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 60 treesize of output 54 [2024-06-27 21:59:36,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:36,150 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 60 treesize of output 54 [2024-06-27 21:59:36,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:36,170 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 60 treesize of output 54 [2024-06-27 21:59:36,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:36,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2024-06-27 21:59:36,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:36,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 2247 treesize of output 1436 [2024-06-27 21:59:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088353366] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:38,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:38,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-06-27 21:59:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763848944] [2024-06-27 21:59:38,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:38,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-06-27 21:59:38,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:38,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-06-27 21:59:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2024-06-27 21:59:38,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52 [2024-06-27 21:59:38,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 1211 flow. Second operand has 32 states, 32 states have (on average 11.40625) internal successors, (365), 32 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:38,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:38,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52 [2024-06-27 21:59:38,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:40,612 INFO L124 PetriNetUnfolderBase]: 1345/2796 cut-off events. [2024-06-27 21:59:40,613 INFO L125 PetriNetUnfolderBase]: For 16563/16563 co-relation queries the response was YES. [2024-06-27 21:59:40,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11041 conditions, 2796 events. 1345/2796 cut-off events. For 16563/16563 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 17567 event pairs, 497 based on Foata normal form. 0/2783 useless extension candidates. Maximal degree in co-relation 11000. Up to 1630 conditions per place. [2024-06-27 21:59:40,628 INFO L140 encePairwiseOnDemand]: 33/52 looper letters, 151 selfloop transitions, 55 changer transitions 4/215 dead transitions. [2024-06-27 21:59:40,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 215 transitions, 2126 flow [2024-06-27 21:59:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 21:59:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 21:59:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 269 transitions. [2024-06-27 21:59:40,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34487179487179487 [2024-06-27 21:59:40,629 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 1211 flow. Second operand 15 states and 269 transitions. [2024-06-27 21:59:40,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 215 transitions, 2126 flow [2024-06-27 21:59:40,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 215 transitions, 1998 flow, removed 25 selfloop flow, removed 11 redundant places. [2024-06-27 21:59:40,669 INFO L231 Difference]: Finished difference. Result has 142 places, 145 transitions, 1528 flow [2024-06-27 21:59:40,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1528, PETRI_PLACES=142, PETRI_TRANSITIONS=145} [2024-06-27 21:59:40,669 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 94 predicate places. [2024-06-27 21:59:40,669 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 145 transitions, 1528 flow [2024-06-27 21:59:40,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.40625) internal successors, (365), 32 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:40,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:40,670 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, 1] [2024-06-27 21:59:40,684 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-27 21:59:40,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:40,882 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:40,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash 364499779, now seen corresponding path program 1 times [2024-06-27 21:59:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:40,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215266010] [2024-06-27 21:59:40,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 21:59:40,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 21:59:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 21:59:40,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 21:59:40,999 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 21:59:41,000 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-06-27 21:59:41,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-06-27 21:59:41,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 9 remaining) [2024-06-27 21:59:41,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-06-27 21:59:41,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-06-27 21:59:41,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-06-27 21:59:41,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2024-06-27 21:59:41,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2024-06-27 21:59:41,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-06-27 21:59:41,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 21:59:41,003 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:41,008 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 21:59:41,009 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 21:59:41,061 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 21:59:41,062 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 21:59:41,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 09:59:41 BasicIcfg [2024-06-27 21:59:41,062 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 21:59:41,063 INFO L158 Benchmark]: Toolchain (without parser) took 34622.66ms. Allocated memory was 163.6MB in the beginning and 809.5MB in the end (delta: 645.9MB). Free memory was 93.8MB in the beginning and 575.0MB in the end (delta: -481.2MB). Peak memory consumption was 165.7MB. Max. memory is 16.1GB. [2024-06-27 21:59:41,063 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 21:59:41,063 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 21:59:41,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 678.93ms. Allocated memory is still 163.6MB. Free memory was 93.7MB in the beginning and 105.7MB in the end (delta: -12.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 21:59:41,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.94ms. Allocated memory is still 163.6MB. Free memory was 105.7MB in the beginning and 102.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 21:59:41,063 INFO L158 Benchmark]: Boogie Preprocessor took 38.41ms. Allocated memory is still 163.6MB. Free memory was 102.7MB in the beginning and 99.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 21:59:41,064 INFO L158 Benchmark]: RCFGBuilder took 776.21ms. Allocated memory is still 163.6MB. Free memory was 99.4MB in the beginning and 108.3MB in the end (delta: -8.8MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2024-06-27 21:59:41,064 INFO L158 Benchmark]: TraceAbstraction took 33051.63ms. Allocated memory was 163.6MB in the beginning and 809.5MB in the end (delta: 645.9MB). Free memory was 107.2MB in the beginning and 575.0MB in the end (delta: -467.8MB). Peak memory consumption was 180.2MB. Max. memory is 16.1GB. [2024-06-27 21:59:41,065 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 678.93ms. Allocated memory is still 163.6MB. Free memory was 93.7MB in the beginning and 105.7MB in the end (delta: -12.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.94ms. Allocated memory is still 163.6MB. Free memory was 105.7MB in the beginning and 102.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.41ms. Allocated memory is still 163.6MB. Free memory was 102.7MB in the beginning and 99.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 776.21ms. Allocated memory is still 163.6MB. Free memory was 99.4MB in the beginning and 108.3MB in the end (delta: -8.8MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. * TraceAbstraction took 33051.63ms. Allocated memory was 163.6MB in the beginning and 809.5MB in the end (delta: 645.9MB). Free memory was 107.2MB in the beginning and 575.0MB in the end (delta: -467.8MB). Peak memory consumption was 180.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int m_locked = 0; [L1] 0 //@ ghost int multithreaded = 0; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1062] 0 //@ ghost multithreaded = 1; VAL [dequeue_flag=0, enqueue_flag=1, id1=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1063] 0 //@ assert (!multithreaded || (m_locked || ((((-1LL + (long long) dequeue_flag) + (long long) enqueue_flag) >= 0LL) && (((1LL - (long long) dequeue_flag) - (long long) enqueue_flag) >= 0LL)))); [L1008] 1 //@ ghost m_locked = 1; [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (400)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1017] 1 //@ ghost m_locked = 0; [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-1, id2=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(400) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1039] 2 //@ ghost m_locked = 1; [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1048] 2 //@ ghost m_locked = 0; [L1037] 2 i++ VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1018] 1 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=6] [L1018] COND TRUE 1 i<((400)-1) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=6] [L1020] 1 //@ ghost m_locked = 1; [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (400)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1029] 1 //@ ghost m_locked = 0; [L1037] COND TRUE 2 i<(400) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1039] 2 //@ ghost m_locked = 1; [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (400)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 76 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.9s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1428 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1353 mSDsluCounter, 878 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 861 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7392 IncrementalHoareTripleChecker+Invalid, 7464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 17 mSDtfsCounter, 7392 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1528occurred in iteration=15, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 439 NumberOfCodeBlocks, 439 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 479 ConstructedInterpolants, 70 QuantifiedInterpolants, 54103 SizeOfPredicates, 93 NumberOfNonLiveVariables, 828 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 8/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 21:59:41,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE