./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-buffer-series2.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-buffer-series2.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-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:07:17,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:07:18,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:07:18,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:07:18,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:07:18,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:07:18,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:07:18,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:07:18,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:07:18,045 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:07:18,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:07:18,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:07:18,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:07:18,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:07:18,047 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:07:18,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:07:18,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:07:18,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:07:18,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:07:18,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:07:18,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:07:18,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:07:18,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:07:18,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:07:18,052 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:07:18,052 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:07:18,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:07:18,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:07:18,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:07:18,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:07:18,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:07:18,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:07:18,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:07:18,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:07:18,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:07:18,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:07:18,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:07:18,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:07:18,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:07:18,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:07:18,056 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:07:18,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:07:18,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:07:18,057 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-28 01:07:18,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:07:18,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:07:18,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:07:18,337 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:07:18,338 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:07:18,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-buffer-series2.wvr.yml/witness.yml [2024-06-28 01:07:18,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:07:18,454 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:07:18,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-06-28 01:07:19,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:07:19,795 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:07:19,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-06-28 01:07:19,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5912e5f45/432a9e8a3d614382b30a808cd57f1d60/FLAGa4b7c7429 [2024-06-28 01:07:19,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5912e5f45/432a9e8a3d614382b30a808cd57f1d60 [2024-06-28 01:07:19,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:07:19,813 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:07:19,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:07:19,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:07:19,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:07:19,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:07:18" (1/2) ... [2024-06-28 01:07:19,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72babd5b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:19, skipping insertion in model container [2024-06-28 01:07:19,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:07:18" (1/2) ... [2024-06-28 01:07:19,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2e0d009a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:19, skipping insertion in model container [2024-06-28 01:07:19,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:07:19" (2/2) ... [2024-06-28 01:07:19,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72babd5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:19, skipping insertion in model container [2024-06-28 01:07:19,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:07:19" (2/2) ... [2024-06-28 01:07:19,822 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:07:19,841 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:07:19,842 INFO L97 edCorrectnessWitness]: Location invariant before [L143-L143] ((! multithreaded || 0 <= i) && (! multithreaded || 0 <= j)) && (! multithreaded || (0 <= i && 0 <= j)) [2024-06-28 01:07:19,842 INFO L97 edCorrectnessWitness]: Location invariant before [L145-L145] ((! multithreaded || 0 <= i) && (! multithreaded || 0 <= j)) && (! multithreaded || (0 <= i && 0 <= j)) [2024-06-28 01:07:19,842 INFO L97 edCorrectnessWitness]: Location invariant before [L144-L144] ((! multithreaded || 0 <= i) && (! multithreaded || 0 <= j)) && (! multithreaded || (0 <= i && 0 <= j)) [2024-06-28 01:07:19,842 INFO L97 edCorrectnessWitness]: Location invariant before [L142-L142] ((! multithreaded || 0 <= i) && (! multithreaded || 0 <= j)) && (! multithreaded || (0 <= i && 0 <= j)) [2024-06-28 01:07:19,843 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:07:19,843 INFO L106 edCorrectnessWitness]: ghost_update [L141-L141] multithreaded = 1; [2024-06-28 01:07:19,866 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:07:20,064 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-06-28 01:07:20,083 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:07:20,094 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:07:20,149 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-06-28 01:07:20,153 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:07:20,165 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:07:20,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20 WrapperNode [2024-06-28 01:07:20,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:07:20,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:07:20,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:07:20,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:07:20,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (1/1) ... [2024-06-28 01:07:20,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (1/1) ... [2024-06-28 01:07:20,221 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 343 [2024-06-28 01:07:20,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:07:20,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:07:20,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:07:20,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:07:20,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (1/1) ... [2024-06-28 01:07:20,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (1/1) ... [2024-06-28 01:07:20,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (1/1) ... [2024-06-28 01:07:20,251 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-06-28 01:07:20,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (1/1) ... [2024-06-28 01:07:20,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (1/1) ... [2024-06-28 01:07:20,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (1/1) ... [2024-06-28 01:07:20,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (1/1) ... [2024-06-28 01:07:20,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (1/1) ... [2024-06-28 01:07:20,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (1/1) ... [2024-06-28 01:07:20,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:07:20,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:07:20,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:07:20,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:07:20,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (1/1) ... [2024-06-28 01:07:20,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:07:20,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:07:20,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 01:07:20,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 01:07:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:07:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 01:07:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 01:07:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 01:07:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 01:07:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-28 01:07:20,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-28 01:07:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-28 01:07:20,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-28 01:07:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-28 01:07:20,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-28 01:07:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-28 01:07:20,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-28 01:07:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:07:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 01:07:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:07:20,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:07:20,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-28 01:07:20,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:07:20,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:07:20,385 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:07:20,500 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:07:20,502 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:07:20,833 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:07:20,834 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:07:21,185 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:07:21,186 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-06-28 01:07:21,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:07:21 BoogieIcfgContainer [2024-06-28 01:07:21,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:07:21,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:07:21,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:07:21,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:07:21,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:07:18" (1/4) ... [2024-06-28 01:07:21,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2ca65a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:07:21, skipping insertion in model container [2024-06-28 01:07:21,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:07:19" (2/4) ... [2024-06-28 01:07:21,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2ca65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:07:21, skipping insertion in model container [2024-06-28 01:07:21,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:20" (3/4) ... [2024-06-28 01:07:21,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2ca65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:07:21, skipping insertion in model container [2024-06-28 01:07:21,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:07:21" (4/4) ... [2024-06-28 01:07:21,214 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2024-06-28 01:07:21,230 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:07:21,231 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 01:07:21,231 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:07:21,290 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-28 01:07:21,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 59 transitions, 146 flow [2024-06-28 01:07:21,351 INFO L124 PetriNetUnfolderBase]: 7/55 cut-off events. [2024-06-28 01:07:21,352 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-28 01:07:21,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 7/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-06-28 01:07:21,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 59 transitions, 146 flow [2024-06-28 01:07:21,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 54 transitions, 132 flow [2024-06-28 01:07:21,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:07:21,380 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;@ca51f44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:07:21,380 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-28 01:07:21,386 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:07:21,386 INFO L124 PetriNetUnfolderBase]: 3/12 cut-off events. [2024-06-28 01:07:21,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:07:21,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:21,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:21,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:21,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:21,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1215902037, now seen corresponding path program 1 times [2024-06-28 01:07:21,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:21,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589601238] [2024-06-28 01:07:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:21,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:21,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:21,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589601238] [2024-06-28 01:07:21,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589601238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:21,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:21,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:07:21,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925031045] [2024-06-28 01:07:21,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:21,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:07:21,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:21,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:07:21,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:07:21,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-28 01:07:21,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:21,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:21,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-28 01:07:21,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:22,234 INFO L124 PetriNetUnfolderBase]: 1246/2108 cut-off events. [2024-06-28 01:07:22,234 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-06-28 01:07:22,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4058 conditions, 2108 events. 1246/2108 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 13798 event pairs, 448 based on Foata normal form. 54/2003 useless extension candidates. Maximal degree in co-relation 3515. Up to 1117 conditions per place. [2024-06-28 01:07:22,259 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 56 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-06-28 01:07:22,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 315 flow [2024-06-28 01:07:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:07:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:07:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-06-28 01:07:22,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7401129943502824 [2024-06-28 01:07:22,275 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 132 flow. Second operand 3 states and 131 transitions. [2024-06-28 01:07:22,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 315 flow [2024-06-28 01:07:22,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 285 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:07:22,285 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 134 flow [2024-06-28 01:07:22,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2024-06-28 01:07:22,289 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2024-06-28 01:07:22,289 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 134 flow [2024-06-28 01:07:22,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:22,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:22,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:22,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:07:22,292 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:22,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:22,292 INFO L85 PathProgramCache]: Analyzing trace with hash 568481228, now seen corresponding path program 1 times [2024-06-28 01:07:22,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:22,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636213097] [2024-06-28 01:07:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:22,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:22,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:22,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636213097] [2024-06-28 01:07:22,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636213097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:22,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:22,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:07:22,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760454480] [2024-06-28 01:07:22,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:22,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:07:22,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:22,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:07:22,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:07:22,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-06-28 01:07:22,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:22,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:22,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-06-28 01:07:22,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:22,707 INFO L124 PetriNetUnfolderBase]: 1373/2451 cut-off events. [2024-06-28 01:07:22,707 INFO L125 PetriNetUnfolderBase]: For 364/366 co-relation queries the response was YES. [2024-06-28 01:07:22,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 2451 events. 1373/2451 cut-off events. For 364/366 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17139 event pairs, 1167 based on Foata normal form. 111/2373 useless extension candidates. Maximal degree in co-relation 2468. Up to 1503 conditions per place. [2024-06-28 01:07:22,723 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 57 selfloop transitions, 7 changer transitions 0/87 dead transitions. [2024-06-28 01:07:22,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 87 transitions, 334 flow [2024-06-28 01:07:22,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:07:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:07:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2024-06-28 01:07:22,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2024-06-28 01:07:22,731 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 134 flow. Second operand 5 states and 200 transitions. [2024-06-28 01:07:22,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 87 transitions, 334 flow [2024-06-28 01:07:22,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 332 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:22,735 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 186 flow [2024-06-28 01:07:22,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2024-06-28 01:07:22,739 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2024-06-28 01:07:22,740 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 186 flow [2024-06-28 01:07:22,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:22,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:22,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:22,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:07:22,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:22,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1868013397, now seen corresponding path program 1 times [2024-06-28 01:07:22,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:22,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314804844] [2024-06-28 01:07:22,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:22,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:07:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:22,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314804844] [2024-06-28 01:07:22,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314804844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:22,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:22,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:07:22,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969991322] [2024-06-28 01:07:22,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:22,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:07:22,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:22,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:07:22,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:07:22,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-28 01:07:22,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:22,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:22,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-28 01:07:22,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:23,139 INFO L124 PetriNetUnfolderBase]: 1307/2357 cut-off events. [2024-06-28 01:07:23,140 INFO L125 PetriNetUnfolderBase]: For 556/556 co-relation queries the response was YES. [2024-06-28 01:07:23,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4765 conditions, 2357 events. 1307/2357 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16482 event pairs, 667 based on Foata normal form. 80/2289 useless extension candidates. Maximal degree in co-relation 3742. Up to 1072 conditions per place. [2024-06-28 01:07:23,156 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 58 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-06-28 01:07:23,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 343 flow [2024-06-28 01:07:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:07:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:07:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-06-28 01:07:23,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.635593220338983 [2024-06-28 01:07:23,158 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 186 flow. Second operand 4 states and 150 transitions. [2024-06-28 01:07:23,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 343 flow [2024-06-28 01:07:23,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 339 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:23,161 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 170 flow [2024-06-28 01:07:23,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2024-06-28 01:07:23,161 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2024-06-28 01:07:23,162 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 170 flow [2024-06-28 01:07:23,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:23,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:23,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:23,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:07:23,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:23,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:23,163 INFO L85 PathProgramCache]: Analyzing trace with hash -554483795, now seen corresponding path program 1 times [2024-06-28 01:07:23,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:23,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481820842] [2024-06-28 01:07:23,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:23,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:23,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:23,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481820842] [2024-06-28 01:07:23,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481820842] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:23,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:23,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:07:23,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631201526] [2024-06-28 01:07:23,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:23,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:07:23,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:23,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:07:23,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:07:23,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-06-28 01:07:23,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:23,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:23,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-06-28 01:07:23,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:23,564 INFO L124 PetriNetUnfolderBase]: 2123/3647 cut-off events. [2024-06-28 01:07:23,564 INFO L125 PetriNetUnfolderBase]: For 1193/1193 co-relation queries the response was YES. [2024-06-28 01:07:23,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7453 conditions, 3647 events. 2123/3647 cut-off events. For 1193/1193 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 24451 event pairs, 623 based on Foata normal form. 3/3444 useless extension candidates. Maximal degree in co-relation 6111. Up to 1840 conditions per place. [2024-06-28 01:07:23,590 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 51 selfloop transitions, 3 changer transitions 1/74 dead transitions. [2024-06-28 01:07:23,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 74 transitions, 329 flow [2024-06-28 01:07:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:07:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:07:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2024-06-28 01:07:23,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7288135593220338 [2024-06-28 01:07:23,592 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 170 flow. Second operand 3 states and 129 transitions. [2024-06-28 01:07:23,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 74 transitions, 329 flow [2024-06-28 01:07:23,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:07:23,594 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 188 flow [2024-06-28 01:07:23,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2024-06-28 01:07:23,596 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2024-06-28 01:07:23,596 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 188 flow [2024-06-28 01:07:23,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:23,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:23,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:23,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:07:23,597 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:23,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:23,597 INFO L85 PathProgramCache]: Analyzing trace with hash -630054218, now seen corresponding path program 1 times [2024-06-28 01:07:23,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:23,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827739840] [2024-06-28 01:07:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:23,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:23,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827739840] [2024-06-28 01:07:23,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827739840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:23,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:23,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:07:23,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106475241] [2024-06-28 01:07:23,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:23,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:07:23,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:23,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:07:23,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:07:23,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-06-28 01:07:23,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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-06-28 01:07:23,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:23,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-06-28 01:07:23,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:24,074 INFO L124 PetriNetUnfolderBase]: 2585/4306 cut-off events. [2024-06-28 01:07:24,075 INFO L125 PetriNetUnfolderBase]: For 1955/1955 co-relation queries the response was YES. [2024-06-28 01:07:24,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9650 conditions, 4306 events. 2585/4306 cut-off events. For 1955/1955 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 27997 event pairs, 761 based on Foata normal form. 55/4181 useless extension candidates. Maximal degree in co-relation 8015. Up to 2292 conditions per place. [2024-06-28 01:07:24,096 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 59 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2024-06-28 01:07:24,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 376 flow [2024-06-28 01:07:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:07:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:07:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2024-06-28 01:07:24,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7457627118644068 [2024-06-28 01:07:24,098 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 188 flow. Second operand 3 states and 132 transitions. [2024-06-28 01:07:24,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 376 flow [2024-06-28 01:07:24,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:24,101 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 199 flow [2024-06-28 01:07:24,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2024-06-28 01:07:24,101 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2024-06-28 01:07:24,101 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 199 flow [2024-06-28 01:07:24,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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-06-28 01:07:24,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:24,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:24,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:07:24,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:24,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:24,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1502444459, now seen corresponding path program 1 times [2024-06-28 01:07:24,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:24,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324584588] [2024-06-28 01:07:24,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:24,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:07:24,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:24,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324584588] [2024-06-28 01:07:24,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324584588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:24,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:24,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:07:24,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293021350] [2024-06-28 01:07:24,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:24,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:07:24,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:24,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:07:24,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:07:24,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-06-28 01:07:24,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-06-28 01:07:24,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:24,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-06-28 01:07:24,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:24,480 INFO L124 PetriNetUnfolderBase]: 2038/3445 cut-off events. [2024-06-28 01:07:24,481 INFO L125 PetriNetUnfolderBase]: For 1985/1985 co-relation queries the response was YES. [2024-06-28 01:07:24,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8011 conditions, 3445 events. 2038/3445 cut-off events. For 1985/1985 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 22199 event pairs, 799 based on Foata normal form. 66/3344 useless extension candidates. Maximal degree in co-relation 6237. Up to 1519 conditions per place. [2024-06-28 01:07:24,498 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 62 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-06-28 01:07:24,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 395 flow [2024-06-28 01:07:24,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:07:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:07:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-06-28 01:07:24,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7627118644067796 [2024-06-28 01:07:24,500 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 199 flow. Second operand 3 states and 135 transitions. [2024-06-28 01:07:24,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 395 flow [2024-06-28 01:07:24,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:24,502 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 207 flow [2024-06-28 01:07:24,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2024-06-28 01:07:24,503 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2024-06-28 01:07:24,503 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 207 flow [2024-06-28 01:07:24,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-06-28 01:07:24,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:24,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:24,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:07:24,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:24,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:24,504 INFO L85 PathProgramCache]: Analyzing trace with hash -736145751, now seen corresponding path program 1 times [2024-06-28 01:07:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:24,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062415316] [2024-06-28 01:07:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:07:24,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:24,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062415316] [2024-06-28 01:07:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062415316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:24,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:24,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:07:24,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261128215] [2024-06-28 01:07:24,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:24,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:07:24,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:24,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:07:24,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:07:24,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-06-28 01:07:24,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:24,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:24,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-06-28 01:07:24,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:25,044 INFO L124 PetriNetUnfolderBase]: 2623/4552 cut-off events. [2024-06-28 01:07:25,044 INFO L125 PetriNetUnfolderBase]: For 3401/3401 co-relation queries the response was YES. [2024-06-28 01:07:25,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10710 conditions, 4552 events. 2623/4552 cut-off events. For 3401/3401 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 32599 event pairs, 1964 based on Foata normal form. 128/4328 useless extension candidates. Maximal degree in co-relation 8469. Up to 2802 conditions per place. [2024-06-28 01:07:25,065 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 64 selfloop transitions, 5 changer transitions 2/90 dead transitions. [2024-06-28 01:07:25,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 457 flow [2024-06-28 01:07:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:07:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:07:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2024-06-28 01:07:25,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7033898305084746 [2024-06-28 01:07:25,067 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 207 flow. Second operand 4 states and 166 transitions. [2024-06-28 01:07:25,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 457 flow [2024-06-28 01:07:25,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 90 transitions, 443 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-28 01:07:25,070 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 229 flow [2024-06-28 01:07:25,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-06-28 01:07:25,070 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2024-06-28 01:07:25,071 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 229 flow [2024-06-28 01:07:25,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:25,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:25,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:25,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:07:25,071 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:25,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1149376626, now seen corresponding path program 1 times [2024-06-28 01:07:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:25,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783585368] [2024-06-28 01:07:25,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:25,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:07:25,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:25,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783585368] [2024-06-28 01:07:25,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783585368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:25,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:25,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:07:25,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809309315] [2024-06-28 01:07:25,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:25,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:07:25,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:25,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:07:25,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:07:25,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2024-06-28 01:07:25,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:25,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:25,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2024-06-28 01:07:25,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:26,267 INFO L124 PetriNetUnfolderBase]: 6719/11152 cut-off events. [2024-06-28 01:07:26,268 INFO L125 PetriNetUnfolderBase]: For 4655/4793 co-relation queries the response was YES. [2024-06-28 01:07:26,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25013 conditions, 11152 events. 6719/11152 cut-off events. For 4655/4793 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 84292 event pairs, 3171 based on Foata normal form. 6/10134 useless extension candidates. Maximal degree in co-relation 17527. Up to 3689 conditions per place. [2024-06-28 01:07:26,328 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 104 selfloop transitions, 10 changer transitions 0/130 dead transitions. [2024-06-28 01:07:26,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 130 transitions, 661 flow [2024-06-28 01:07:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:07:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:07:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 242 transitions. [2024-06-28 01:07:26,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6836158192090396 [2024-06-28 01:07:26,329 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 229 flow. Second operand 6 states and 242 transitions. [2024-06-28 01:07:26,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 130 transitions, 661 flow [2024-06-28 01:07:26,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 130 transitions, 651 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:26,332 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 268 flow [2024-06-28 01:07:26,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2024-06-28 01:07:26,333 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2024-06-28 01:07:26,333 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 268 flow [2024-06-28 01:07:26,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:26,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:26,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:26,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:07:26,334 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:26,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:26,335 INFO L85 PathProgramCache]: Analyzing trace with hash 142289687, now seen corresponding path program 1 times [2024-06-28 01:07:26,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:26,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307680888] [2024-06-28 01:07:26,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:26,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:07:26,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:26,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307680888] [2024-06-28 01:07:26,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307680888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:26,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:26,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:07:26,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708133902] [2024-06-28 01:07:26,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:26,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:07:26,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:26,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:07:26,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:07:26,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2024-06-28 01:07:26,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:26,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:26,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2024-06-28 01:07:26,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:27,422 INFO L124 PetriNetUnfolderBase]: 5999/10138 cut-off events. [2024-06-28 01:07:27,423 INFO L125 PetriNetUnfolderBase]: For 4887/4887 co-relation queries the response was YES. [2024-06-28 01:07:27,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22857 conditions, 10138 events. 5999/10138 cut-off events. For 4887/4887 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 78286 event pairs, 4324 based on Foata normal form. 0/9090 useless extension candidates. Maximal degree in co-relation 17255. Up to 7373 conditions per place. [2024-06-28 01:07:27,575 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 40 selfloop transitions, 6 changer transitions 34/96 dead transitions. [2024-06-28 01:07:27,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 96 transitions, 499 flow [2024-06-28 01:07:27,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:07:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:07:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-06-28 01:07:27,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5988700564971752 [2024-06-28 01:07:27,577 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 268 flow. Second operand 6 states and 212 transitions. [2024-06-28 01:07:27,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 96 transitions, 499 flow [2024-06-28 01:07:27,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 96 transitions, 491 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 01:07:27,581 INFO L231 Difference]: Finished difference. Result has 79 places, 62 transitions, 252 flow [2024-06-28 01:07:27,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=79, PETRI_TRANSITIONS=62} [2024-06-28 01:07:27,581 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 19 predicate places. [2024-06-28 01:07:27,582 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 62 transitions, 252 flow [2024-06-28 01:07:27,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:27,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:27,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:27,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:07:27,582 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:27,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash -840582992, now seen corresponding path program 1 times [2024-06-28 01:07:27,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:27,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587375523] [2024-06-28 01:07:27,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:07:27,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:27,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587375523] [2024-06-28 01:07:27,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587375523] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:07:27,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106211022] [2024-06-28 01:07:27,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:27,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:07:27,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:07:27,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-28 01:07:27,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-28 01:07:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:27,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-28 01:07:27,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:07:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:07:28,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:07:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:07:28,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106211022] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-28 01:07:28,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:07:28,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5] total 14 [2024-06-28 01:07:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762962249] [2024-06-28 01:07:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:28,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:07:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:07:28,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-06-28 01:07:28,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-06-28 01:07:28,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 62 transitions, 252 flow. Second operand has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:28,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:28,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-06-28 01:07:28,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:29,544 INFO L124 PetriNetUnfolderBase]: 7322/11154 cut-off events. [2024-06-28 01:07:29,545 INFO L125 PetriNetUnfolderBase]: For 5545/5647 co-relation queries the response was YES. [2024-06-28 01:07:29,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27485 conditions, 11154 events. 7322/11154 cut-off events. For 5545/5647 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 74643 event pairs, 435 based on Foata normal form. 408/10964 useless extension candidates. Maximal degree in co-relation 22363. Up to 1710 conditions per place. [2024-06-28 01:07:29,594 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 176 selfloop transitions, 28 changer transitions 4/221 dead transitions. [2024-06-28 01:07:29,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 221 transitions, 1135 flow [2024-06-28 01:07:29,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-28 01:07:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-28 01:07:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 509 transitions. [2024-06-28 01:07:29,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5751412429378531 [2024-06-28 01:07:29,596 INFO L175 Difference]: Start difference. First operand has 79 places, 62 transitions, 252 flow. Second operand 15 states and 509 transitions. [2024-06-28 01:07:29,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 221 transitions, 1135 flow [2024-06-28 01:07:29,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 221 transitions, 1101 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-28 01:07:29,631 INFO L231 Difference]: Finished difference. Result has 92 places, 78 transitions, 401 flow [2024-06-28 01:07:29,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=401, PETRI_PLACES=92, PETRI_TRANSITIONS=78} [2024-06-28 01:07:29,632 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 32 predicate places. [2024-06-28 01:07:29,632 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 78 transitions, 401 flow [2024-06-28 01:07:29,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:29,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:29,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:29,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-28 01:07:29,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-28 01:07:29,846 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:29,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash -92042765, now seen corresponding path program 1 times [2024-06-28 01:07:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:29,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620086216] [2024-06-28 01:07:29,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:07:30,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:30,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620086216] [2024-06-28 01:07:30,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620086216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:30,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:30,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:07:30,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502056814] [2024-06-28 01:07:30,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:30,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:07:30,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:30,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:07:30,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:07:30,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-06-28 01:07:30,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 78 transitions, 401 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:30,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:30,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-06-28 01:07:30,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:30,613 INFO L124 PetriNetUnfolderBase]: 3698/5756 cut-off events. [2024-06-28 01:07:30,613 INFO L125 PetriNetUnfolderBase]: For 13829/13925 co-relation queries the response was YES. [2024-06-28 01:07:30,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18626 conditions, 5756 events. 3698/5756 cut-off events. For 13829/13925 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 34674 event pairs, 515 based on Foata normal form. 258/5855 useless extension candidates. Maximal degree in co-relation 18587. Up to 3656 conditions per place. [2024-06-28 01:07:30,649 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 73 selfloop transitions, 8 changer transitions 1/106 dead transitions. [2024-06-28 01:07:30,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 106 transitions, 676 flow [2024-06-28 01:07:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:07:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:07:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-06-28 01:07:30,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5988700564971752 [2024-06-28 01:07:30,650 INFO L175 Difference]: Start difference. First operand has 92 places, 78 transitions, 401 flow. Second operand 6 states and 212 transitions. [2024-06-28 01:07:30,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 106 transitions, 676 flow [2024-06-28 01:07:30,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 106 transitions, 635 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-28 01:07:30,695 INFO L231 Difference]: Finished difference. Result has 91 places, 77 transitions, 378 flow [2024-06-28 01:07:30,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=378, PETRI_PLACES=91, PETRI_TRANSITIONS=77} [2024-06-28 01:07:30,696 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 31 predicate places. [2024-06-28 01:07:30,696 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 378 flow [2024-06-28 01:07:30,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:30,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:30,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:30,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:07:30,697 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:30,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:30,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2121369280, now seen corresponding path program 1 times [2024-06-28 01:07:30,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:30,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316596533] [2024-06-28 01:07:30,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-28 01:07:30,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:30,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316596533] [2024-06-28 01:07:30,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316596533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:30,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:30,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:07:30,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009300304] [2024-06-28 01:07:30,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:30,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:07:30,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:30,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:07:30,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:07:30,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-06-28 01:07:30,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 77 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:30,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:30,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-06-28 01:07:30,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:31,489 INFO L124 PetriNetUnfolderBase]: 3147/4949 cut-off events. [2024-06-28 01:07:31,489 INFO L125 PetriNetUnfolderBase]: For 12388/12483 co-relation queries the response was YES. [2024-06-28 01:07:31,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16586 conditions, 4949 events. 3147/4949 cut-off events. For 12388/12483 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 30334 event pairs, 333 based on Foata normal form. 221/5048 useless extension candidates. Maximal degree in co-relation 16548. Up to 3105 conditions per place. [2024-06-28 01:07:31,523 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 80 selfloop transitions, 13 changer transitions 0/117 dead transitions. [2024-06-28 01:07:31,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 117 transitions, 762 flow [2024-06-28 01:07:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:07:31,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:07:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions. [2024-06-28 01:07:31,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5907990314769975 [2024-06-28 01:07:31,525 INFO L175 Difference]: Start difference. First operand has 91 places, 77 transitions, 378 flow. Second operand 7 states and 244 transitions. [2024-06-28 01:07:31,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 117 transitions, 762 flow [2024-06-28 01:07:31,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 117 transitions, 712 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-28 01:07:31,555 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 418 flow [2024-06-28 01:07:31,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=418, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2024-06-28 01:07:31,558 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 30 predicate places. [2024-06-28 01:07:31,558 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 418 flow [2024-06-28 01:07:31,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:31,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:31,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:31,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:07:31,559 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:31,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:31,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1065707682, now seen corresponding path program 2 times [2024-06-28 01:07:31,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:31,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779181282] [2024-06-28 01:07:31,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:31,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-28 01:07:31,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:31,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779181282] [2024-06-28 01:07:31,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779181282] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:07:31,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910255620] [2024-06-28 01:07:31,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:07:31,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:07:31,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:07:31,737 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-28 01:07:31,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-28 01:07:31,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 01:07:31,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:07:31,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-28 01:07:31,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:07:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-28 01:07:31,901 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:07:31,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910255620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:31,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-28 01:07:31,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-06-28 01:07:31,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424814209] [2024-06-28 01:07:31,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:31,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:07:31,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:31,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:07:31,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:07:31,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-06-28 01:07:31,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 418 flow. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:31,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:31,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-06-28 01:07:31,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:32,636 INFO L124 PetriNetUnfolderBase]: 4516/7060 cut-off events. [2024-06-28 01:07:32,637 INFO L125 PetriNetUnfolderBase]: For 17342/17507 co-relation queries the response was YES. [2024-06-28 01:07:32,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23783 conditions, 7060 events. 4516/7060 cut-off events. For 17342/17507 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 45209 event pairs, 521 based on Foata normal form. 240/7129 useless extension candidates. Maximal degree in co-relation 23747. Up to 2747 conditions per place. [2024-06-28 01:07:32,707 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 94 selfloop transitions, 23 changer transitions 0/141 dead transitions. [2024-06-28 01:07:32,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 141 transitions, 946 flow [2024-06-28 01:07:32,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:07:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:07:32,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2024-06-28 01:07:32,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6468926553672316 [2024-06-28 01:07:32,709 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 418 flow. Second operand 6 states and 229 transitions. [2024-06-28 01:07:32,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 141 transitions, 946 flow [2024-06-28 01:07:32,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 141 transitions, 931 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-28 01:07:32,742 INFO L231 Difference]: Finished difference. Result has 96 places, 94 transitions, 601 flow [2024-06-28 01:07:32,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=601, PETRI_PLACES=96, PETRI_TRANSITIONS=94} [2024-06-28 01:07:32,743 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 36 predicate places. [2024-06-28 01:07:32,743 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 601 flow [2024-06-28 01:07:32,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:32,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:32,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:32,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-28 01:07:32,955 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,SelfDestructingSolverStorable12 [2024-06-28 01:07:32,956 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:32,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 752512292, now seen corresponding path program 1 times [2024-06-28 01:07:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:32,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102954556] [2024-06-28 01:07:32,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-28 01:07:33,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102954556] [2024-06-28 01:07:33,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102954556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:33,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:33,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:07:33,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989089887] [2024-06-28 01:07:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:33,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:07:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:33,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:07:33,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:07:33,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-06-28 01:07:33,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 601 flow. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:33,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:33,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-06-28 01:07:33,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:33,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][110], [408#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 44#L79true, 602#(<= ~q1_front~0 ~q1_back~0), Black: 74#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 595#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 454#(<= ~q2_front~0 ~q2_back~0), Black: 87#(= ~total~0 0), 7#L118true, 19#$Ultimate##0true, Black: 91#(= ~q2_back~0 ~q2_front~0), Black: 297#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 414#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 301#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 412#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 128#true, Black: 402#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 3#L52true, Black: 410#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 53#L145true, Black: 106#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 430#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 438#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 439#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 563#(<= (+ 1 ~q2_front~0) ~q2_back~0)]) [2024-06-28 01:07:33,734 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-28 01:07:33,734 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-28 01:07:33,735 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-28 01:07:33,735 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-28 01:07:33,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][110], [408#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 44#L79true, 602#(<= ~q1_front~0 ~q1_back~0), 56#thread3EXITtrue, Black: 74#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 595#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 454#(<= ~q2_front~0 ~q2_back~0), Black: 87#(= ~total~0 0), 7#L118true, Black: 91#(= ~q2_back~0 ~q2_front~0), Black: 297#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 414#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 301#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 412#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 128#true, Black: 402#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 3#L52true, Black: 410#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 106#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 38#L144-5true, Black: 430#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 438#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 439#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 563#(<= (+ 1 ~q2_front~0) ~q2_back~0)]) [2024-06-28 01:07:33,952 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-28 01:07:33,952 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-28 01:07:33,953 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-28 01:07:33,953 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 01:07:33,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][110], [408#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 44#L79true, 602#(<= ~q1_front~0 ~q1_back~0), Black: 74#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 595#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 454#(<= ~q2_front~0 ~q2_back~0), Black: 87#(= ~total~0 0), 7#L118true, 45#L100true, Black: 91#(= ~q2_back~0 ~q2_front~0), Black: 297#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 414#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 301#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 412#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 128#true, Black: 402#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 3#L52true, Black: 410#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 53#L145true, Black: 106#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 430#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 438#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 439#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 563#(<= (+ 1 ~q2_front~0) ~q2_back~0)]) [2024-06-28 01:07:33,954 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-28 01:07:33,954 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-28 01:07:33,954 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-28 01:07:33,954 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 01:07:34,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][110], [408#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 44#L79true, 602#(<= ~q1_front~0 ~q1_back~0), 56#thread3EXITtrue, Black: 74#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 595#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 454#(<= ~q2_front~0 ~q2_back~0), Black: 87#(= ~total~0 0), 7#L118true, Black: 91#(= ~q2_back~0 ~q2_front~0), Black: 297#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 414#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 301#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 412#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 128#true, Black: 402#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 3#L52true, Black: 410#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 53#L145true, Black: 106#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 430#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 438#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 439#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 563#(<= (+ 1 ~q2_front~0) ~q2_back~0)]) [2024-06-28 01:07:34,085 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-28 01:07:34,085 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 01:07:34,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-28 01:07:34,086 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-28 01:07:35,013 INFO L124 PetriNetUnfolderBase]: 10234/16505 cut-off events. [2024-06-28 01:07:35,013 INFO L125 PetriNetUnfolderBase]: For 79739/80436 co-relation queries the response was YES. [2024-06-28 01:07:35,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62814 conditions, 16505 events. 10234/16505 cut-off events. For 79739/80436 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 120394 event pairs, 2373 based on Foata normal form. 767/16702 useless extension candidates. Maximal degree in co-relation 62774. Up to 5097 conditions per place. [2024-06-28 01:07:35,225 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 148 selfloop transitions, 13 changer transitions 0/190 dead transitions. [2024-06-28 01:07:35,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 190 transitions, 1667 flow [2024-06-28 01:07:35,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:07:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:07:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2024-06-28 01:07:35,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-28 01:07:35,237 INFO L175 Difference]: Start difference. First operand has 96 places, 94 transitions, 601 flow. Second operand 6 states and 236 transitions. [2024-06-28 01:07:35,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 190 transitions, 1667 flow [2024-06-28 01:07:35,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 190 transitions, 1626 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-28 01:07:35,451 INFO L231 Difference]: Finished difference. Result has 103 places, 102 transitions, 681 flow [2024-06-28 01:07:35,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=681, PETRI_PLACES=103, PETRI_TRANSITIONS=102} [2024-06-28 01:07:35,451 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 43 predicate places. [2024-06-28 01:07:35,451 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 102 transitions, 681 flow [2024-06-28 01:07:35,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:35,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:35,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:35,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:07:35,452 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:35,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1293698332, now seen corresponding path program 2 times [2024-06-28 01:07:35,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:35,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625250964] [2024-06-28 01:07:35,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:35,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-28 01:07:35,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:35,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625250964] [2024-06-28 01:07:35,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625250964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:35,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:35,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:07:35,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451612814] [2024-06-28 01:07:35,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:35,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:07:35,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:07:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:07:35,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-06-28 01:07:35,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 102 transitions, 681 flow. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:35,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:35,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-06-28 01:07:35,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:36,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][112], [408#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 44#L79true, 602#(<= ~q1_front~0 ~q1_back~0), Black: 74#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 595#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 454#(<= ~q2_front~0 ~q2_back~0), Black: 87#(= ~total~0 0), 7#L118true, 19#$Ultimate##0true, Black: 91#(= ~q2_back~0 ~q2_front~0), Black: 608#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 297#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 603#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 414#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 606#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 301#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), 617#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 412#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 128#true, Black: 402#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 3#L52true, Black: 410#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 53#L145true, Black: 106#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 430#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 439#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 563#(<= (+ 1 ~q2_front~0) ~q2_back~0)]) [2024-06-28 01:07:36,274 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-28 01:07:36,274 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-28 01:07:36,275 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-28 01:07:36,275 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-28 01:07:37,650 INFO L124 PetriNetUnfolderBase]: 11585/18389 cut-off events. [2024-06-28 01:07:37,650 INFO L125 PetriNetUnfolderBase]: For 103109/103967 co-relation queries the response was YES. [2024-06-28 01:07:37,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77432 conditions, 18389 events. 11585/18389 cut-off events. For 103109/103967 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 131451 event pairs, 3616 based on Foata normal form. 977/18782 useless extension candidates. Maximal degree in co-relation 77388. Up to 11084 conditions per place. [2024-06-28 01:07:37,849 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 137 selfloop transitions, 12 changer transitions 0/178 dead transitions. [2024-06-28 01:07:37,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 178 transitions, 1609 flow [2024-06-28 01:07:37,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:07:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:07:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2024-06-28 01:07:37,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6053268765133172 [2024-06-28 01:07:37,850 INFO L175 Difference]: Start difference. First operand has 103 places, 102 transitions, 681 flow. Second operand 7 states and 250 transitions. [2024-06-28 01:07:37,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 178 transitions, 1609 flow [2024-06-28 01:07:38,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 178 transitions, 1596 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:38,098 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 760 flow [2024-06-28 01:07:38,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=760, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2024-06-28 01:07:38,099 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 50 predicate places. [2024-06-28 01:07:38,099 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 760 flow [2024-06-28 01:07:38,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:38,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:38,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:38,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:07:38,100 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:38,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1356038069, now seen corresponding path program 1 times [2024-06-28 01:07:38,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:38,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056264151] [2024-06-28 01:07:38,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:38,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:39,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:39,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056264151] [2024-06-28 01:07:39,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056264151] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:07:39,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908269864] [2024-06-28 01:07:39,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:39,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:07:39,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:07:39,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-28 01:07:39,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-28 01:07:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:39,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 29 conjunts are in the unsatisfiable core [2024-06-28 01:07:39,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:07:40,344 INFO L349 Elim1Store]: treesize reduction 16, result has 69.8 percent of original size [2024-06-28 01:07:40,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 50 [2024-06-28 01:07:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:07:40,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:07:40,682 INFO L349 Elim1Store]: treesize reduction 19, result has 92.5 percent of original size [2024-06-28 01:07:40,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 65 treesize of output 250 [2024-06-28 01:07:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:07:45,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908269864] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:07:45,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:07:45,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 20 [2024-06-28 01:07:45,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784889339] [2024-06-28 01:07:45,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:07:45,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-28 01:07:45,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:45,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-28 01:07:45,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-06-28 01:07:46,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-28 01:07:46,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 760 flow. Second operand has 21 states, 21 states have (on average 26.952380952380953) internal successors, (566), 21 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:46,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:46,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-28 01:07:46,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:49,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#1_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (<= v_~total~0_85 2147483647) (= v_~total~0_85 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_85 2147483648)) (= (+ .cse0 v_~total~0_86) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#1=|v_#memory_int#1_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_86} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_98|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, ~total~0=v_~total~0_85, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][221], [24#L115true, Black: 70#(and (= ~i~0 0) (<= 0 ~j~0)), 84#(and (<= 1 ~i~0) (<= 0 ~j~0)), 595#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), 618#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 74#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 51#L58true, 365#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), 15#L97true, Black: 593#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), 603#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 454#(<= ~q2_front~0 ~q2_back~0), Black: 563#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 87#(= ~total~0 0), 46#thread2EXITtrue, Black: 91#(= ~q2_back~0 ~q2_front~0), Black: 408#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 95#(<= ~q1_back~0 ~q1_front~0), Black: 608#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 623#true, Black: 297#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 606#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 414#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 602#(<= ~q1_front~0 ~q1_back~0), Black: 301#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 412#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 128#true, Black: 402#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 410#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 620#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 106#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 38#L144-5true, Black: 430#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 439#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|))]) [2024-06-28 01:07:49,751 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-06-28 01:07:49,751 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 01:07:49,751 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 01:07:49,752 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-28 01:07:49,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#1_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (<= v_~total~0_85 2147483647) (= v_~total~0_85 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|))) 1 0) 0)) (<= 0 (+ v_~total~0_85 2147483648)) (= (+ .cse0 v_~total~0_86) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#1=|v_#memory_int#1_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_86} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_98|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, ~total~0=v_~total~0_85, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_105} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][221], [24#L115true, Black: 70#(and (= ~i~0 0) (<= 0 ~j~0)), 84#(and (<= 1 ~i~0) (<= 0 ~j~0)), 595#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 74#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 618#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 365#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), 51#L58true, 15#L97true, Black: 593#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), 603#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 454#(<= ~q2_front~0 ~q2_back~0), Black: 563#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 87#(= ~total~0 0), 46#thread2EXITtrue, Black: 91#(= ~q2_back~0 ~q2_front~0), Black: 408#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 95#(<= ~q1_back~0 ~q1_front~0), Black: 608#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), 623#true, Black: 297#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 606#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 414#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 602#(<= ~q1_front~0 ~q1_back~0), Black: 301#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)), Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 412#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 128#true, Black: 402#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 410#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), 53#L145true, Black: 620#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 106#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 430#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 439#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|))]) [2024-06-28 01:07:49,836 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-06-28 01:07:49,836 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 01:07:49,836 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-28 01:07:49,836 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 01:07:49,986 INFO L124 PetriNetUnfolderBase]: 15036/24469 cut-off events. [2024-06-28 01:07:49,987 INFO L125 PetriNetUnfolderBase]: For 145805/148766 co-relation queries the response was YES. [2024-06-28 01:07:50,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105073 conditions, 24469 events. 15036/24469 cut-off events. For 145805/148766 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 186922 event pairs, 2180 based on Foata normal form. 1853/25468 useless extension candidates. Maximal degree in co-relation 105017. Up to 12194 conditions per place. [2024-06-28 01:07:50,263 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 181 selfloop transitions, 62 changer transitions 1/280 dead transitions. [2024-06-28 01:07:50,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 280 transitions, 2310 flow [2024-06-28 01:07:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-28 01:07:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-28 01:07:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 558 transitions. [2024-06-28 01:07:50,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5563310069790628 [2024-06-28 01:07:50,265 INFO L175 Difference]: Start difference. First operand has 110 places, 107 transitions, 760 flow. Second operand 17 states and 558 transitions. [2024-06-28 01:07:50,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 280 transitions, 2310 flow [2024-06-28 01:07:50,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 280 transitions, 2277 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-28 01:07:50,659 INFO L231 Difference]: Finished difference. Result has 129 places, 157 transitions, 1419 flow [2024-06-28 01:07:50,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1419, PETRI_PLACES=129, PETRI_TRANSITIONS=157} [2024-06-28 01:07:50,660 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 69 predicate places. [2024-06-28 01:07:50,660 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 157 transitions, 1419 flow [2024-06-28 01:07:50,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 26.952380952380953) internal successors, (566), 21 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:50,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:50,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:50,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-06-28 01:07:50,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:07:50,872 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:07:50,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:50,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1144721807, now seen corresponding path program 2 times [2024-06-28 01:07:50,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:50,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908222585] [2024-06-28 01:07:50,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:50,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:52,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:52,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908222585] [2024-06-28 01:07:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908222585] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:07:52,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441553818] [2024-06-28 01:07:52,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:07:52,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:07:52,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:07:52,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-06-28 01:07:52,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-06-28 01:07:52,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 01:07:52,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:07:52,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 53 conjunts are in the unsatisfiable core [2024-06-28 01:07:52,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:07:52,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-06-28 01:07:53,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-06-28 01:07:53,072 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-06-28 01:07:53,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-06-28 01:07:53,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 01:07:54,014 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-06-28 01:07:54,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 38 [2024-06-28 01:07:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:54,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:07:55,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:55,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 91 [2024-06-28 01:07:55,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:55,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 306 treesize of output 454 [2024-06-28 01:07:55,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:55,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 218 treesize of output 354 [2024-06-28 01:11:12,258 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-06-28 01:11:12,262 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-28 01:11:12,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-06-28 01:11:12,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-06-28 01:11:12,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-06-28 01:11:12,463 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-06-28 01:11:12,467 INFO L158 Benchmark]: Toolchain (without parser) took 232653.52ms. Allocated memory was 144.7MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 68.6MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2024-06-28 01:11:12,467 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 144.7MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:11:12,467 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:11:12,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.87ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 68.5MB in the beginning and 147.1MB in the end (delta: -78.6MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-06-28 01:11:12,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.17ms. Allocated memory is still 184.5MB. Free memory was 147.1MB in the beginning and 144.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:11:12,468 INFO L158 Benchmark]: Boogie Preprocessor took 45.90ms. Allocated memory is still 184.5MB. Free memory was 144.0MB in the beginning and 139.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 01:11:12,468 INFO L158 Benchmark]: RCFGBuilder took 919.18ms. Allocated memory is still 184.5MB. Free memory was 139.8MB in the beginning and 135.8MB in the end (delta: 4.0MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-06-28 01:11:12,468 INFO L158 Benchmark]: TraceAbstraction took 231276.90ms. Allocated memory was 184.5MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 134.7MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2024-06-28 01:11:12,469 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 144.7MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.87ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 68.5MB in the beginning and 147.1MB in the end (delta: -78.6MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.17ms. Allocated memory is still 184.5MB. Free memory was 147.1MB in the beginning and 144.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.90ms. Allocated memory is still 184.5MB. Free memory was 144.0MB in the beginning and 139.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 919.18ms. Allocated memory is still 184.5MB. Free memory was 139.8MB in the beginning and 135.8MB in the end (delta: 4.0MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * TraceAbstraction took 231276.90ms. Allocated memory was 184.5MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 134.7MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-more-buffer-series2.wvr.c ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-buffer-series2.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:11:14,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:11:14,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-28 01:11:14,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:11:14,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:11:14,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:11:14,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:11:14,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:11:14,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:11:14,768 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:11:14,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:11:14,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:11:14,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:11:14,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:11:14,771 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:11:14,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:11:14,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:11:14,775 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:11:14,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:11:14,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:11:14,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:11:14,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:11:14,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:11:14,776 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-28 01:11:14,776 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-28 01:11:14,777 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:11:14,777 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-28 01:11:14,777 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:11:14,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:11:14,777 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:11:14,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:11:14,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:11:14,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:11:14,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:11:14,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:11:14,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:11:14,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:11:14,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:11:14,780 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-28 01:11:14,780 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-28 01:11:14,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:11:14,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:11:14,781 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:11:14,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:11:14,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:11:14,781 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-28 01:11:14,782 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-28 01:11:15,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:11:15,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:11:15,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:11:15,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:11:15,080 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:11:15,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-06-28 01:11:16,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:11:16,465 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:11:16,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-06-28 01:11:16,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32475aebb/ca86ddc61f1c4fd68eb753fcf142f2b0/FLAGf801f7698 [2024-06-28 01:11:16,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32475aebb/ca86ddc61f1c4fd68eb753fcf142f2b0 [2024-06-28 01:11:16,487 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:11:16,487 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:11:16,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-buffer-series2.wvr.yml/witness.yml [2024-06-28 01:11:16,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:11:16,583 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:11:16,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:11:16,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:11:16,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:11:16,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:11:16" (1/2) ... [2024-06-28 01:11:16,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225d1b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:16, skipping insertion in model container [2024-06-28 01:11:16,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:11:16" (1/2) ... [2024-06-28 01:11:16,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@81d5e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:16, skipping insertion in model container [2024-06-28 01:11:16,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:11:16" (2/2) ... [2024-06-28 01:11:16,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225d1b52 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:16, skipping insertion in model container [2024-06-28 01:11:16,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:11:16" (2/2) ... [2024-06-28 01:11:16,593 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:11:16,617 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:11:16,618 INFO L97 edCorrectnessWitness]: Location invariant before [L142-L142] ((! multithreaded || 0 <= i) && (! multithreaded || 0 <= j)) && (! multithreaded || (0 <= i && 0 <= j)) [2024-06-28 01:11:16,618 INFO L97 edCorrectnessWitness]: Location invariant before [L144-L144] ((! multithreaded || 0 <= i) && (! multithreaded || 0 <= j)) && (! multithreaded || (0 <= i && 0 <= j)) [2024-06-28 01:11:16,619 INFO L97 edCorrectnessWitness]: Location invariant before [L143-L143] ((! multithreaded || 0 <= i) && (! multithreaded || 0 <= j)) && (! multithreaded || (0 <= i && 0 <= j)) [2024-06-28 01:11:16,619 INFO L97 edCorrectnessWitness]: Location invariant before [L145-L145] ((! multithreaded || 0 <= i) && (! multithreaded || 0 <= j)) && (! multithreaded || (0 <= i && 0 <= j)) [2024-06-28 01:11:16,619 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:11:16,619 INFO L106 edCorrectnessWitness]: ghost_update [L141-L141] multithreaded = 1; [2024-06-28 01:11:16,642 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:11:16,848 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-06-28 01:11:16,867 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:11:16,879 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-28 01:11:16,886 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:11:16,915 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-06-28 01:11:16,927 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:11:16,933 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:11:17,009 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-06-28 01:11:17,015 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:11:17,031 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:11:17,031 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17 WrapperNode [2024-06-28 01:11:17,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:11:17,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:11:17,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:11:17,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:11:17,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (1/1) ... [2024-06-28 01:11:17,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (1/1) ... [2024-06-28 01:11:17,098 INFO L138 Inliner]: procedures = 28, calls = 63, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 333 [2024-06-28 01:11:17,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:11:17,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:11:17,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:11:17,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:11:17,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (1/1) ... [2024-06-28 01:11:17,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (1/1) ... [2024-06-28 01:11:17,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (1/1) ... [2024-06-28 01:11:17,134 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-06-28 01:11:17,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (1/1) ... [2024-06-28 01:11:17,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (1/1) ... [2024-06-28 01:11:17,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (1/1) ... [2024-06-28 01:11:17,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (1/1) ... [2024-06-28 01:11:17,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (1/1) ... [2024-06-28 01:11:17,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (1/1) ... [2024-06-28 01:11:17,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:11:17,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:11:17,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:11:17,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:11:17,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (1/1) ... [2024-06-28 01:11:17,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:11:17,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:11:17,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 01:11:17,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 01:11:17,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:11:17,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-28 01:11:17,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-28 01:11:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-28 01:11:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-28 01:11:17,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-28 01:11:17,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-28 01:11:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-28 01:11:17,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-28 01:11:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-28 01:11:17,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-28 01:11:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-28 01:11:17,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-28 01:11:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:11:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:11:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-28 01:11:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:11:17,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:11:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-28 01:11:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-28 01:11:17,293 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:11:17,430 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:11:17,432 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:11:17,832 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:11:17,832 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:11:18,187 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:11:18,188 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-06-28 01:11:18,189 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:11:18 BoogieIcfgContainer [2024-06-28 01:11:18,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:11:18,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:11:18,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:11:18,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:11:18,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:11:16" (1/4) ... [2024-06-28 01:11:18,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a58197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:11:18, skipping insertion in model container [2024-06-28 01:11:18,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:11:16" (2/4) ... [2024-06-28 01:11:18,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a58197 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:11:18, skipping insertion in model container [2024-06-28 01:11:18,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:17" (3/4) ... [2024-06-28 01:11:18,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a58197 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:11:18, skipping insertion in model container [2024-06-28 01:11:18,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:11:18" (4/4) ... [2024-06-28 01:11:18,196 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2024-06-28 01:11:18,217 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:11:18,217 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 01:11:18,218 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:11:18,269 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-28 01:11:18,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 59 transitions, 146 flow [2024-06-28 01:11:18,336 INFO L124 PetriNetUnfolderBase]: 7/55 cut-off events. [2024-06-28 01:11:18,337 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-28 01:11:18,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 7/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-06-28 01:11:18,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 59 transitions, 146 flow [2024-06-28 01:11:18,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 54 transitions, 132 flow [2024-06-28 01:11:18,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:11:18,361 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;@fc35da2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:11:18,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-28 01:11:18,369 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:11:18,369 INFO L124 PetriNetUnfolderBase]: 3/12 cut-off events. [2024-06-28 01:11:18,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:11:18,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:18,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:18,370 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:11:18,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash -442443695, now seen corresponding path program 1 times [2024-06-28 01:11:18,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:18,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263532559] [2024-06-28 01:11:18,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:18,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:18,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:18,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:18,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-06-28 01:11:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:18,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-28 01:11:18,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:11:18,619 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:11:18,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:18,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263532559] [2024-06-28 01:11:18,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263532559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:11:18,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:11:18,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:11:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218129268] [2024-06-28 01:11:18,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:11:18,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:11:18,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:18,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:11:18,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:11:18,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-28 01:11:18,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:18,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:18,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-28 01:11:18,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:19,218 INFO L124 PetriNetUnfolderBase]: 1640/2615 cut-off events. [2024-06-28 01:11:19,218 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2024-06-28 01:11:19,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4977 conditions, 2615 events. 1640/2615 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 15260 event pairs, 308 based on Foata normal form. 36/2495 useless extension candidates. Maximal degree in co-relation 4431. Up to 1760 conditions per place. [2024-06-28 01:11:19,250 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 55 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2024-06-28 01:11:19,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 315 flow [2024-06-28 01:11:19,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:11:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:11:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-06-28 01:11:19,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7401129943502824 [2024-06-28 01:11:19,261 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 132 flow. Second operand 3 states and 131 transitions. [2024-06-28 01:11:19,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 315 flow [2024-06-28 01:11:19,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 285 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:11:19,269 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 141 flow [2024-06-28 01:11:19,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2024-06-28 01:11:19,273 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2024-06-28 01:11:19,273 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 141 flow [2024-06-28 01:11:19,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:19,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:19,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:19,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:19,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:19,477 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:11:19,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:19,478 INFO L85 PathProgramCache]: Analyzing trace with hash 19172270, now seen corresponding path program 1 times [2024-06-28 01:11:19,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967846490] [2024-06-28 01:11:19,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:19,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:19,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:19,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:19,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-06-28 01:11:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:19,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-28 01:11:19,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:11:19,711 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:11:19,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967846490] [2024-06-28 01:11:19,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967846490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:11:19,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:11:19,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:11:19,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949399509] [2024-06-28 01:11:19,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:11:19,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:11:19,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:19,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:11:19,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:11:19,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-28 01:11:19,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:19,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:19,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-28 01:11:19,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:20,405 INFO L124 PetriNetUnfolderBase]: 2026/3286 cut-off events. [2024-06-28 01:11:20,405 INFO L125 PetriNetUnfolderBase]: For 634/766 co-relation queries the response was YES. [2024-06-28 01:11:20,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7039 conditions, 3286 events. 2026/3286 cut-off events. For 634/766 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 20549 event pairs, 295 based on Foata normal form. 54/3218 useless extension candidates. Maximal degree in co-relation 1441. Up to 1829 conditions per place. [2024-06-28 01:11:20,424 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 76 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2024-06-28 01:11:20,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 100 transitions, 409 flow [2024-06-28 01:11:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:11:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:11:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2024-06-28 01:11:20,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-06-28 01:11:20,426 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 141 flow. Second operand 4 states and 177 transitions. [2024-06-28 01:11:20,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 100 transitions, 409 flow [2024-06-28 01:11:20,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 100 transitions, 406 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:11:20,428 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 171 flow [2024-06-28 01:11:20,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2024-06-28 01:11:20,429 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2024-06-28 01:11:20,429 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 171 flow [2024-06-28 01:11:20,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:20,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:20,429 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:20,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:20,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:20,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:11:20,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:20,633 INFO L85 PathProgramCache]: Analyzing trace with hash -67658103, now seen corresponding path program 1 times [2024-06-28 01:11:20,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:20,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824020103] [2024-06-28 01:11:20,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:20,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:20,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:20,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:20,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-06-28 01:11:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:20,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-28 01:11:20,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:11:20,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:11:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:11:20,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:20,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824020103] [2024-06-28 01:11:20,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824020103] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:11:20,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:11:20,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-06-28 01:11:20,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650662400] [2024-06-28 01:11:20,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:11:20,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:11:20,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:20,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:11:20,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:11:20,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-28 01:11:20,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 171 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:20,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:20,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-28 01:11:20,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:22,119 INFO L124 PetriNetUnfolderBase]: 4548/7413 cut-off events. [2024-06-28 01:11:22,119 INFO L125 PetriNetUnfolderBase]: For 4517/4729 co-relation queries the response was YES. [2024-06-28 01:11:22,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17345 conditions, 7413 events. 4548/7413 cut-off events. For 4517/4729 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 51936 event pairs, 308 based on Foata normal form. 320/7624 useless extension candidates. Maximal degree in co-relation 3664. Up to 2165 conditions per place. [2024-06-28 01:11:22,172 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 160 selfloop transitions, 13 changer transitions 0/192 dead transitions. [2024-06-28 01:11:22,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 192 transitions, 859 flow [2024-06-28 01:11:22,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:11:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:11:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 373 transitions. [2024-06-28 01:11:22,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7902542372881356 [2024-06-28 01:11:22,175 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 171 flow. Second operand 8 states and 373 transitions. [2024-06-28 01:11:22,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 192 transitions, 859 flow [2024-06-28 01:11:22,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 192 transitions, 848 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 01:11:22,179 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 285 flow [2024-06-28 01:11:22,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=285, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2024-06-28 01:11:22,180 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2024-06-28 01:11:22,180 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 285 flow [2024-06-28 01:11:22,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:22,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:22,180 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:22,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:22,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:22,384 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:11:22,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:22,384 INFO L85 PathProgramCache]: Analyzing trace with hash -342762485, now seen corresponding path program 1 times [2024-06-28 01:11:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:22,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455212605] [2024-06-28 01:11:22,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:22,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:22,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:22,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:22,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-06-28 01:11:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:22,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-28 01:11:22,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:11:22,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:11:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:11:22,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:22,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455212605] [2024-06-28 01:11:22,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455212605] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:11:22,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:11:22,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-06-28 01:11:22,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543394923] [2024-06-28 01:11:22,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:11:22,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:11:22,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:22,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:11:22,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:11:22,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-28 01:11:22,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 285 flow. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:22,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:22,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-28 01:11:22,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:24,547 INFO L124 PetriNetUnfolderBase]: 7652/12602 cut-off events. [2024-06-28 01:11:24,548 INFO L125 PetriNetUnfolderBase]: For 19865/20077 co-relation queries the response was YES. [2024-06-28 01:11:24,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33137 conditions, 12602 events. 7652/12602 cut-off events. For 19865/20077 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 97674 event pairs, 568 based on Foata normal form. 286/12779 useless extension candidates. Maximal degree in co-relation 26306. Up to 5409 conditions per place. [2024-06-28 01:11:24,635 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 156 selfloop transitions, 19 changer transitions 0/194 dead transitions. [2024-06-28 01:11:24,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 194 transitions, 1022 flow [2024-06-28 01:11:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:11:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:11:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 357 transitions. [2024-06-28 01:11:24,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7563559322033898 [2024-06-28 01:11:24,638 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 285 flow. Second operand 8 states and 357 transitions. [2024-06-28 01:11:24,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 194 transitions, 1022 flow [2024-06-28 01:11:24,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 194 transitions, 960 flow, removed 28 selfloop flow, removed 2 redundant places. [2024-06-28 01:11:24,686 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 442 flow [2024-06-28 01:11:24,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=442, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2024-06-28 01:11:24,688 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2024-06-28 01:11:24,689 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 442 flow [2024-06-28 01:11:24,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:24,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:24,690 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:24,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:24,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:24,894 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:11:24,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1749470589, now seen corresponding path program 1 times [2024-06-28 01:11:24,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:24,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120957320] [2024-06-28 01:11:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:24,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:24,896 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:24,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-06-28 01:11:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:25,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-28 01:11:25,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:11:25,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:11:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:11:25,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:25,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120957320] [2024-06-28 01:11:25,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120957320] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:11:25,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:11:25,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-06-28 01:11:25,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837959491] [2024-06-28 01:11:25,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:11:25,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:11:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:25,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:11:25,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:11:25,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-28 01:11:25,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 442 flow. Second operand has 12 states, 12 states have (on average 25.333333333333332) internal successors, (304), 12 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:25,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:25,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-28 01:11:25,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:28,237 INFO L124 PetriNetUnfolderBase]: 11592/19416 cut-off events. [2024-06-28 01:11:28,238 INFO L125 PetriNetUnfolderBase]: For 49763/49975 co-relation queries the response was YES. [2024-06-28 01:11:28,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52581 conditions, 19416 events. 11592/19416 cut-off events. For 49763/49975 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 161782 event pairs, 503 based on Foata normal form. 368/19615 useless extension candidates. Maximal degree in co-relation 40946. Up to 4679 conditions per place. [2024-06-28 01:11:28,360 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 244 selfloop transitions, 43 changer transitions 0/306 dead transitions. [2024-06-28 01:11:28,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 306 transitions, 1697 flow [2024-06-28 01:11:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:11:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:11:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 555 transitions. [2024-06-28 01:11:28,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7838983050847458 [2024-06-28 01:11:28,362 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 442 flow. Second operand 12 states and 555 transitions. [2024-06-28 01:11:28,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 306 transitions, 1697 flow [2024-06-28 01:11:28,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 306 transitions, 1638 flow, removed 28 selfloop flow, removed 1 redundant places. [2024-06-28 01:11:28,450 INFO L231 Difference]: Finished difference. Result has 92 places, 102 transitions, 790 flow [2024-06-28 01:11:28,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=790, PETRI_PLACES=92, PETRI_TRANSITIONS=102} [2024-06-28 01:11:28,452 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 32 predicate places. [2024-06-28 01:11:28,452 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 102 transitions, 790 flow [2024-06-28 01:11:28,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.333333333333332) internal successors, (304), 12 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:28,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:28,453 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:28,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:28,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:28,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:11:28,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:28,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1286091819, now seen corresponding path program 1 times [2024-06-28 01:11:28,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:28,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798574776] [2024-06-28 01:11:28,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:28,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:28,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:28,661 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:28,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-06-28 01:11:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:28,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-28 01:11:28,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:11:28,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:11:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:11:29,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:29,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798574776] [2024-06-28 01:11:29,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798574776] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:11:29,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:11:29,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-06-28 01:11:29,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773575993] [2024-06-28 01:11:29,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:11:29,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:11:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:29,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:11:29,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:11:29,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-28 01:11:29,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 102 transitions, 790 flow. Second operand has 12 states, 12 states have (on average 25.333333333333332) internal successors, (304), 12 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:29,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:29,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-28 01:11:29,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:33,619 INFO L124 PetriNetUnfolderBase]: 17450/29624 cut-off events. [2024-06-28 01:11:33,620 INFO L125 PetriNetUnfolderBase]: For 113449/113661 co-relation queries the response was YES. [2024-06-28 01:11:33,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85740 conditions, 29624 events. 17450/29624 cut-off events. For 113449/113661 co-relation queries the response was YES. Maximal size of possible extension queue 1785. Compared 269371 event pairs, 464 based on Foata normal form. 312/29767 useless extension candidates. Maximal degree in co-relation 74044. Up to 8506 conditions per place. [2024-06-28 01:11:33,837 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 245 selfloop transitions, 65 changer transitions 0/329 dead transitions. [2024-06-28 01:11:33,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 329 transitions, 2236 flow [2024-06-28 01:11:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:11:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:11:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 544 transitions. [2024-06-28 01:11:33,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.768361581920904 [2024-06-28 01:11:33,840 INFO L175 Difference]: Start difference. First operand has 92 places, 102 transitions, 790 flow. Second operand 12 states and 544 transitions. [2024-06-28 01:11:33,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 329 transitions, 2236 flow [2024-06-28 01:11:34,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 329 transitions, 2078 flow, removed 73 selfloop flow, removed 4 redundant places. [2024-06-28 01:11:34,457 INFO L231 Difference]: Finished difference. Result has 105 places, 134 transitions, 1289 flow [2024-06-28 01:11:34,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1289, PETRI_PLACES=105, PETRI_TRANSITIONS=134} [2024-06-28 01:11:34,460 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 45 predicate places. [2024-06-28 01:11:34,460 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 134 transitions, 1289 flow [2024-06-28 01:11:34,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.333333333333332) internal successors, (304), 12 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:34,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:34,461 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:34,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:34,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:34,665 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:11:34,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:34,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1368164615, now seen corresponding path program 2 times [2024-06-28 01:11:34,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:34,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750067652] [2024-06-28 01:11:34,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:11:34,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:34,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:34,668 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:34,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-06-28 01:11:34,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-28 01:11:34,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:11:34,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-28 01:11:34,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-28 01:11:34,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:11:34,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:34,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750067652] [2024-06-28 01:11:34,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750067652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:11:34,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:11:34,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:11:34,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548327442] [2024-06-28 01:11:34,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:11:34,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:11:34,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:34,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:11:34,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:11:34,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-06-28 01:11:34,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 134 transitions, 1289 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:34,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:34,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-06-28 01:11:34,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:39,147 INFO L124 PetriNetUnfolderBase]: 19098/31888 cut-off events. [2024-06-28 01:11:39,148 INFO L125 PetriNetUnfolderBase]: For 117458/117572 co-relation queries the response was YES. [2024-06-28 01:11:39,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96275 conditions, 31888 events. 19098/31888 cut-off events. For 117458/117572 co-relation queries the response was YES. Maximal size of possible extension queue 1802. Compared 291170 event pairs, 14972 based on Foata normal form. 544/31126 useless extension candidates. Maximal degree in co-relation 89820. Up to 23923 conditions per place. [2024-06-28 01:11:39,476 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 142 selfloop transitions, 3 changer transitions 0/168 dead transitions. [2024-06-28 01:11:39,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 168 transitions, 1726 flow [2024-06-28 01:11:39,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:11:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:11:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2024-06-28 01:11:39,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7161016949152542 [2024-06-28 01:11:39,478 INFO L175 Difference]: Start difference. First operand has 105 places, 134 transitions, 1289 flow. Second operand 4 states and 169 transitions. [2024-06-28 01:11:39,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 168 transitions, 1726 flow [2024-06-28 01:11:40,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 168 transitions, 1622 flow, removed 47 selfloop flow, removed 3 redundant places. [2024-06-28 01:11:40,271 INFO L231 Difference]: Finished difference. Result has 107 places, 136 transitions, 1224 flow [2024-06-28 01:11:40,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1224, PETRI_PLACES=107, PETRI_TRANSITIONS=136} [2024-06-28 01:11:40,271 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 47 predicate places. [2024-06-28 01:11:40,272 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 136 transitions, 1224 flow [2024-06-28 01:11:40,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:40,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:40,272 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:40,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:40,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:40,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:11:40,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:40,476 INFO L85 PathProgramCache]: Analyzing trace with hash -912188476, now seen corresponding path program 1 times [2024-06-28 01:11:40,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:40,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908008267] [2024-06-28 01:11:40,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:40,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:40,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:40,506 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:40,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-06-28 01:11:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:40,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-28 01:11:40,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:11:40,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:11:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:11:40,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:40,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908008267] [2024-06-28 01:11:40,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908008267] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:11:40,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:11:40,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-06-28 01:11:40,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236934400] [2024-06-28 01:11:40,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:11:40,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:11:40,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:40,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:11:40,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:11:41,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-28 01:11:41,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 136 transitions, 1224 flow. Second operand has 12 states, 12 states have (on average 25.5) internal successors, (306), 12 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:41,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:41,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-28 01:11:41,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:46,748 INFO L124 PetriNetUnfolderBase]: 22721/38896 cut-off events. [2024-06-28 01:11:46,748 INFO L125 PetriNetUnfolderBase]: For 178154/178438 co-relation queries the response was YES. [2024-06-28 01:11:47,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116617 conditions, 38896 events. 22721/38896 cut-off events. For 178154/178438 co-relation queries the response was YES. Maximal size of possible extension queue 2269. Compared 368249 event pairs, 1273 based on Foata normal form. 312/39018 useless extension candidates. Maximal degree in co-relation 108680. Up to 15310 conditions per place. [2024-06-28 01:11:47,221 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 270 selfloop transitions, 61 changer transitions 0/350 dead transitions. [2024-06-28 01:11:47,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 350 transitions, 2636 flow [2024-06-28 01:11:47,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:11:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:11:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 541 transitions. [2024-06-28 01:11:47,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7641242937853108 [2024-06-28 01:11:47,224 INFO L175 Difference]: Start difference. First operand has 107 places, 136 transitions, 1224 flow. Second operand 12 states and 541 transitions. [2024-06-28 01:11:47,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 350 transitions, 2636 flow [2024-06-28 01:11:48,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 350 transitions, 2632 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 01:11:48,740 INFO L231 Difference]: Finished difference. Result has 123 places, 158 transitions, 1765 flow [2024-06-28 01:11:48,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1765, PETRI_PLACES=123, PETRI_TRANSITIONS=158} [2024-06-28 01:11:48,742 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 63 predicate places. [2024-06-28 01:11:48,742 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 158 transitions, 1765 flow [2024-06-28 01:11:48,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.5) internal successors, (306), 12 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:48,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:48,744 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:48,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-06-28 01:11:48,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:48,947 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:11:48,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:48,948 INFO L85 PathProgramCache]: Analyzing trace with hash 923068979, now seen corresponding path program 1 times [2024-06-28 01:11:48,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:48,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138856610] [2024-06-28 01:11:48,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:48,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:48,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:48,952 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:48,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-06-28 01:11:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:49,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-28 01:11:49,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:11:49,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:11:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:11:49,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:49,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138856610] [2024-06-28 01:11:49,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138856610] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:11:49,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:11:49,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-06-28 01:11:49,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362110296] [2024-06-28 01:11:49,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:11:49,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-28 01:11:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:49,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-28 01:11:49,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-06-28 01:11:49,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-28 01:11:49,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 158 transitions, 1765 flow. Second operand has 14 states, 14 states have (on average 25.285714285714285) internal successors, (354), 14 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:49,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:49,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-28 01:11:49,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:56,897 INFO L124 PetriNetUnfolderBase]: 26901/46097 cut-off events. [2024-06-28 01:11:56,897 INFO L125 PetriNetUnfolderBase]: For 330320/330604 co-relation queries the response was YES. [2024-06-28 01:11:57,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150403 conditions, 46097 events. 26901/46097 cut-off events. For 330320/330604 co-relation queries the response was YES. Maximal size of possible extension queue 2719. Compared 448346 event pairs, 1549 based on Foata normal form. 364/46181 useless extension candidates. Maximal degree in co-relation 141741. Up to 20992 conditions per place. [2024-06-28 01:11:57,619 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 330 selfloop transitions, 65 changer transitions 0/414 dead transitions. [2024-06-28 01:11:57,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 414 transitions, 3492 flow [2024-06-28 01:11:57,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 01:11:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 01:11:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 636 transitions. [2024-06-28 01:11:57,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7699757869249395 [2024-06-28 01:11:57,636 INFO L175 Difference]: Start difference. First operand has 123 places, 158 transitions, 1765 flow. Second operand 14 states and 636 transitions. [2024-06-28 01:11:57,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 414 transitions, 3492 flow [2024-06-28 01:12:00,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 414 transitions, 3350 flow, removed 65 selfloop flow, removed 4 redundant places. [2024-06-28 01:12:00,224 INFO L231 Difference]: Finished difference. Result has 139 places, 180 transitions, 2272 flow [2024-06-28 01:12:00,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2272, PETRI_PLACES=139, PETRI_TRANSITIONS=180} [2024-06-28 01:12:00,224 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 79 predicate places. [2024-06-28 01:12:00,225 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 180 transitions, 2272 flow [2024-06-28 01:12:00,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 25.285714285714285) internal successors, (354), 14 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:12:00,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:12:00,225 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:12:00,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-06-28 01:12:00,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:12:00,429 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:12:00,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:12:00,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1261838151, now seen corresponding path program 2 times [2024-06-28 01:12:00,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:12:00,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520058436] [2024-06-28 01:12:00,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:12:00,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:12:00,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:12:00,449 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:12:00,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-06-28 01:12:00,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-28 01:12:00,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:12:00,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-28 01:12:00,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:12:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-06-28 01:12:00,611 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:12:00,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:12:00,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520058436] [2024-06-28 01:12:00,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520058436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:12:00,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:12:00,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:12:00,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023498346] [2024-06-28 01:12:00,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:12:00,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:12:00,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:12:00,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:12:00,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:12:00,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-06-28 01:12:00,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 180 transitions, 2272 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:12:00,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:12:00,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-06-28 01:12:00,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:12:07,865 INFO L124 PetriNetUnfolderBase]: 29179/49837 cut-off events. [2024-06-28 01:12:07,865 INFO L125 PetriNetUnfolderBase]: For 317026/317080 co-relation queries the response was YES. [2024-06-28 01:12:08,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166826 conditions, 49837 events. 29179/49837 cut-off events. For 317026/317080 co-relation queries the response was YES. Maximal size of possible extension queue 2772. Compared 492840 event pairs, 23827 based on Foata normal form. 715/48769 useless extension candidates. Maximal degree in co-relation 157499. Up to 37063 conditions per place. [2024-06-28 01:12:08,560 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 187 selfloop transitions, 4 changer transitions 0/214 dead transitions. [2024-06-28 01:12:08,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 214 transitions, 2853 flow [2024-06-28 01:12:08,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:12:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:12:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2024-06-28 01:12:08,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076271186440678 [2024-06-28 01:12:08,564 INFO L175 Difference]: Start difference. First operand has 139 places, 180 transitions, 2272 flow. Second operand 4 states and 167 transitions. [2024-06-28 01:12:08,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 214 transitions, 2853 flow