./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/popl20-nonblocking-cntr.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c ./goblint.2024-05-07_14-17-48.files/protection/popl20-nonblocking-cntr.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:54:05,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:54:05,327 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:54:05,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:54:05,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:54:05,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:54:05,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:54:05,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:54:05,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:54:05,359 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:54:05,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:54:05,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:54:05,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:54:05,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:54:05,361 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:54:05,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:54:05,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:54:05,362 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:54:05,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:54:05,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:54:05,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:54:05,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:54:05,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:54:05,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:54:05,364 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:54:05,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:54:05,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:54:05,365 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:54:05,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:54:05,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:54:05,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:54:05,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:54:05,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:54:05,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:54:05,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:54:05,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:54:05,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:54:05,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:54:05,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:54:05,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:54:05,368 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:54:05,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:54:05,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:54:05,369 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-05-12 12:54:05,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:54:05,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:54:05,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:54:05,606 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:54:05,607 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:54:05,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/popl20-nonblocking-cntr.wvr.yml/witness.yml [2024-05-12 12:54:05,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:54:05,678 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:54:05,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c [2024-05-12 12:54:06,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:54:06,820 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:54:06,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c [2024-05-12 12:54:06,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d09ffc606/95b2e251eb274b3d956fb14763742c3e/FLAGb06b095c2 [2024-05-12 12:54:06,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d09ffc606/95b2e251eb274b3d956fb14763742c3e [2024-05-12 12:54:06,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:54:06,840 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:54:06,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:54:06,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:54:06,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:54:06,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:54:05" (1/2) ... [2024-05-12 12:54:06,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@750a1142 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:54:06, skipping insertion in model container [2024-05-12 12:54:06,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:54:05" (1/2) ... [2024-05-12 12:54:06,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2956719a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:54:06, skipping insertion in model container [2024-05-12 12:54:06,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:54:06" (2/2) ... [2024-05-12 12:54:06,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@750a1142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:06, skipping insertion in model container [2024-05-12 12:54:06,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:54:06" (2/2) ... [2024-05-12 12:54:06,849 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:54:06,858 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:54:06,859 INFO L97 edCorrectnessWitness]: Location invariant before [L72-L72] ! multithreaded || 0 <= counter [2024-05-12 12:54:06,859 INFO L97 edCorrectnessWitness]: Location invariant before [L73-L73] ! multithreaded || 0 <= counter [2024-05-12 12:54:06,859 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:54:06,859 INFO L106 edCorrectnessWitness]: ghost_update [L71-L71] multithreaded = 1; [2024-05-12 12:54:06,874 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:54:06,989 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c[2037,2050] [2024-05-12 12:54:06,993 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:54:06,998 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:54:07,029 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c[2037,2050] [2024-05-12 12:54:07,030 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:54:07,044 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:54:07,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07 WrapperNode [2024-05-12 12:54:07,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:54:07,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:54:07,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:54:07,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:54:07,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (1/1) ... [2024-05-12 12:54:07,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (1/1) ... [2024-05-12 12:54:07,073 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2024-05-12 12:54:07,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:54:07,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:54:07,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:54:07,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:54:07,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (1/1) ... [2024-05-12 12:54:07,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (1/1) ... [2024-05-12 12:54:07,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (1/1) ... [2024-05-12 12:54:07,100 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 12:54:07,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (1/1) ... [2024-05-12 12:54:07,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (1/1) ... [2024-05-12 12:54:07,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (1/1) ... [2024-05-12 12:54:07,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (1/1) ... [2024-05-12 12:54:07,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (1/1) ... [2024-05-12 12:54:07,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (1/1) ... [2024-05-12 12:54:07,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:54:07,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:54:07,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:54:07,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:54:07,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (1/1) ... [2024-05-12 12:54:07,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:54:07,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:07,132 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-05-12 12:54:07,133 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-05-12 12:54:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:54:07,156 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-12 12:54:07,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-12 12:54:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-12 12:54:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-12 12:54:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:54:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:54:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:54:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:54:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:54:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:54:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:54:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:54:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:54:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:54:07,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:54:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 12:54:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 12:54:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 12:54:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:54:07,161 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 12:54:07,236 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:54:07,238 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:54:07,367 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:54:07,368 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:54:07,535 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:54:07,535 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-12 12:54:07,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:54:07 BoogieIcfgContainer [2024-05-12 12:54:07,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:54:07,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:54:07,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:54:07,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:54:07,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:54:05" (1/4) ... [2024-05-12 12:54:07,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb150d8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:54:07, skipping insertion in model container [2024-05-12 12:54:07,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:54:06" (2/4) ... [2024-05-12 12:54:07,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb150d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:54:07, skipping insertion in model container [2024-05-12 12:54:07,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:54:07" (3/4) ... [2024-05-12 12:54:07,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb150d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:54:07, skipping insertion in model container [2024-05-12 12:54:07,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:54:07" (4/4) ... [2024-05-12 12:54:07,543 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-nonblocking-cntr.wvr.c [2024-05-12 12:54:07,557 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:54:07,557 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-05-12 12:54:07,557 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:54:07,606 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-12 12:54:07,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 70 flow [2024-05-12 12:54:07,661 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2024-05-12 12:54:07,662 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-05-12 12:54:07,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 2/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2024-05-12 12:54:07,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 28 transitions, 70 flow [2024-05-12 12:54:07,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 25 transitions, 62 flow [2024-05-12 12:54:07,676 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:54:07,681 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;@7c223870, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:54:07,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-12 12:54:07,684 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:54:07,684 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-05-12 12:54:07,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:54:07,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:07,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:54:07,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:07,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:07,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1357820620, now seen corresponding path program 1 times [2024-05-12 12:54:07,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:07,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30797172] [2024-05-12 12:54:07,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:07,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:07,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:07,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30797172] [2024-05-12 12:54:07,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30797172] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:07,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:07,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:54:07,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651718419] [2024-05-12 12:54:07,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:07,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:54:07,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:07,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:54:07,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:54:07,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2024-05-12 12:54:07,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-05-12 12:54:07,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:07,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2024-05-12 12:54:07,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:07,990 INFO L124 PetriNetUnfolderBase]: 140/250 cut-off events. [2024-05-12 12:54:07,991 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-05-12 12:54:07,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 250 events. 140/250 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 967 event pairs, 30 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 417. Up to 163 conditions per place. [2024-05-12 12:54:07,995 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 26 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2024-05-12 12:54:07,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 159 flow [2024-05-12 12:54:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:54:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:54:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-05-12 12:54:08,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-05-12 12:54:08,005 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 62 flow. Second operand 3 states and 56 transitions. [2024-05-12 12:54:08,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 159 flow [2024-05-12 12:54:08,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 37 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-05-12 12:54:08,009 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 70 flow [2024-05-12 12:54:08,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=29, PETRI_TRANSITIONS=26} [2024-05-12 12:54:08,014 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2024-05-12 12:54:08,014 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 70 flow [2024-05-12 12:54:08,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-05-12 12:54:08,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:08,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:08,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:54:08,015 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:08,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:08,017 INFO L85 PathProgramCache]: Analyzing trace with hash -831815612, now seen corresponding path program 1 times [2024-05-12 12:54:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:08,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075282727] [2024-05-12 12:54:08,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:08,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075282727] [2024-05-12 12:54:08,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075282727] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:08,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:08,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:54:08,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780528701] [2024-05-12 12:54:08,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:08,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:54:08,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:08,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:54:08,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:54:08,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2024-05-12 12:54:08,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:08,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:08,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2024-05-12 12:54:08,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:08,235 INFO L124 PetriNetUnfolderBase]: 153/288 cut-off events. [2024-05-12 12:54:08,236 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-05-12 12:54:08,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 288 events. 153/288 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1121 event pairs, 23 based on Foata normal form. 12/291 useless extension candidates. Maximal degree in co-relation 141. Up to 96 conditions per place. [2024-05-12 12:54:08,238 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 35 selfloop transitions, 3 changer transitions 4/47 dead transitions. [2024-05-12 12:54:08,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 47 transitions, 203 flow [2024-05-12 12:54:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:54:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:54:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2024-05-12 12:54:08,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-05-12 12:54:08,242 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 70 flow. Second operand 4 states and 72 transitions. [2024-05-12 12:54:08,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 47 transitions, 203 flow [2024-05-12 12:54:08,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 201 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:54:08,250 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 78 flow [2024-05-12 12:54:08,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2024-05-12 12:54:08,252 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-05-12 12:54:08,254 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 78 flow [2024-05-12 12:54:08,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:08,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:08,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:08,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:54:08,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:08,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:08,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1225196804, now seen corresponding path program 1 times [2024-05-12 12:54:08,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:08,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430639327] [2024-05-12 12:54:08,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:08,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:08,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:08,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430639327] [2024-05-12 12:54:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430639327] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:08,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:54:08,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566335587] [2024-05-12 12:54:08,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:08,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:54:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:08,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:54:08,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:54:08,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2024-05-12 12:54:08,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:08,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:08,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2024-05-12 12:54:08,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:08,478 INFO L124 PetriNetUnfolderBase]: 176/331 cut-off events. [2024-05-12 12:54:08,478 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-05-12 12:54:08,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 331 events. 176/331 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1314 event pairs, 28 based on Foata normal form. 12/334 useless extension candidates. Maximal degree in co-relation 155. Up to 149 conditions per place. [2024-05-12 12:54:08,483 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 32 selfloop transitions, 6 changer transitions 4/47 dead transitions. [2024-05-12 12:54:08,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 213 flow [2024-05-12 12:54:08,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:54:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:54:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2024-05-12 12:54:08,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-05-12 12:54:08,486 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 78 flow. Second operand 5 states and 78 transitions. [2024-05-12 12:54:08,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 213 flow [2024-05-12 12:54:08,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:54:08,489 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 107 flow [2024-05-12 12:54:08,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-05-12 12:54:08,490 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-05-12 12:54:08,490 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 107 flow [2024-05-12 12:54:08,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:08,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:08,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:54:08,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:54:08,491 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:08,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1444351890, now seen corresponding path program 1 times [2024-05-12 12:54:08,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:08,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770928129] [2024-05-12 12:54:08,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:08,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:08,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:08,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770928129] [2024-05-12 12:54:08,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770928129] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:54:08,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:54:08,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:54:08,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335640150] [2024-05-12 12:54:08,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:54:08,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:54:08,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:08,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:54:08,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:54:08,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 28 [2024-05-12 12:54:08,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-05-12 12:54:08,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:08,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 28 [2024-05-12 12:54:08,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:08,674 INFO L124 PetriNetUnfolderBase]: 201/390 cut-off events. [2024-05-12 12:54:08,674 INFO L125 PetriNetUnfolderBase]: For 489/489 co-relation queries the response was YES. [2024-05-12 12:54:08,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 390 events. 201/390 cut-off events. For 489/489 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1571 event pairs, 112 based on Foata normal form. 19/403 useless extension candidates. Maximal degree in co-relation 498. Up to 297 conditions per place. [2024-05-12 12:54:08,676 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 30 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2024-05-12 12:54:08,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 217 flow [2024-05-12 12:54:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:54:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:54:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-05-12 12:54:08,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-05-12 12:54:08,689 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 107 flow. Second operand 4 states and 60 transitions. [2024-05-12 12:54:08,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 217 flow [2024-05-12 12:54:08,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 205 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-05-12 12:54:08,723 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 127 flow [2024-05-12 12:54:08,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2024-05-12 12:54:08,724 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2024-05-12 12:54:08,724 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 127 flow [2024-05-12 12:54:08,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-05-12 12:54:08,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:08,724 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] [2024-05-12 12:54:08,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:54:08,724 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:08,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1224417202, now seen corresponding path program 1 times [2024-05-12 12:54:08,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:08,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40500771] [2024-05-12 12:54:08,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:08,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:54:08,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40500771] [2024-05-12 12:54:08,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40500771] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280276507] [2024-05-12 12:54:08,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:08,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:08,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:08,842 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-05-12 12:54:08,864 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-05-12 12:54:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:08,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2024-05-12 12:54:08,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:54:09,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:54:09,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280276507] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:09,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:09,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-05-12 12:54:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162642235] [2024-05-12 12:54:09,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:09,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:54:09,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:09,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:54:09,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:54:09,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2024-05-12 12:54:09,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 127 flow. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 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-05-12 12:54:09,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:09,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2024-05-12 12:54:09,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:09,384 INFO L124 PetriNetUnfolderBase]: 298/529 cut-off events. [2024-05-12 12:54:09,384 INFO L125 PetriNetUnfolderBase]: For 609/609 co-relation queries the response was YES. [2024-05-12 12:54:09,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 529 events. 298/529 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2079 event pairs, 40 based on Foata normal form. 19/547 useless extension candidates. Maximal degree in co-relation 687. Up to 219 conditions per place. [2024-05-12 12:54:09,387 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 45 selfloop transitions, 10 changer transitions 6/64 dead transitions. [2024-05-12 12:54:09,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 356 flow [2024-05-12 12:54:09,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:54:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:54:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-05-12 12:54:09,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-05-12 12:54:09,389 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 127 flow. Second operand 6 states and 86 transitions. [2024-05-12 12:54:09,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 356 flow [2024-05-12 12:54:09,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 64 transitions, 347 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 12:54:09,394 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 200 flow [2024-05-12 12:54:09,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2024-05-12 12:54:09,396 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2024-05-12 12:54:09,396 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 200 flow [2024-05-12 12:54:09,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 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-05-12 12:54:09,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:09,396 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] [2024-05-12 12:54:09,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-05-12 12:54:09,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:09,607 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:09,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1301527950, now seen corresponding path program 2 times [2024-05-12 12:54:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:09,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173444454] [2024-05-12 12:54:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:09,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:09,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173444454] [2024-05-12 12:54:09,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173444454] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:09,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386278415] [2024-05-12 12:54:09,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 12:54:09,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:09,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:09,711 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-05-12 12:54:09,728 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-05-12 12:54:09,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 12:54:09,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:54:09,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-12 12:54:09,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:09,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:09,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386278415] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:09,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:09,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 5 [2024-05-12 12:54:09,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094925287] [2024-05-12 12:54:09,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:09,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:54:09,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:09,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:54:09,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:54:09,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2024-05-12 12:54:09,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-05-12 12:54:09,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:09,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2024-05-12 12:54:09,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:10,064 INFO L124 PetriNetUnfolderBase]: 291/557 cut-off events. [2024-05-12 12:54:10,064 INFO L125 PetriNetUnfolderBase]: For 2386/2460 co-relation queries the response was YES. [2024-05-12 12:54:10,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2045 conditions, 557 events. 291/557 cut-off events. For 2386/2460 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2415 event pairs, 47 based on Foata normal form. 31/571 useless extension candidates. Maximal degree in co-relation 1061. Up to 237 conditions per place. [2024-05-12 12:54:10,068 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 45 selfloop transitions, 9 changer transitions 4/65 dead transitions. [2024-05-12 12:54:10,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 458 flow [2024-05-12 12:54:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:54:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:54:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2024-05-12 12:54:10,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2024-05-12 12:54:10,070 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 200 flow. Second operand 4 states and 74 transitions. [2024-05-12 12:54:10,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 458 flow [2024-05-12 12:54:10,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:54:10,073 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 311 flow [2024-05-12 12:54:10,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-05-12 12:54:10,075 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2024-05-12 12:54:10,076 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 311 flow [2024-05-12 12:54:10,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-05-12 12:54:10,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:10,076 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] [2024-05-12 12:54:10,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-12 12:54:10,287 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,SelfDestructingSolverStorable5 [2024-05-12 12:54:10,288 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:10,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1370061410, now seen corresponding path program 3 times [2024-05-12 12:54:10,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:10,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177815205] [2024-05-12 12:54:10,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:10,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:10,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:10,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177815205] [2024-05-12 12:54:10,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177815205] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:10,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766626636] [2024-05-12 12:54:10,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-12 12:54:10,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:10,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:10,401 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-05-12 12:54:10,429 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-05-12 12:54:10,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-05-12 12:54:10,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:54:10,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-12 12:54:10,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:10,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:10,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766626636] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:10,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:10,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-05-12 12:54:10,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114842262] [2024-05-12 12:54:10,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:10,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-12 12:54:10,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:10,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-12 12:54:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-05-12 12:54:10,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:54:10,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 311 flow. Second operand has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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-05-12 12:54:10,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:10,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:54:10,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:11,370 INFO L124 PetriNetUnfolderBase]: 1503/2389 cut-off events. [2024-05-12 12:54:11,370 INFO L125 PetriNetUnfolderBase]: For 7526/7526 co-relation queries the response was YES. [2024-05-12 12:54:11,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8694 conditions, 2389 events. 1503/2389 cut-off events. For 7526/7526 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 11099 event pairs, 65 based on Foata normal form. 0/2179 useless extension candidates. Maximal degree in co-relation 4823. Up to 457 conditions per place. [2024-05-12 12:54:11,385 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 157 selfloop transitions, 91 changer transitions 8/257 dead transitions. [2024-05-12 12:54:11,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 257 transitions, 2075 flow [2024-05-12 12:54:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-12 12:54:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-05-12 12:54:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 304 transitions. [2024-05-12 12:54:11,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3619047619047619 [2024-05-12 12:54:11,389 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 311 flow. Second operand 30 states and 304 transitions. [2024-05-12 12:54:11,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 257 transitions, 2075 flow [2024-05-12 12:54:11,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 257 transitions, 2053 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-05-12 12:54:11,402 INFO L231 Difference]: Finished difference. Result has 83 places, 134 transitions, 1340 flow [2024-05-12 12:54:11,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1340, PETRI_PLACES=83, PETRI_TRANSITIONS=134} [2024-05-12 12:54:11,403 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2024-05-12 12:54:11,404 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 134 transitions, 1340 flow [2024-05-12 12:54:11,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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-05-12 12:54:11,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:11,404 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] [2024-05-12 12:54:11,422 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-05-12 12:54:11,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:11,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:11,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash 228521846, now seen corresponding path program 4 times [2024-05-12 12:54:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:11,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564093195] [2024-05-12 12:54:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:11,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:11,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:11,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564093195] [2024-05-12 12:54:11,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564093195] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:11,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452614447] [2024-05-12 12:54:11,728 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-12 12:54:11,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:11,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:11,729 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:54:11,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-12 12:54:11,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-12 12:54:11,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:54:11,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-12 12:54:11,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:11,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:12,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452614447] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:12,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:12,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 21 [2024-05-12 12:54:12,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653365460] [2024-05-12 12:54:12,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:12,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-05-12 12:54:12,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:12,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-05-12 12:54:12,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-05-12 12:54:12,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:54:12,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 134 transitions, 1340 flow. Second operand has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 21 states have internal predecessors, (128), 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-05-12 12:54:12,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:12,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:54:12,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:12,997 INFO L124 PetriNetUnfolderBase]: 2030/3254 cut-off events. [2024-05-12 12:54:12,998 INFO L125 PetriNetUnfolderBase]: For 16377/16377 co-relation queries the response was YES. [2024-05-12 12:54:13,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14772 conditions, 3254 events. 2030/3254 cut-off events. For 16377/16377 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16320 event pairs, 13 based on Foata normal form. 91/3345 useless extension candidates. Maximal degree in co-relation 9417. Up to 518 conditions per place. [2024-05-12 12:54:13,018 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 233 selfloop transitions, 180 changer transitions 30/444 dead transitions. [2024-05-12 12:54:13,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 444 transitions, 4072 flow [2024-05-12 12:54:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-05-12 12:54:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2024-05-12 12:54:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 380 transitions. [2024-05-12 12:54:13,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-05-12 12:54:13,021 INFO L175 Difference]: Start difference. First operand has 83 places, 134 transitions, 1340 flow. Second operand 38 states and 380 transitions. [2024-05-12 12:54:13,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 444 transitions, 4072 flow [2024-05-12 12:54:13,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 444 transitions, 3794 flow, removed 133 selfloop flow, removed 4 redundant places. [2024-05-12 12:54:13,063 INFO L231 Difference]: Finished difference. Result has 139 places, 232 transitions, 2822 flow [2024-05-12 12:54:13,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2822, PETRI_PLACES=139, PETRI_TRANSITIONS=232} [2024-05-12 12:54:13,065 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2024-05-12 12:54:13,065 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 232 transitions, 2822 flow [2024-05-12 12:54:13,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 21 states have internal predecessors, (128), 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-05-12 12:54:13,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:13,065 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] [2024-05-12 12:54:13,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-12 12:54:13,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:13,277 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:13,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:13,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1139242396, now seen corresponding path program 5 times [2024-05-12 12:54:13,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:13,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903972849] [2024-05-12 12:54:13,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:13,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:13,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:13,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903972849] [2024-05-12 12:54:13,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903972849] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:13,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308512235] [2024-05-12 12:54:13,433 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-12 12:54:13,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:13,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:13,434 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:54:13,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-12 12:54:13,487 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-05-12 12:54:13,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:54:13,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-12 12:54:13,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:13,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:13,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308512235] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:13,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:13,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 22 [2024-05-12 12:54:13,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525185492] [2024-05-12 12:54:13,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:13,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-12 12:54:13,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:13,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-12 12:54:13,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2024-05-12 12:54:13,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:54:13,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 232 transitions, 2822 flow. Second operand has 22 states, 22 states have (on average 5.909090909090909) internal successors, (130), 22 states have internal predecessors, (130), 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-05-12 12:54:13,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:13,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:54:13,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:14,560 INFO L124 PetriNetUnfolderBase]: 2659/4274 cut-off events. [2024-05-12 12:54:14,560 INFO L125 PetriNetUnfolderBase]: For 58934/58934 co-relation queries the response was YES. [2024-05-12 12:54:14,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26314 conditions, 4274 events. 2659/4274 cut-off events. For 58934/58934 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 22909 event pairs, 27 based on Foata normal form. 157/4431 useless extension candidates. Maximal degree in co-relation 26078. Up to 764 conditions per place. [2024-05-12 12:54:14,606 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 207 selfloop transitions, 270 changer transitions 1/479 dead transitions. [2024-05-12 12:54:14,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 479 transitions, 6187 flow [2024-05-12 12:54:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-12 12:54:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-05-12 12:54:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 270 transitions. [2024-05-12 12:54:14,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-05-12 12:54:14,609 INFO L175 Difference]: Start difference. First operand has 139 places, 232 transitions, 2822 flow. Second operand 27 states and 270 transitions. [2024-05-12 12:54:14,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 479 transitions, 6187 flow [2024-05-12 12:54:14,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 479 transitions, 5917 flow, removed 125 selfloop flow, removed 6 redundant places. [2024-05-12 12:54:14,719 INFO L231 Difference]: Finished difference. Result has 175 places, 346 transitions, 5197 flow [2024-05-12 12:54:14,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2680, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=5197, PETRI_PLACES=175, PETRI_TRANSITIONS=346} [2024-05-12 12:54:14,721 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 145 predicate places. [2024-05-12 12:54:14,721 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 346 transitions, 5197 flow [2024-05-12 12:54:14,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.909090909090909) internal successors, (130), 22 states have internal predecessors, (130), 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-05-12 12:54:14,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:14,721 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] [2024-05-12 12:54:14,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-12 12:54:14,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:14,933 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:14,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:14,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1680259010, now seen corresponding path program 6 times [2024-05-12 12:54:14,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:14,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486957682] [2024-05-12 12:54:14,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:14,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:15,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:15,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486957682] [2024-05-12 12:54:15,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486957682] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:15,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821787271] [2024-05-12 12:54:15,014 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-12 12:54:15,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:15,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:15,016 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:54:15,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-12 12:54:15,130 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-05-12 12:54:15,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:54:15,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-12 12:54:15,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:15,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:15,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821787271] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:15,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:15,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-05-12 12:54:15,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229884190] [2024-05-12 12:54:15,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:15,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-12 12:54:15,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:15,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-12 12:54:15,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-05-12 12:54:15,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:54:15,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 346 transitions, 5197 flow. Second operand has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 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-05-12 12:54:15,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:15,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:54:15,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:16,491 INFO L124 PetriNetUnfolderBase]: 3163/5120 cut-off events. [2024-05-12 12:54:16,491 INFO L125 PetriNetUnfolderBase]: For 104711/104711 co-relation queries the response was YES. [2024-05-12 12:54:16,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36863 conditions, 5120 events. 3163/5120 cut-off events. For 104711/104711 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 27778 event pairs, 23 based on Foata normal form. 150/5270 useless extension candidates. Maximal degree in co-relation 36560. Up to 959 conditions per place. [2024-05-12 12:54:16,528 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 310 selfloop transitions, 322 changer transitions 2/635 dead transitions. [2024-05-12 12:54:16,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 635 transitions, 9692 flow [2024-05-12 12:54:16,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-05-12 12:54:16,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-05-12 12:54:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 358 transitions. [2024-05-12 12:54:16,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3551587301587302 [2024-05-12 12:54:16,531 INFO L175 Difference]: Start difference. First operand has 175 places, 346 transitions, 5197 flow. Second operand 36 states and 358 transitions. [2024-05-12 12:54:16,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 635 transitions, 9692 flow [2024-05-12 12:54:16,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 635 transitions, 9252 flow, removed 162 selfloop flow, removed 8 redundant places. [2024-05-12 12:54:16,898 INFO L231 Difference]: Finished difference. Result has 215 places, 440 transitions, 7515 flow [2024-05-12 12:54:16,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4805, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=7515, PETRI_PLACES=215, PETRI_TRANSITIONS=440} [2024-05-12 12:54:16,899 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 185 predicate places. [2024-05-12 12:54:16,900 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 440 transitions, 7515 flow [2024-05-12 12:54:16,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 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-05-12 12:54:16,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:16,900 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] [2024-05-12 12:54:16,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-12 12:54:17,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:17,111 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:17,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash 306698550, now seen corresponding path program 7 times [2024-05-12 12:54:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:17,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10143866] [2024-05-12 12:54:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:17,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:17,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10143866] [2024-05-12 12:54:17,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10143866] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:17,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898890044] [2024-05-12 12:54:17,200 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-12 12:54:17,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:17,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:17,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:54:17,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-12 12:54:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:17,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-12 12:54:17,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:17,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:17,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898890044] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:17,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:17,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2024-05-12 12:54:17,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685817031] [2024-05-12 12:54:17,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:17,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-05-12 12:54:17,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:17,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-05-12 12:54:17,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2024-05-12 12:54:17,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:54:17,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 440 transitions, 7515 flow. Second operand has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 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-05-12 12:54:17,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:17,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:54:17,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:19,143 INFO L124 PetriNetUnfolderBase]: 3835/6151 cut-off events. [2024-05-12 12:54:19,144 INFO L125 PetriNetUnfolderBase]: For 146972/146972 co-relation queries the response was YES. [2024-05-12 12:54:19,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48700 conditions, 6151 events. 3835/6151 cut-off events. For 146972/146972 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 34363 event pairs, 73 based on Foata normal form. 27/6178 useless extension candidates. Maximal degree in co-relation 48245. Up to 1233 conditions per place. [2024-05-12 12:54:19,201 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 360 selfloop transitions, 370 changer transitions 7/738 dead transitions. [2024-05-12 12:54:19,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 738 transitions, 13027 flow [2024-05-12 12:54:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-12 12:54:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-05-12 12:54:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 315 transitions. [2024-05-12 12:54:19,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33088235294117646 [2024-05-12 12:54:19,204 INFO L175 Difference]: Start difference. First operand has 215 places, 440 transitions, 7515 flow. Second operand 34 states and 315 transitions. [2024-05-12 12:54:19,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 738 transitions, 13027 flow [2024-05-12 12:54:19,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 738 transitions, 12490 flow, removed 184 selfloop flow, removed 16 redundant places. [2024-05-12 12:54:19,929 INFO L231 Difference]: Finished difference. Result has 239 places, 540 transitions, 9567 flow [2024-05-12 12:54:19,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7142, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=278, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=9567, PETRI_PLACES=239, PETRI_TRANSITIONS=540} [2024-05-12 12:54:19,930 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 209 predicate places. [2024-05-12 12:54:19,930 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 540 transitions, 9567 flow [2024-05-12 12:54:19,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 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-05-12 12:54:19,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:19,930 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] [2024-05-12 12:54:19,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-05-12 12:54:20,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:20,131 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:20,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -262666340, now seen corresponding path program 8 times [2024-05-12 12:54:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:20,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205606694] [2024-05-12 12:54:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:20,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205606694] [2024-05-12 12:54:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205606694] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662224138] [2024-05-12 12:54:20,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 12:54:20,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:20,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:20,227 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:54:20,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-12 12:54:20,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 12:54:20,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:54:20,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-12 12:54:20,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:20,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:20,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662224138] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:20,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:20,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-05-12 12:54:20,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516459153] [2024-05-12 12:54:20,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:20,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-12 12:54:20,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:20,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-12 12:54:20,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-05-12 12:54:20,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:54:20,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 540 transitions, 9567 flow. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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-05-12 12:54:20,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:20,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:54:20,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:22,492 INFO L124 PetriNetUnfolderBase]: 4884/7863 cut-off events. [2024-05-12 12:54:22,492 INFO L125 PetriNetUnfolderBase]: For 223005/223005 co-relation queries the response was YES. [2024-05-12 12:54:22,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65377 conditions, 7863 events. 4884/7863 cut-off events. For 223005/223005 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 46318 event pairs, 47 based on Foata normal form. 127/7990 useless extension candidates. Maximal degree in co-relation 63726. Up to 1366 conditions per place. [2024-05-12 12:54:22,562 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 296 selfloop transitions, 639 changer transitions 3/939 dead transitions. [2024-05-12 12:54:22,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 939 transitions, 17220 flow [2024-05-12 12:54:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-12 12:54:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-05-12 12:54:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 433 transitions. [2024-05-12 12:54:22,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3361801242236025 [2024-05-12 12:54:22,565 INFO L175 Difference]: Start difference. First operand has 239 places, 540 transitions, 9567 flow. Second operand 46 states and 433 transitions. [2024-05-12 12:54:22,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 939 transitions, 17220 flow [2024-05-12 12:54:23,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 939 transitions, 16979 flow, removed 108 selfloop flow, removed 8 redundant places. [2024-05-12 12:54:23,804 INFO L231 Difference]: Finished difference. Result has 294 places, 748 transitions, 15818 flow [2024-05-12 12:54:23,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=9374, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=441, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=15818, PETRI_PLACES=294, PETRI_TRANSITIONS=748} [2024-05-12 12:54:23,805 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 264 predicate places. [2024-05-12 12:54:23,805 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 748 transitions, 15818 flow [2024-05-12 12:54:23,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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-05-12 12:54:23,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:23,806 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] [2024-05-12 12:54:23,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-12 12:54:24,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-05-12 12:54:24,007 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:24,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:24,008 INFO L85 PathProgramCache]: Analyzing trace with hash -295559222, now seen corresponding path program 9 times [2024-05-12 12:54:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:24,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686284692] [2024-05-12 12:54:24,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:24,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:24,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:24,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686284692] [2024-05-12 12:54:24,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686284692] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:24,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885241590] [2024-05-12 12:54:24,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-12 12:54:24,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:24,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:24,121 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:54:24,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-12 12:54:24,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-12 12:54:24,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:54:24,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-12 12:54:24,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:24,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885241590] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:24,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:24,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-05-12 12:54:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134001662] [2024-05-12 12:54:24,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:24,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-12 12:54:24,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:24,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-12 12:54:24,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2024-05-12 12:54:24,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:54:24,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 748 transitions, 15818 flow. Second operand has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 23 states have internal predecessors, (137), 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-05-12 12:54:24,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:24,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:54:24,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:27,680 INFO L124 PetriNetUnfolderBase]: 6458/10402 cut-off events. [2024-05-12 12:54:27,680 INFO L125 PetriNetUnfolderBase]: For 387114/387114 co-relation queries the response was YES. [2024-05-12 12:54:27,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99077 conditions, 10402 events. 6458/10402 cut-off events. For 387114/387114 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 64106 event pairs, 50 based on Foata normal form. 91/10493 useless extension candidates. Maximal degree in co-relation 97437. Up to 1913 conditions per place. [2024-05-12 12:54:27,803 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 432 selfloop transitions, 814 changer transitions 0/1247 dead transitions. [2024-05-12 12:54:27,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 1247 transitions, 27458 flow [2024-05-12 12:54:27,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-12 12:54:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-05-12 12:54:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 435 transitions. [2024-05-12 12:54:27,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33773291925465837 [2024-05-12 12:54:27,809 INFO L175 Difference]: Start difference. First operand has 294 places, 748 transitions, 15818 flow. Second operand 46 states and 435 transitions. [2024-05-12 12:54:27,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 1247 transitions, 27458 flow [2024-05-12 12:54:30,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 1247 transitions, 26896 flow, removed 257 selfloop flow, removed 11 redundant places. [2024-05-12 12:54:30,986 INFO L231 Difference]: Finished difference. Result has 342 places, 1011 transitions, 24385 flow [2024-05-12 12:54:30,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=15340, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=557, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=24385, PETRI_PLACES=342, PETRI_TRANSITIONS=1011} [2024-05-12 12:54:30,987 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 312 predicate places. [2024-05-12 12:54:30,987 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 1011 transitions, 24385 flow [2024-05-12 12:54:30,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 23 states have internal predecessors, (137), 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-05-12 12:54:30,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:30,988 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] [2024-05-12 12:54:31,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-12 12:54:31,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-05-12 12:54:31,198 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:31,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:31,199 INFO L85 PathProgramCache]: Analyzing trace with hash 813044816, now seen corresponding path program 10 times [2024-05-12 12:54:31,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:31,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920928189] [2024-05-12 12:54:31,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:31,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:31,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:31,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920928189] [2024-05-12 12:54:31,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920928189] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:31,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096393485] [2024-05-12 12:54:31,293 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-12 12:54:31,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:31,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:31,294 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:54:31,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-05-12 12:54:31,343 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-12 12:54:31,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:54:31,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-12 12:54:31,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:31,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:54:31,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096393485] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:31,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:31,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 15 [2024-05-12 12:54:31,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359806152] [2024-05-12 12:54:31,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:31,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-12 12:54:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-12 12:54:31,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-05-12 12:54:31,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:54:31,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 1011 transitions, 24385 flow. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 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-05-12 12:54:31,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:31,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:54:31,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:34,836 INFO L124 PetriNetUnfolderBase]: 6469/10443 cut-off events. [2024-05-12 12:54:34,837 INFO L125 PetriNetUnfolderBase]: For 467817/467817 co-relation queries the response was YES. [2024-05-12 12:54:34,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107795 conditions, 10443 events. 6469/10443 cut-off events. For 467817/467817 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 64598 event pairs, 180 based on Foata normal form. 36/10479 useless extension candidates. Maximal degree in co-relation 105791. Up to 2315 conditions per place. [2024-05-12 12:54:34,939 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 566 selfloop transitions, 544 changer transitions 4/1115 dead transitions. [2024-05-12 12:54:34,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1115 transitions, 28143 flow [2024-05-12 12:54:34,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-12 12:54:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-05-12 12:54:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 192 transitions. [2024-05-12 12:54:34,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-05-12 12:54:34,940 INFO L175 Difference]: Start difference. First operand has 342 places, 1011 transitions, 24385 flow. Second operand 18 states and 192 transitions. [2024-05-12 12:54:34,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1115 transitions, 28143 flow [2024-05-12 12:54:39,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 1115 transitions, 27646 flow, removed 145 selfloop flow, removed 20 redundant places. [2024-05-12 12:54:39,335 INFO L231 Difference]: Finished difference. Result has 340 places, 1016 transitions, 25640 flow [2024-05-12 12:54:39,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=23819, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1004, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=531, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=25640, PETRI_PLACES=340, PETRI_TRANSITIONS=1016} [2024-05-12 12:54:39,337 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 310 predicate places. [2024-05-12 12:54:39,337 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 1016 transitions, 25640 flow [2024-05-12 12:54:39,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 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-05-12 12:54:39,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:39,337 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] [2024-05-12 12:54:39,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-05-12 12:54:39,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-05-12 12:54:39,538 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:39,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -598514732, now seen corresponding path program 11 times [2024-05-12 12:54:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:39,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594319657] [2024-05-12 12:54:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:39,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:39,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594319657] [2024-05-12 12:54:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594319657] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:39,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071302344] [2024-05-12 12:54:39,620 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-12 12:54:39,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:39,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:39,621 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:54:39,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-12 12:54:39,672 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-05-12 12:54:39,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:54:39,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2024-05-12 12:54:39,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:39,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:39,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071302344] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:39,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:39,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-05-12 12:54:39,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428671114] [2024-05-12 12:54:39,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:39,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-12 12:54:39,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:39,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-12 12:54:39,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-05-12 12:54:39,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:54:39,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 1016 transitions, 25640 flow. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:39,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:39,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:54:39,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:43,653 INFO L124 PetriNetUnfolderBase]: 7642/12321 cut-off events. [2024-05-12 12:54:43,653 INFO L125 PetriNetUnfolderBase]: For 481964/481964 co-relation queries the response was YES. [2024-05-12 12:54:43,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127906 conditions, 12321 events. 7642/12321 cut-off events. For 481964/481964 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 77785 event pairs, 79 based on Foata normal form. 18/12339 useless extension candidates. Maximal degree in co-relation 126970. Up to 3125 conditions per place. [2024-05-12 12:54:43,782 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 590 selfloop transitions, 753 changer transitions 17/1361 dead transitions. [2024-05-12 12:54:43,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 1361 transitions, 35711 flow [2024-05-12 12:54:43,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-12 12:54:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-05-12 12:54:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 213 transitions. [2024-05-12 12:54:43,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3457792207792208 [2024-05-12 12:54:43,784 INFO L175 Difference]: Start difference. First operand has 340 places, 1016 transitions, 25640 flow. Second operand 22 states and 213 transitions. [2024-05-12 12:54:43,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 1361 transitions, 35711 flow [2024-05-12 12:54:50,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 1361 transitions, 34618 flow, removed 33 selfloop flow, removed 16 redundant places. [2024-05-12 12:54:50,086 INFO L231 Difference]: Finished difference. Result has 352 places, 1187 transitions, 31990 flow [2024-05-12 12:54:50,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=24702, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1016, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=581, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=31990, PETRI_PLACES=352, PETRI_TRANSITIONS=1187} [2024-05-12 12:54:50,087 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 322 predicate places. [2024-05-12 12:54:50,087 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 1187 transitions, 31990 flow [2024-05-12 12:54:50,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:50,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:54:50,088 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] [2024-05-12 12:54:50,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-12 12:54:50,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-05-12 12:54:50,291 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:54:50,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:54:50,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1836984094, now seen corresponding path program 12 times [2024-05-12 12:54:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:54:50,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081627066] [2024-05-12 12:54:50,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:54:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:54:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:54:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:50,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:54:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081627066] [2024-05-12 12:54:50,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081627066] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:54:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694881140] [2024-05-12 12:54:50,389 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-12 12:54:50,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:54:50,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:54:50,392 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:54:50,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-05-12 12:54:50,446 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-05-12 12:54:50,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:54:50,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-12 12:54:50,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:54:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:50,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:54:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:54:50,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694881140] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:54:50,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:54:50,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-05-12 12:54:50,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685354133] [2024-05-12 12:54:50,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:54:50,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-12 12:54:50,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:54:50,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-12 12:54:50,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2024-05-12 12:54:50,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:54:50,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 1187 transitions, 31990 flow. Second operand has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:54:50,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:54:50,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:54:50,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:54:55,552 INFO L124 PetriNetUnfolderBase]: 8201/13270 cut-off events. [2024-05-12 12:54:55,553 INFO L125 PetriNetUnfolderBase]: For 578252/578252 co-relation queries the response was YES. [2024-05-12 12:54:55,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144108 conditions, 13270 events. 8201/13270 cut-off events. For 578252/578252 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 85631 event pairs, 86 based on Foata normal form. 150/13420 useless extension candidates. Maximal degree in co-relation 141378. Up to 6752 conditions per place. [2024-05-12 12:54:55,700 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 822 selfloop transitions, 647 changer transitions 2/1472 dead transitions. [2024-05-12 12:54:55,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 1472 transitions, 40483 flow [2024-05-12 12:54:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-12 12:54:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-05-12 12:54:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 270 transitions. [2024-05-12 12:54:55,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3708791208791209 [2024-05-12 12:54:55,701 INFO L175 Difference]: Start difference. First operand has 352 places, 1187 transitions, 31990 flow. Second operand 26 states and 270 transitions. [2024-05-12 12:54:55,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 1472 transitions, 40483 flow [2024-05-12 12:55:04,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 1472 transitions, 40009 flow, removed 58 selfloop flow, removed 11 redundant places. [2024-05-12 12:55:05,027 INFO L231 Difference]: Finished difference. Result has 378 places, 1269 transitions, 36597 flow [2024-05-12 12:55:05,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=31568, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=569, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=36597, PETRI_PLACES=378, PETRI_TRANSITIONS=1269} [2024-05-12 12:55:05,029 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 348 predicate places. [2024-05-12 12:55:05,029 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 1269 transitions, 36597 flow [2024-05-12 12:55:05,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:55:05,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:55:05,029 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] [2024-05-12 12:55:05,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-05-12 12:55:05,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-05-12 12:55:05,241 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:55:05,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:55:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash -773023750, now seen corresponding path program 13 times [2024-05-12 12:55:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:55:05,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509520413] [2024-05-12 12:55:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:55:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:55:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:55:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:55:05,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:55:05,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509520413] [2024-05-12 12:55:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509520413] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:55:05,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771977223] [2024-05-12 12:55:05,324 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-12 12:55:05,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:55:05,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:55:05,325 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:55:05,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-05-12 12:55:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:55:05,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-12 12:55:05,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:55:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:55:05,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:55:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:55:05,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771977223] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:55:05,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:55:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2024-05-12 12:55:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052560158] [2024-05-12 12:55:05,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:55:05,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-12 12:55:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:55:05,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-12 12:55:05,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-05-12 12:55:05,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:55:05,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 1269 transitions, 36597 flow. Second operand has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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-05-12 12:55:05,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:55:05,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:55:05,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:55:10,834 INFO L124 PetriNetUnfolderBase]: 8427/13584 cut-off events. [2024-05-12 12:55:10,834 INFO L125 PetriNetUnfolderBase]: For 718768/718768 co-relation queries the response was YES. [2024-05-12 12:55:10,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158546 conditions, 13584 events. 8427/13584 cut-off events. For 718768/718768 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 86878 event pairs, 382 based on Foata normal form. 12/13596 useless extension candidates. Maximal degree in co-relation 157270. Up to 11512 conditions per place. [2024-05-12 12:55:11,012 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 1235 selfloop transitions, 155 changer transitions 5/1396 dead transitions. [2024-05-12 12:55:11,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1396 transitions, 42421 flow [2024-05-12 12:55:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-12 12:55:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-05-12 12:55:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 150 transitions. [2024-05-12 12:55:11,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-05-12 12:55:11,013 INFO L175 Difference]: Start difference. First operand has 378 places, 1269 transitions, 36597 flow. Second operand 15 states and 150 transitions. [2024-05-12 12:55:11,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 1396 transitions, 42421 flow [2024-05-12 12:55:21,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 1396 transitions, 41847 flow, removed 227 selfloop flow, removed 7 redundant places. [2024-05-12 12:55:21,417 INFO L231 Difference]: Finished difference. Result has 391 places, 1316 transitions, 38021 flow [2024-05-12 12:55:21,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=36175, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=38021, PETRI_PLACES=391, PETRI_TRANSITIONS=1316} [2024-05-12 12:55:21,418 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 361 predicate places. [2024-05-12 12:55:21,419 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 1316 transitions, 38021 flow [2024-05-12 12:55:21,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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-05-12 12:55:21,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:55:21,419 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] [2024-05-12 12:55:21,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-05-12 12:55:21,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-05-12 12:55:21,620 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:55:21,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:55:21,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1394603052, now seen corresponding path program 14 times [2024-05-12 12:55:21,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:55:21,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567163793] [2024-05-12 12:55:21,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:55:21,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:55:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:55:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:55:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:55:21,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567163793] [2024-05-12 12:55:21,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567163793] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:55:21,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435821785] [2024-05-12 12:55:21,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 12:55:21,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:55:21,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:55:21,704 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:55:21,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-05-12 12:55:21,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 12:55:21,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:55:21,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-12 12:55:21,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:55:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:55:21,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:55:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:55:21,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435821785] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:55:21,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:55:21,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2024-05-12 12:55:21,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988781210] [2024-05-12 12:55:21,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:55:21,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-05-12 12:55:21,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:55:21,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-05-12 12:55:21,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-05-12 12:55:21,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:55:21,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 1316 transitions, 38021 flow. Second operand has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 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-05-12 12:55:21,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:55:21,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:55:21,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:55:27,580 INFO L124 PetriNetUnfolderBase]: 8997/14455 cut-off events. [2024-05-12 12:55:27,580 INFO L125 PetriNetUnfolderBase]: For 769170/769170 co-relation queries the response was YES. [2024-05-12 12:55:27,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169054 conditions, 14455 events. 8997/14455 cut-off events. For 769170/769170 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 93174 event pairs, 373 based on Foata normal form. 39/14494 useless extension candidates. Maximal degree in co-relation 168025. Up to 11289 conditions per place. [2024-05-12 12:55:27,762 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 1273 selfloop transitions, 237 changer transitions 8/1519 dead transitions. [2024-05-12 12:55:27,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1519 transitions, 45740 flow [2024-05-12 12:55:27,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-12 12:55:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-05-12 12:55:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 189 transitions. [2024-05-12 12:55:27,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35526315789473684 [2024-05-12 12:55:27,763 INFO L175 Difference]: Start difference. First operand has 391 places, 1316 transitions, 38021 flow. Second operand 19 states and 189 transitions. [2024-05-12 12:55:27,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 1519 transitions, 45740 flow [2024-05-12 12:55:39,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 1519 transitions, 45540 flow, removed 45 selfloop flow, removed 10 redundant places. [2024-05-12 12:55:39,429 INFO L231 Difference]: Finished difference. Result has 407 places, 1383 transitions, 40666 flow [2024-05-12 12:55:39,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=37837, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=40666, PETRI_PLACES=407, PETRI_TRANSITIONS=1383} [2024-05-12 12:55:39,430 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 377 predicate places. [2024-05-12 12:55:39,430 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 1383 transitions, 40666 flow [2024-05-12 12:55:39,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 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-05-12 12:55:39,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:55:39,431 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] [2024-05-12 12:55:39,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-05-12 12:55:39,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:55:39,641 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:55:39,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:55:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1963967942, now seen corresponding path program 15 times [2024-05-12 12:55:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:55:39,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934086142] [2024-05-12 12:55:39,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:55:39,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:55:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:55:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:55:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:55:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934086142] [2024-05-12 12:55:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934086142] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:55:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282508839] [2024-05-12 12:55:39,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-12 12:55:39,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:55:39,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:55:39,720 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:55:39,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-05-12 12:55:39,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-12 12:55:39,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:55:39,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-12 12:55:39,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:55:39,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:55:39,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:55:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 12:55:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282508839] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:55:39,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:55:39,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2024-05-12 12:55:39,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267324193] [2024-05-12 12:55:39,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:55:39,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-12 12:55:39,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:55:39,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-12 12:55:39,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-05-12 12:55:39,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:55:39,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 1383 transitions, 40666 flow. Second operand has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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-05-12 12:55:39,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:55:39,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:55:39,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:55:46,463 INFO L124 PetriNetUnfolderBase]: 9509/15292 cut-off events. [2024-05-12 12:55:46,463 INFO L125 PetriNetUnfolderBase]: For 903816/903816 co-relation queries the response was YES. [2024-05-12 12:55:46,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185345 conditions, 15292 events. 9509/15292 cut-off events. For 903816/903816 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 99907 event pairs, 103 based on Foata normal form. 115/15407 useless extension candidates. Maximal degree in co-relation 185142. Up to 7030 conditions per place. [2024-05-12 12:55:46,792 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 839 selfloop transitions, 796 changer transitions 4/1640 dead transitions. [2024-05-12 12:55:46,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 1640 transitions, 49235 flow [2024-05-12 12:55:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-12 12:55:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-05-12 12:55:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 246 transitions. [2024-05-12 12:55:46,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3514285714285714 [2024-05-12 12:55:46,794 INFO L175 Difference]: Start difference. First operand has 407 places, 1383 transitions, 40666 flow. Second operand 25 states and 246 transitions. [2024-05-12 12:55:46,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 1640 transitions, 49235 flow [2024-05-12 12:56:00,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 1640 transitions, 48876 flow, removed 130 selfloop flow, removed 9 redundant places. [2024-05-12 12:56:00,038 INFO L231 Difference]: Finished difference. Result has 429 places, 1453 transitions, 45596 flow [2024-05-12 12:56:00,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=40123, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=728, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=45596, PETRI_PLACES=429, PETRI_TRANSITIONS=1453} [2024-05-12 12:56:00,039 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 399 predicate places. [2024-05-12 12:56:00,039 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 1453 transitions, 45596 flow [2024-05-12 12:56:00,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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-05-12 12:56:00,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:56:00,040 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:56:00,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-05-12 12:56:00,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:56:00,244 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:56:00,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:56:00,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1139659662, now seen corresponding path program 16 times [2024-05-12 12:56:00,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:56:00,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560347168] [2024-05-12 12:56:00,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:56:00,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:56:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:56:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:56:00,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:56:00,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560347168] [2024-05-12 12:56:00,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560347168] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:56:00,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290698678] [2024-05-12 12:56:00,312 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-12 12:56:00,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:56:00,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:56:00,316 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:56:00,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-05-12 12:56:00,387 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-12 12:56:00,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:56:00,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-12 12:56:00,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:56:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:56:00,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:56:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:56:00,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290698678] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:56:00,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:56:00,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 8 [2024-05-12 12:56:00,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777066464] [2024-05-12 12:56:00,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:56:00,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:56:00,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:56:00,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:56:00,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:56:00,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2024-05-12 12:56:00,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 1453 transitions, 45596 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:56:00,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:56:00,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2024-05-12 12:56:00,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:56:03,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L42-->L44: Formula: (= (+ v_~counter~0_18 1) v_~counter~0_17) InVars {~counter~0=v_~counter~0_18} OutVars{~counter~0=v_~counter~0_17, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1][443], [Black: 2805#(and (<= 0 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), 3421#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 2810#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), Black: 2592#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0)), 18#L44true, Black: 2791#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 2784#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), 3034#(<= 0 ~counter~0), Black: 2601#(<= 0 ~counter~0), Black: 2802#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), Black: 2812#(and (<= 0 ~counter~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), Black: 2787#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 2799#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0)), Black: 2797#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 2561#(and (<= thread2Thread1of1ForFork1_~i~1 1) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork1_~i~1 ~M~0)), Black: 2577#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 2380#(and (= thread1Thread1of1ForFork0_~i~0 0) (= ~counter~0 0)), Black: 2416#(<= 0 thread1Thread1of1ForFork0_~i~0), Black: 2501#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))), Black: 2574#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))), 1400#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 2377#true, 2559#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), Black: 38#(= ~counter~0 0), Black: 551#(and (or (< 0 thread1Thread1of1ForFork0_~i~0) (= ~counter~0 0)) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (or (< thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (= ~counter~0 0)) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 539#(and (or (< 0 thread1Thread1of1ForFork0_~i~0) (= ~counter~0 0)) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 549#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), 27#L73true, Black: 49#(<= 0 ~counter~0), Black: 55#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1332#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 1149#(<= 1 thread1Thread1of1ForFork0_~i~0), Black: 1063#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), 771#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 1108#(<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0), Black: 1048#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 1533#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 861#(= ~counter~0 0), Black: 1160#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0)), Black: 1042#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1591#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (or (= ~counter~0 0) (< thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 1266#(and (= thread1Thread1of1ForFork0_~i~0 0) (= ~counter~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1588#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 1317#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 1067#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 1329#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0)), Black: 1326#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0)), 1044#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0)), Black: 1334#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 863#(and (<= 1 ~counter~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1073#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0)), Black: 1100#true, Black: 865#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (= thread2Thread1of1ForFork1_~i~1 0)), 2779#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 791#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 1283#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 2247#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0)), Black: 2371#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 1307#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0)), Black: 862#(and (= thread1Thread1of1ForFork0_~i~0 0) (= ~counter~0 0)), Black: 738#(and (<= 1 ~counter~0) (= thread1Thread1of1ForFork0_~i~0 0) (<= 1 |#ghost~multithreaded|)), Black: 872#(<= 0 ~counter~0), Black: 784#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 1321#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 1164#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1)), Black: 810#(and (<= 2 ~counter~0) (<= 2 ~M~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 |#ghost~multithreaded|)), Black: 2368#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0)), Black: 1059#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 818#(and (<= 2 ~M~0) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 1040#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= 1 ~M~0)), 1869#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 864#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 1070#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 747#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 754#(and (<= 2 ~counter~0) (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 |#ghost~multithreaded|)), Black: 781#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 830#(and (<= 2 ~counter~0) (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 |#ghost~multithreaded|)), 208#(= ~counter~0 1), Black: 741#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 764#(and (<= 2 ~counter~0) (<= 2 ~M~0) (<= 1 |#ghost~multithreaded|)), Black: 762#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 828#(and (<= 2 ~M~0) (<= 0 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 820#(and (<= 2 ~M~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 797#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 207#(= ~counter~0 0), Black: 816#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 768#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 1851#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 1856#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 1616#(<= 0 ~counter~0), Black: 1878#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0)), Black: 1835#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 1838#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 1814#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 1807#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1797#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1831#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), 2113#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0)), Black: 1846#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0)), Black: 1816#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 1872#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 1820#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1874#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 1860#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0)), Black: 1844#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 1863#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 1867#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 1841#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), 3467#(= ~counter~0 1), Black: 2109#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1945#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 1952#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 3446#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0)), Black: 2149#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 2139#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0)), Black: 3433#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 2157#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0)), Black: 3450#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 3452#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 2166#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 1917#(<= 0 ~counter~0), Black: 3443#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 2136#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 3423#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 3244#(<= 0 ~counter~0), Black: 2129#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 3438#(and (<= 0 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 2119#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 2117#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), 2841#(<= 0 ~counter~0), Black: 2146#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 3194#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 3215#(and (<= 0 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 3199#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 3218#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), 48#(<= 1 ~counter~0), Black: 3220#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 3207#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= ~M~0 1) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 3212#(and (<= 0 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), 386#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), 12#L53true, 1311#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0)), Black: 2999#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 57#true, Black: 3005#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (or (< thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (= ~counter~0 0))), Black: 61#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 3011#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 3014#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (or (< thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (= ~counter~0 0))), Black: 3008#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), 149#(< thread2Thread1of1ForFork1_~i~1 ~M~0), Black: 2795#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))]) [2024-05-12 12:56:03,547 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-05-12 12:56:03,547 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-05-12 12:56:03,547 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-05-12 12:56:03,547 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 12:56:04,189 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L42-->L44: Formula: (= (+ v_~counter~0_18 1) v_~counter~0_17) InVars {~counter~0=v_~counter~0_18} OutVars{~counter~0=v_~counter~0_17, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1][443], [Black: 2805#(and (<= 0 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), 3421#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 2810#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), Black: 2592#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0)), 18#L44true, Black: 2791#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 2784#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), 3034#(<= 0 ~counter~0), Black: 2601#(<= 0 ~counter~0), Black: 2802#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), Black: 2812#(and (<= 0 ~counter~0) (<= (+ 2 thread2Thread1of1ForFork1_~i~1) ~M~0)), Black: 2787#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 2799#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0)), Black: 2797#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 2561#(and (<= thread2Thread1of1ForFork1_~i~1 1) (= thread1Thread1of1ForFork0_~i~0 0) (<= thread2Thread1of1ForFork1_~i~1 ~M~0)), Black: 2577#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 2380#(and (= thread1Thread1of1ForFork0_~i~0 0) (= ~counter~0 0)), Black: 2416#(<= 0 thread1Thread1of1ForFork0_~i~0), Black: 2501#(or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0))), Black: 2574#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))), 1400#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 2377#true, 2559#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< ~M~0 (+ 2 thread1Thread1of1ForFork0_~i~0)))), Black: 38#(= ~counter~0 0), Black: 551#(and (or (< 0 thread1Thread1of1ForFork0_~i~0) (= ~counter~0 0)) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (or (< thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (= ~counter~0 0)) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 539#(and (or (< 0 thread1Thread1of1ForFork0_~i~0) (= ~counter~0 0)) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 549#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 49#(<= 0 ~counter~0), Black: 55#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 1332#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 1149#(<= 1 thread1Thread1of1ForFork0_~i~0), Black: 1063#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), 771#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 1108#(<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0), Black: 1048#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 1533#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 861#(= ~counter~0 0), Black: 1160#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0)), Black: 1042#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1591#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (or (= ~counter~0 0) (< thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 1266#(and (= thread1Thread1of1ForFork0_~i~0 0) (= ~counter~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1588#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 1317#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 1067#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 1329#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0)), Black: 1326#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0)), 1044#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0)), Black: 1334#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 863#(and (<= 1 ~counter~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1073#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0)), Black: 1100#true, Black: 865#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 1283#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 0)), 2779#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 791#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 2247#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0)), Black: 2371#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 1307#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0)), Black: 862#(and (= thread1Thread1of1ForFork0_~i~0 0) (= ~counter~0 0)), Black: 738#(and (<= 1 ~counter~0) (= thread1Thread1of1ForFork0_~i~0 0) (<= 1 |#ghost~multithreaded|)), Black: 872#(<= 0 ~counter~0), Black: 784#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 1321#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 1164#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1)), Black: 810#(and (<= 2 ~counter~0) (<= 2 ~M~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 |#ghost~multithreaded|)), Black: 2368#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0)), Black: 1059#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 818#(and (<= 2 ~M~0) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 1040#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= 1 ~M~0)), 1869#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 864#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 1070#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 747#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 754#(and (<= 2 ~counter~0) (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 |#ghost~multithreaded|)), Black: 781#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 830#(and (<= 2 ~counter~0) (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 |#ghost~multithreaded|)), 208#(= ~counter~0 1), Black: 741#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 764#(and (<= 2 ~counter~0) (<= 2 ~M~0) (<= 1 |#ghost~multithreaded|)), Black: 762#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 828#(and (<= 2 ~M~0) (<= 0 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 820#(and (<= 2 ~M~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 797#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 207#(= ~counter~0 0), Black: 816#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 768#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= 1 |#ghost~multithreaded|)), Black: 1851#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 1856#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 1616#(<= 0 ~counter~0), Black: 1878#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0)), Black: 1835#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 1838#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 1814#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 1807#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1797#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1831#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), 2113#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0)), Black: 1846#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0)), Black: 1816#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 1872#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 1820#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1874#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 1860#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0)), Black: 1844#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 1863#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 1867#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 1841#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), 3467#(= ~counter~0 1), Black: 2109#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1945#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 1952#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), Black: 3446#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0)), Black: 2149#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 2139#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0)), Black: 3433#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 2157#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0)), Black: 3450#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 3452#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 2166#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 1917#(<= 0 ~counter~0), Black: 3443#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 2136#(and (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 3423#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 3244#(<= 0 ~counter~0), Black: 2129#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 3438#(and (<= 0 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 2119#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 0 ~counter~0)), Black: 2117#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), 2841#(<= 0 ~counter~0), Black: 2146#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0) (<= 1 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0)), Black: 3194#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 3215#(and (<= 0 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1)) (<= ~M~0 (+ thread1Thread1of1ForFork0_~i~0 1))), Black: 3199#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 3218#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), 48#(<= 1 ~counter~0), Black: 3220#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 3207#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= ~M~0 1) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 3212#(and (<= 0 ~counter~0) (<= thread2Thread1of1ForFork1_~i~1 (+ thread1Thread1of1ForFork0_~i~0 1))), 386#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0)), 12#L53true, 1311#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M~0)), Black: 2999#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), Black: 57#true, Black: 3005#(and (<= thread2Thread1of1ForFork1_~i~1 1) (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (or (< thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (= ~counter~0 0))), Black: 61#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= 1 ~M~0)), Black: 3011#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (<= ~M~0 thread1Thread1of1ForFork0_~i~0)), Black: 3014#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0) (or (< thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (= ~counter~0 0))), Black: 3008#(and (<= thread2Thread1of1ForFork1_~i~1 thread1Thread1of1ForFork0_~i~0) (<= 0 ~counter~0)), 29#L73-2true, 149#(< thread2Thread1of1ForFork1_~i~1 ~M~0), Black: 2795#(and (<= 2 ~M~0) (<= thread2Thread1of1ForFork1_~i~1 1) (<= 0 ~counter~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) thread1Thread1of1ForFork0_~i~0))]) [2024-05-12 12:56:04,189 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-05-12 12:56:04,189 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-05-12 12:56:04,189 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-05-12 12:56:04,189 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 12:56:09,134 INFO L124 PetriNetUnfolderBase]: 11770/20329 cut-off events. [2024-05-12 12:56:09,134 INFO L125 PetriNetUnfolderBase]: For 1391264/1393312 co-relation queries the response was YES. [2024-05-12 12:56:09,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266838 conditions, 20329 events. 11770/20329 cut-off events. For 1391264/1393312 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 157314 event pairs, 558 based on Foata normal form. 573/20480 useless extension candidates. Maximal degree in co-relation 265065. Up to 6974 conditions per place. [2024-05-12 12:56:09,490 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 1357 selfloop transitions, 428 changer transitions 197/2320 dead transitions. [2024-05-12 12:56:09,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 2320 transitions, 75786 flow [2024-05-12 12:56:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:56:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:56:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-05-12 12:56:09,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-05-12 12:56:09,493 INFO L175 Difference]: Start difference. First operand has 429 places, 1453 transitions, 45596 flow. Second operand 5 states and 95 transitions. [2024-05-12 12:56:09,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 2320 transitions, 75786 flow [2024-05-12 12:56:37,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 2320 transitions, 75316 flow, removed 124 selfloop flow, removed 16 redundant places. [2024-05-12 12:56:37,140 INFO L231 Difference]: Finished difference. Result has 419 places, 1696 transitions, 56976 flow [2024-05-12 12:56:37,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=45287, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1025, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56976, PETRI_PLACES=419, PETRI_TRANSITIONS=1696} [2024-05-12 12:56:37,141 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 389 predicate places. [2024-05-12 12:56:37,141 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 1696 transitions, 56976 flow [2024-05-12 12:56:37,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:56:37,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:56:37,142 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:56:37,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-05-12 12:56:37,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:56:37,342 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:56:37,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:56:37,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1207031594, now seen corresponding path program 17 times [2024-05-12 12:56:37,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:56:37,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834968695] [2024-05-12 12:56:37,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:56:37,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:56:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:56:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:56:37,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:56:37,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834968695] [2024-05-12 12:56:37,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834968695] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:56:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676309165] [2024-05-12 12:56:37,470 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-12 12:56:37,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:56:37,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:56:37,476 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:56:37,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-05-12 12:56:37,559 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-05-12 12:56:37,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:56:37,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-12 12:56:37,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:56:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:56:37,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:56:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:56:37,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676309165] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:56:37,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:56:37,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-05-12 12:56:37,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452035682] [2024-05-12 12:56:37,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:56:37,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-12 12:56:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:56:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-12 12:56:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-05-12 12:56:37,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:56:37,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 1696 transitions, 56976 flow. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:56:37,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:56:37,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:56:37,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:56:50,116 INFO L124 PetriNetUnfolderBase]: 15470/24905 cut-off events. [2024-05-12 12:56:50,116 INFO L125 PetriNetUnfolderBase]: For 1616279/1616279 co-relation queries the response was YES. [2024-05-12 12:56:50,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320082 conditions, 24905 events. 15470/24905 cut-off events. For 1616279/1616279 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 175503 event pairs, 399 based on Foata normal form. 134/25039 useless extension candidates. Maximal degree in co-relation 318405. Up to 12038 conditions per place. [2024-05-12 12:56:50,697 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 1105 selfloop transitions, 982 changer transitions 83/2171 dead transitions. [2024-05-12 12:56:50,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 2171 transitions, 72382 flow [2024-05-12 12:56:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-12 12:56:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-05-12 12:56:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 202 transitions. [2024-05-12 12:56:50,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42436974789915966 [2024-05-12 12:56:50,699 INFO L175 Difference]: Start difference. First operand has 419 places, 1696 transitions, 56976 flow. Second operand 17 states and 202 transitions. [2024-05-12 12:56:50,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 2171 transitions, 72382 flow [2024-05-12 12:57:23,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 2171 transitions, 72104 flow, removed 132 selfloop flow, removed 1 redundant places. [2024-05-12 12:57:23,958 INFO L231 Difference]: Finished difference. Result has 442 places, 1813 transitions, 64513 flow [2024-05-12 12:57:23,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56741, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=875, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=780, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=64513, PETRI_PLACES=442, PETRI_TRANSITIONS=1813} [2024-05-12 12:57:23,960 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 412 predicate places. [2024-05-12 12:57:23,960 INFO L495 AbstractCegarLoop]: Abstraction has has 442 places, 1813 transitions, 64513 flow [2024-05-12 12:57:23,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:57:23,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:57:23,960 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:57:23,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-05-12 12:57:24,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:57:24,162 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:57:24,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:57:24,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2026985670, now seen corresponding path program 18 times [2024-05-12 12:57:24,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:57:24,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882862767] [2024-05-12 12:57:24,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:57:24,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:57:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:57:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:57:24,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:57:24,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882862767] [2024-05-12 12:57:24,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882862767] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:57:24,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164927849] [2024-05-12 12:57:24,294 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-12 12:57:24,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:57:24,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:57:24,296 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:57:24,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-05-12 12:57:24,373 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-05-12 12:57:24,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 12:57:24,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-12 12:57:24,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:57:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:57:24,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:57:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:57:24,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164927849] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:57:24,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:57:24,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 26 [2024-05-12 12:57:24,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207195069] [2024-05-12 12:57:24,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:57:24,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-12 12:57:24,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:57:24,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-12 12:57:24,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2024-05-12 12:57:24,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:57:24,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 1813 transitions, 64513 flow. Second operand has 26 states, 26 states have (on average 6.0) internal successors, (156), 26 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:57:24,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:57:24,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:57:24,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:57:43,305 INFO L124 PetriNetUnfolderBase]: 20141/32378 cut-off events. [2024-05-12 12:57:43,306 INFO L125 PetriNetUnfolderBase]: For 2342653/2342653 co-relation queries the response was YES. [2024-05-12 12:57:43,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439144 conditions, 32378 events. 20141/32378 cut-off events. For 2342653/2342653 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 235601 event pairs, 153 based on Foata normal form. 298/32676 useless extension candidates. Maximal degree in co-relation 437188. Up to 6070 conditions per place. [2024-05-12 12:57:44,180 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 1118 selfloop transitions, 2569 changer transitions 216/3904 dead transitions. [2024-05-12 12:57:44,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 3904 transitions, 131554 flow [2024-05-12 12:57:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-12 12:57:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2024-05-12 12:57:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 588 transitions. [2024-05-12 12:57:44,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2024-05-12 12:57:44,182 INFO L175 Difference]: Start difference. First operand has 442 places, 1813 transitions, 64513 flow. Second operand 58 states and 588 transitions. [2024-05-12 12:57:44,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 3904 transitions, 131554 flow [2024-05-12 12:58:40,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 3904 transitions, 131120 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-05-12 12:58:40,781 INFO L231 Difference]: Finished difference. Result has 526 places, 2951 transitions, 114197 flow [2024-05-12 12:58:40,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64159, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1458, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=114197, PETRI_PLACES=526, PETRI_TRANSITIONS=2951} [2024-05-12 12:58:40,786 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 496 predicate places. [2024-05-12 12:58:40,786 INFO L495 AbstractCegarLoop]: Abstraction has has 526 places, 2951 transitions, 114197 flow [2024-05-12 12:58:40,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.0) internal successors, (156), 26 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:40,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:58:40,786 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:58:40,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-05-12 12:58:40,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:58:40,989 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 12:58:40,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:58:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1256174572, now seen corresponding path program 19 times [2024-05-12 12:58:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:58:40,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500813890] [2024-05-12 12:58:40,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:58:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:58:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:41,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:58:41,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500813890] [2024-05-12 12:58:41,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500813890] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 12:58:41,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791944110] [2024-05-12 12:58:41,139 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-12 12:58:41,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 12:58:41,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:58:41,140 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 12:58:41,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-05-12 12:58:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:58:41,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-12 12:58:41,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 12:58:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:41,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 12:58:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:58:41,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791944110] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 12:58:41,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 12:58:41,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 29 [2024-05-12 12:58:41,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565770502] [2024-05-12 12:58:41,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 12:58:41,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-05-12 12:58:41,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:58:41,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-05-12 12:58:41,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2024-05-12 12:58:41,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2024-05-12 12:58:41,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 2951 transitions, 114197 flow. Second operand has 29 states, 29 states have (on average 5.827586206896552) internal successors, (169), 29 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:58:41,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:58:41,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2024-05-12 12:58:41,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand