./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/chl-sre-trans.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c ./goblint.2024-05-07_14-17-48.files/mutex-meet/chl-sre-trans.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 10:50:21,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 10:50:21,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 10:50:21,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 10:50:21,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 10:50:21,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 10:50:21,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 10:50:21,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 10:50:21,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 10:50:21,286 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 10:50:21,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 10:50:21,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 10:50:21,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 10:50:21,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 10:50:21,289 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 10:50:21,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 10:50:21,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 10:50:21,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 10:50:21,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 10:50:21,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 10:50:21,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 10:50:21,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 10:50:21,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 10:50:21,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 10:50:21,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 10:50:21,292 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 10:50:21,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 10:50:21,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 10:50:21,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 10:50:21,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 10:50:21,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 10:50:21,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 10:50:21,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 10:50:21,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 10:50:21,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 10:50:21,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 10:50:21,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 10:50:21,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 10:50:21,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 10:50:21,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 10:50:21,296 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 10:50:21,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 10:50:21,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 10:50:21,296 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 10:50:21,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 10:50:21,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 10:50:21,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 10:50:21,558 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 10:50:21,559 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 10:50:21,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/chl-sre-trans.wvr.yml/witness.yml [2024-05-12 10:50:21,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 10:50:21,661 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 10:50:21,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c [2024-05-12 10:50:22,785 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 10:50:22,963 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 10:50:22,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c [2024-05-12 10:50:22,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2924be40c/29227358ea174efe8fb97bfb1f4bc877/FLAG8553ea92e [2024-05-12 10:50:23,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2924be40c/29227358ea174efe8fb97bfb1f4bc877 [2024-05-12 10:50:23,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 10:50:23,008 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 10:50:23,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 10:50:23,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 10:50:23,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 10:50:23,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:50:21" (1/2) ... [2024-05-12 10:50:23,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243364da and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 10:50:23, skipping insertion in model container [2024-05-12 10:50:23,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:50:21" (1/2) ... [2024-05-12 10:50:23,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@296b541b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 10:50:23, skipping insertion in model container [2024-05-12 10:50:23,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 10:50:23" (2/2) ... [2024-05-12 10:50:23,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243364da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23, skipping insertion in model container [2024-05-12 10:50:23,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 10:50:23" (2/2) ... [2024-05-12 10:50:23,017 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 10:50:23,034 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 10:50:23,036 INFO L97 edCorrectnessWitness]: Location invariant before [L69-L69] ((! multithreaded || ((((-128 <= result_5 && -1 <= result_5) && result_5 <= 1) && result_5 <= 127) && ((result_5 == -1 || result_5 == 0) || result_5 == 1))) && (! multithreaded || ((((-128 <= result_4 && -1 <= result_4) && result_4 <= 1) && result_4 <= 127) && ((result_4 == -1 || result_4 == 0) || result_4 == 1)))) && (! multithreaded || ((((-128 <= result_3 && -1 <= result_3) && result_3 <= 1) && result_3 <= 127) && ((result_3 == -1 || result_3 == 0) || result_3 == 1))) [2024-05-12 10:50:23,036 INFO L97 edCorrectnessWitness]: Location invariant before [L70-L70] ((! multithreaded || ((((-128 <= result_5 && -1 <= result_5) && result_5 <= 1) && result_5 <= 127) && ((result_5 == -1 || result_5 == 0) || result_5 == 1))) && (! multithreaded || ((((-128 <= result_4 && -1 <= result_4) && result_4 <= 1) && result_4 <= 127) && ((result_4 == -1 || result_4 == 0) || result_4 == 1)))) && (! multithreaded || ((((-128 <= result_3 && -1 <= result_3) && result_3 <= 1) && result_3 <= 127) && ((result_3 == -1 || result_3 == 0) || result_3 == 1))) [2024-05-12 10:50:23,036 INFO L97 edCorrectnessWitness]: Location invariant before [L71-L71] ((! multithreaded || ((((-128 <= result_5 && -1 <= result_5) && result_5 <= 1) && result_5 <= 127) && ((result_5 == -1 || result_5 == 0) || result_5 == 1))) && (! multithreaded || ((((-128 <= result_4 && -1 <= result_4) && result_4 <= 1) && result_4 <= 127) && ((result_4 == -1 || result_4 == 0) || result_4 == 1)))) && (! multithreaded || ((((-128 <= result_3 && -1 <= result_3) && result_3 <= 1) && result_3 <= 127) && ((result_3 == -1 || result_3 == 0) || result_3 == 1))) [2024-05-12 10:50:23,036 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 10:50:23,036 INFO L106 edCorrectnessWitness]: ghost_update [L68-L68] multithreaded = 1; [2024-05-12 10:50:23,052 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 10:50:23,271 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c[2272,2285] [2024-05-12 10:50:23,274 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 10:50:23,284 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 10:50:23,367 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c[2272,2285] [2024-05-12 10:50:23,368 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 10:50:23,379 INFO L206 MainTranslator]: Completed translation [2024-05-12 10:50:23,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23 WrapperNode [2024-05-12 10:50:23,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 10:50:23,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 10:50:23,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 10:50:23,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 10:50:23,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (1/1) ... [2024-05-12 10:50:23,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (1/1) ... [2024-05-12 10:50:23,428 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-05-12 10:50:23,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 10:50:23,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 10:50:23,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 10:50:23,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 10:50:23,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (1/1) ... [2024-05-12 10:50:23,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (1/1) ... [2024-05-12 10:50:23,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (1/1) ... [2024-05-12 10:50:23,458 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-05-12 10:50:23,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (1/1) ... [2024-05-12 10:50:23,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (1/1) ... [2024-05-12 10:50:23,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (1/1) ... [2024-05-12 10:50:23,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (1/1) ... [2024-05-12 10:50:23,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (1/1) ... [2024-05-12 10:50:23,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (1/1) ... [2024-05-12 10:50:23,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 10:50:23,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 10:50:23,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 10:50:23,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 10:50:23,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (1/1) ... [2024-05-12 10:50:23,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 10:50:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:50:23,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-05-12 10:50:23,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-05-12 10:50:23,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 10:50:23,548 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-12 10:50:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-12 10:50:23,548 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-12 10:50:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-12 10:50:23,548 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-12 10:50:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-12 10:50:23,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 10:50:23,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 10:50:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 10:50:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 10:50:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 10:50:23,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 10:50:23,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 10:50:23,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 10:50:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 10:50:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 10:50:23,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 10:50:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 10:50:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 10:50:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 10:50:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 10:50:23,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 10:50:23,553 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 10:50:23,653 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 10:50:23,655 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 10:50:23,842 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 10:50:23,842 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 10:50:23,935 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 10:50:23,935 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 10:50:23,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 10:50:23 BoogieIcfgContainer [2024-05-12 10:50:23,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 10:50:23,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 10:50:23,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 10:50:23,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 10:50:23,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:50:21" (1/4) ... [2024-05-12 10:50:23,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b9e11e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 10:50:23, skipping insertion in model container [2024-05-12 10:50:23,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 10:50:23" (2/4) ... [2024-05-12 10:50:23,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b9e11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 10:50:23, skipping insertion in model container [2024-05-12 10:50:23,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:50:23" (3/4) ... [2024-05-12 10:50:23,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b9e11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 10:50:23, skipping insertion in model container [2024-05-12 10:50:23,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 10:50:23" (4/4) ... [2024-05-12 10:50:23,944 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-sre-trans.wvr.c [2024-05-12 10:50:23,957 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 10:50:23,957 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 10:50:23,957 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 10:50:23,987 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-12 10:50:24,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 79 flow [2024-05-12 10:50:24,040 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-05-12 10:50:24,040 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-05-12 10:50:24,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 0/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-05-12 10:50:24,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 29 transitions, 79 flow [2024-05-12 10:50:24,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 25 transitions, 68 flow [2024-05-12 10:50:24,058 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 10:50:24,063 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;@771c51a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 10:50:24,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 10:50:24,066 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 10:50:24,066 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 10:50:24,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 10:50:24,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:50:24,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 10:50:24,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:50:24,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:50:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1884829121, now seen corresponding path program 1 times [2024-05-12 10:50:24,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:50:24,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011379365] [2024-05-12 10:50:24,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:50:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:50:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:50:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:50:24,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:50:24,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011379365] [2024-05-12 10:50:24,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011379365] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:50:24,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:50:24,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 10:50:24,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69445904] [2024-05-12 10:50:24,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:50:24,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 10:50:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:50:24,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 10:50:24,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 10:50:24,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 10:50:24,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:24,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:50:24,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 10:50:24,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:50:24,550 INFO L124 PetriNetUnfolderBase]: 65/136 cut-off events. [2024-05-12 10:50:24,550 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-05-12 10:50:24,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 136 events. 65/136 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 359 event pairs, 19 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 238. Up to 124 conditions per place. [2024-05-12 10:50:24,554 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2024-05-12 10:50:24,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 166 flow [2024-05-12 10:50:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:50:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:50:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2024-05-12 10:50:24,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2024-05-12 10:50:24,564 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 68 flow. Second operand 3 states and 50 transitions. [2024-05-12 10:50:24,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 166 flow [2024-05-12 10:50:24,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 10:50:24,569 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 86 flow [2024-05-12 10:50:24,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2024-05-12 10:50:24,573 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2024-05-12 10:50:24,573 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 86 flow [2024-05-12 10:50:24,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:24,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:50:24,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:50:24,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 10:50:24,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:50:24,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:50:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1699838757, now seen corresponding path program 1 times [2024-05-12 10:50:24,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:50:24,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332950011] [2024-05-12 10:50:24,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:50:24,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:50:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:50:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:50:24,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:50:24,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332950011] [2024-05-12 10:50:24,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332950011] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:50:24,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:50:24,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:50:24,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414533219] [2024-05-12 10:50:24,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:50:24,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:50:24,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:50:24,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:50:24,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:50:24,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 10:50:24,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:24,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:50:24,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 10:50:24,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:50:25,008 INFO L124 PetriNetUnfolderBase]: 62/130 cut-off events. [2024-05-12 10:50:25,009 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-05-12 10:50:25,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 130 events. 62/130 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 329 event pairs, 12 based on Foata normal form. 3/133 useless extension candidates. Maximal degree in co-relation 157. Up to 99 conditions per place. [2024-05-12 10:50:25,012 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-05-12 10:50:25,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 176 flow [2024-05-12 10:50:25,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:50:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:50:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-05-12 10:50:25,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-05-12 10:50:25,017 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 86 flow. Second operand 3 states and 48 transitions. [2024-05-12 10:50:25,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 176 flow [2024-05-12 10:50:25,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 10:50:25,020 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 109 flow [2024-05-12 10:50:25,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2024-05-12 10:50:25,021 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2024-05-12 10:50:25,022 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 109 flow [2024-05-12 10:50:25,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:25,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:50:25,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:50:25,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 10:50:25,023 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:50:25,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:50:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2050783433, now seen corresponding path program 1 times [2024-05-12 10:50:25,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:50:25,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336910574] [2024-05-12 10:50:25,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:50:25,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:50:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:50:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:50:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:50:25,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336910574] [2024-05-12 10:50:25,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336910574] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:50:25,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:50:25,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:50:25,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127783597] [2024-05-12 10:50:25,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:50:25,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:50:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:50:25,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:50:25,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:50:25,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 10:50:25,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:25,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:50:25,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 10:50:25,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:50:25,215 INFO L124 PetriNetUnfolderBase]: 59/125 cut-off events. [2024-05-12 10:50:25,215 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-05-12 10:50:25,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 125 events. 59/125 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 306 event pairs, 14 based on Foata normal form. 2/127 useless extension candidates. Maximal degree in co-relation 118. Up to 102 conditions per place. [2024-05-12 10:50:25,217 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2024-05-12 10:50:25,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 213 flow [2024-05-12 10:50:25,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:50:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:50:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-05-12 10:50:25,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-05-12 10:50:25,218 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 109 flow. Second operand 3 states and 48 transitions. [2024-05-12 10:50:25,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 213 flow [2024-05-12 10:50:25,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 10:50:25,220 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 137 flow [2024-05-12 10:50:25,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2024-05-12 10:50:25,221 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2024-05-12 10:50:25,221 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 137 flow [2024-05-12 10:50:25,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:25,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:50:25,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:50:25,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 10:50:25,222 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:50:25,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:50:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash -850223641, now seen corresponding path program 1 times [2024-05-12 10:50:25,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:50:25,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676269933] [2024-05-12 10:50:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:50:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:50:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:50:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:50:25,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:50:25,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676269933] [2024-05-12 10:50:25,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676269933] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:50:25,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:50:25,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:50:25,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266770588] [2024-05-12 10:50:25,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:50:25,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:50:25,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:50:25,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:50:25,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:50:25,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 10:50:25,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:25,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:50:25,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 10:50:25,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:50:25,436 INFO L124 PetriNetUnfolderBase]: 58/122 cut-off events. [2024-05-12 10:50:25,436 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-05-12 10:50:25,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 122 events. 58/122 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 270 event pairs, 20 based on Foata normal form. 2/124 useless extension candidates. Maximal degree in co-relation 185. Up to 70 conditions per place. [2024-05-12 10:50:25,437 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 30 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-05-12 10:50:25,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 213 flow [2024-05-12 10:50:25,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:50:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:50:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-05-12 10:50:25,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2024-05-12 10:50:25,439 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 137 flow. Second operand 3 states and 44 transitions. [2024-05-12 10:50:25,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 213 flow [2024-05-12 10:50:25,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 10:50:25,441 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 141 flow [2024-05-12 10:50:25,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2024-05-12 10:50:25,442 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2024-05-12 10:50:25,442 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 141 flow [2024-05-12 10:50:25,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:25,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:50:25,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:50:25,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 10:50:25,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:50:25,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:50:25,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1023695523, now seen corresponding path program 1 times [2024-05-12 10:50:25,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:50:25,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010730979] [2024-05-12 10:50:25,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:50:25,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:50:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:50:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:50:25,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:50:25,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010730979] [2024-05-12 10:50:25,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010730979] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:50:25,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:50:25,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:50:25,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921421955] [2024-05-12 10:50:25,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:50:25,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:50:25,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:50:25,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:50:25,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:50:25,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 10:50:25,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:25,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:50:25,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 10:50:25,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:50:25,647 INFO L124 PetriNetUnfolderBase]: 56/119 cut-off events. [2024-05-12 10:50:25,647 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2024-05-12 10:50:25,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 119 events. 56/119 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 283 event pairs, 10 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 193. Up to 102 conditions per place. [2024-05-12 10:50:25,649 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 34 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2024-05-12 10:50:25,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 249 flow [2024-05-12 10:50:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:50:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:50:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2024-05-12 10:50:25,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5287356321839081 [2024-05-12 10:50:25,650 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 141 flow. Second operand 3 states and 46 transitions. [2024-05-12 10:50:25,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 249 flow [2024-05-12 10:50:25,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 10:50:25,652 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 164 flow [2024-05-12 10:50:25,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2024-05-12 10:50:25,653 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2024-05-12 10:50:25,653 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 164 flow [2024-05-12 10:50:25,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:25,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:50:25,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:50:25,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 10:50:25,654 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:50:25,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:50:25,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1669791125, now seen corresponding path program 1 times [2024-05-12 10:50:25,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:50:25,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044586316] [2024-05-12 10:50:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:50:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:50:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:50:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:50:25,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:50:25,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044586316] [2024-05-12 10:50:25,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044586316] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:50:25,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:50:25,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:50:25,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031294938] [2024-05-12 10:50:25,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:50:25,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:50:25,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:50:25,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:50:25,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:50:25,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 10:50:25,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:25,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:50:25,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 10:50:25,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:50:25,883 INFO L124 PetriNetUnfolderBase]: 55/117 cut-off events. [2024-05-12 10:50:25,883 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2024-05-12 10:50:25,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 117 events. 55/117 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 265 event pairs, 16 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 195. Up to 69 conditions per place. [2024-05-12 10:50:25,885 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 33 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2024-05-12 10:50:25,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 256 flow [2024-05-12 10:50:25,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:50:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:50:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-05-12 10:50:25,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2024-05-12 10:50:25,886 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 164 flow. Second operand 3 states and 44 transitions. [2024-05-12 10:50:25,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 256 flow [2024-05-12 10:50:25,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 10:50:25,887 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 176 flow [2024-05-12 10:50:25,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2024-05-12 10:50:25,888 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2024-05-12 10:50:25,888 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 176 flow [2024-05-12 10:50:25,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:25,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:50:25,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:50:25,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 10:50:25,889 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:50:25,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:50:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1669790164, now seen corresponding path program 1 times [2024-05-12 10:50:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:50:25,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087292449] [2024-05-12 10:50:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:50:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:50:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:50:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:50:26,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:50:26,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087292449] [2024-05-12 10:50:26,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087292449] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:50:26,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:50:26,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:50:26,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100344117] [2024-05-12 10:50:26,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:50:26,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:50:26,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:50:26,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:50:26,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:50:26,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 10:50:26,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:26,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:50:26,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 10:50:26,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:50:26,216 INFO L124 PetriNetUnfolderBase]: 57/122 cut-off events. [2024-05-12 10:50:26,216 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2024-05-12 10:50:26,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 122 events. 57/122 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 300 event pairs, 12 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 162. Up to 83 conditions per place. [2024-05-12 10:50:26,217 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 37 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2024-05-12 10:50:26,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 319 flow [2024-05-12 10:50:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 10:50:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 10:50:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2024-05-12 10:50:26,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49137931034482757 [2024-05-12 10:50:26,219 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 176 flow. Second operand 4 states and 57 transitions. [2024-05-12 10:50:26,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 319 flow [2024-05-12 10:50:26,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 10:50:26,221 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 201 flow [2024-05-12 10:50:26,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2024-05-12 10:50:26,221 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2024-05-12 10:50:26,221 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 201 flow [2024-05-12 10:50:26,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:26,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:50:26,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:50:26,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 10:50:26,222 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:50:26,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:50:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1669789234, now seen corresponding path program 2 times [2024-05-12 10:50:26,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:50:26,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293419259] [2024-05-12 10:50:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:50:26,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:50:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:50:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:50:26,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:50:26,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293419259] [2024-05-12 10:50:26,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293419259] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:50:26,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:50:26,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:50:26,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261594275] [2024-05-12 10:50:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:50:26,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:50:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:50:26,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:50:26,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:50:26,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 10:50:26,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:26,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:50:26,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 10:50:26,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:50:26,463 INFO L124 PetriNetUnfolderBase]: 56/120 cut-off events. [2024-05-12 10:50:26,463 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2024-05-12 10:50:26,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 120 events. 56/120 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 273 event pairs, 19 based on Foata normal form. 1/121 useless extension candidates. Maximal degree in co-relation 152. Up to 82 conditions per place. [2024-05-12 10:50:26,464 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 34 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2024-05-12 10:50:26,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 299 flow [2024-05-12 10:50:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:50:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:50:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2024-05-12 10:50:26,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2024-05-12 10:50:26,465 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 201 flow. Second operand 3 states and 45 transitions. [2024-05-12 10:50:26,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 299 flow [2024-05-12 10:50:26,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 283 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-05-12 10:50:26,467 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 205 flow [2024-05-12 10:50:26,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-05-12 10:50:26,468 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2024-05-12 10:50:26,468 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 205 flow [2024-05-12 10:50:26,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:26,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:50:26,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:50:26,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 10:50:26,469 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:50:26,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:50:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash -223917346, now seen corresponding path program 1 times [2024-05-12 10:50:26,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:50:26,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221060383] [2024-05-12 10:50:26,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:50:26,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:50:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:50:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:50:26,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:50:26,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221060383] [2024-05-12 10:50:26,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221060383] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:50:26,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:50:26,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:50:26,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373359563] [2024-05-12 10:50:26,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:50:26,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:50:26,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:50:26,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:50:26,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:50:26,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-05-12 10:50:26,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:26,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:50:26,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-05-12 10:50:26,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:50:26,774 INFO L124 PetriNetUnfolderBase]: 56/119 cut-off events. [2024-05-12 10:50:26,774 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2024-05-12 10:50:26,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 119 events. 56/119 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 273 event pairs, 19 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 153. Up to 80 conditions per place. [2024-05-12 10:50:26,775 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2024-05-12 10:50:26,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 283 flow [2024-05-12 10:50:26,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 10:50:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 10:50:26,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2024-05-12 10:50:26,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2024-05-12 10:50:26,776 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 205 flow. Second operand 4 states and 48 transitions. [2024-05-12 10:50:26,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 283 flow [2024-05-12 10:50:26,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 248 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 10:50:26,778 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 164 flow [2024-05-12 10:50:26,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2024-05-12 10:50:26,778 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2024-05-12 10:50:26,779 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 164 flow [2024-05-12 10:50:26,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:26,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:50:26,779 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] [2024-05-12 10:50:26,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 10:50:26,779 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:50:26,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:50:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1709313815, now seen corresponding path program 1 times [2024-05-12 10:50:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:50:26,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883249791] [2024-05-12 10:50:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:50:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:50:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:50:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:50:26,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:50:26,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883249791] [2024-05-12 10:50:26,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883249791] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:50:26,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:50:26,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:50:26,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725152755] [2024-05-12 10:50:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:50:26,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:50:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:50:26,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:50:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:50:26,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-05-12 10:50:26,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:26,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:50:26,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-05-12 10:50:26,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:50:27,090 INFO L124 PetriNetUnfolderBase]: 61/142 cut-off events. [2024-05-12 10:50:27,090 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2024-05-12 10:50:27,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 142 events. 61/142 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 410 event pairs, 10 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 129. Up to 67 conditions per place. [2024-05-12 10:50:27,091 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 30 selfloop transitions, 6 changer transitions 19/56 dead transitions. [2024-05-12 10:50:27,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 335 flow [2024-05-12 10:50:27,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:50:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:50:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-05-12 10:50:27,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2024-05-12 10:50:27,093 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 164 flow. Second operand 5 states and 85 transitions. [2024-05-12 10:50:27,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 335 flow [2024-05-12 10:50:27,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 10:50:27,095 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 131 flow [2024-05-12 10:50:27,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2024-05-12 10:50:27,097 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2024-05-12 10:50:27,097 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 131 flow [2024-05-12 10:50:27,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:27,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:50:27,113 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] [2024-05-12 10:50:27,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 10:50:27,113 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:50:27,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:50:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash -98372857, now seen corresponding path program 2 times [2024-05-12 10:50:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:50:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241469450] [2024-05-12 10:50:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:50:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:50:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:50:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:50:27,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:50:27,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241469450] [2024-05-12 10:50:27,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241469450] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:50:27,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:50:27,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:50:27,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448849578] [2024-05-12 10:50:27,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:50:27,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:50:27,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:50:27,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:50:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:50:27,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-05-12 10:50:27,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:27,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:50:27,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-05-12 10:50:27,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:50:27,552 INFO L124 PetriNetUnfolderBase]: 27/82 cut-off events. [2024-05-12 10:50:27,553 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2024-05-12 10:50:27,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 82 events. 27/82 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 188 event pairs, 2 based on Foata normal form. 1/83 useless extension candidates. Maximal degree in co-relation 294. Up to 29 conditions per place. [2024-05-12 10:50:27,553 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 26 selfloop transitions, 5 changer transitions 12/44 dead transitions. [2024-05-12 10:50:27,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 256 flow [2024-05-12 10:50:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:50:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:50:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-05-12 10:50:27,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47701149425287354 [2024-05-12 10:50:27,555 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 131 flow. Second operand 6 states and 83 transitions. [2024-05-12 10:50:27,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 256 flow [2024-05-12 10:50:27,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 227 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-05-12 10:50:27,556 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 101 flow [2024-05-12 10:50:27,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2024-05-12 10:50:27,557 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2024-05-12 10:50:27,557 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 101 flow [2024-05-12 10:50:27,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:27,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:50:27,557 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] [2024-05-12 10:50:27,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 10:50:27,558 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:50:27,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:50:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1391032139, now seen corresponding path program 3 times [2024-05-12 10:50:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:50:27,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289731468] [2024-05-12 10:50:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:50:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:50:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:50:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:50:27,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:50:27,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289731468] [2024-05-12 10:50:27,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289731468] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:50:27,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:50:27,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:50:27,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859950202] [2024-05-12 10:50:27,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:50:27,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:50:27,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:50:27,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:50:27,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:50:27,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-05-12 10:50:27,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:27,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:50:27,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-05-12 10:50:27,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:50:27,835 INFO L124 PetriNetUnfolderBase]: 16/51 cut-off events. [2024-05-12 10:50:27,835 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-05-12 10:50:27,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 51 events. 16/51 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 2 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 173. Up to 21 conditions per place. [2024-05-12 10:50:27,835 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 0 selfloop transitions, 0 changer transitions 30/30 dead transitions. [2024-05-12 10:50:27,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 170 flow [2024-05-12 10:50:27,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:50:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:50:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2024-05-12 10:50:27,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4413793103448276 [2024-05-12 10:50:27,837 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 101 flow. Second operand 5 states and 64 transitions. [2024-05-12 10:50:27,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 170 flow [2024-05-12 10:50:27,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 152 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 10:50:27,838 INFO L231 Difference]: Finished difference. Result has 35 places, 0 transitions, 0 flow [2024-05-12 10:50:27,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=35, PETRI_TRANSITIONS=0} [2024-05-12 10:50:27,838 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2024-05-12 10:50:27,838 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 0 transitions, 0 flow [2024-05-12 10:50:27,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 10:50:27,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 7 remaining) [2024-05-12 10:50:27,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 7 remaining) [2024-05-12 10:50:27,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-05-12 10:50:27,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-05-12 10:50:27,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-12 10:50:27,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-12 10:50:27,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-05-12 10:50:27,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 10:50:27,842 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:50:27,844 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 10:50:27,844 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 10:50:27,847 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-05-12 10:50:27,847 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-05-12 10:50:27,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 10:50:27 BasicIcfg [2024-05-12 10:50:27,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 10:50:27,849 INFO L158 Benchmark]: Toolchain (without parser) took 4841.24ms. Allocated memory was 159.4MB in the beginning and 272.6MB in the end (delta: 113.2MB). Free memory was 132.9MB in the beginning and 189.8MB in the end (delta: -56.9MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. [2024-05-12 10:50:27,849 INFO L158 Benchmark]: Witness Parser took 0.11ms. Allocated memory is still 98.6MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 10:50:27,849 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 159.4MB. Free memory was 136.7MB in the beginning and 136.3MB in the end (delta: 369.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 10:50:27,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.89ms. Allocated memory is still 159.4MB. Free memory was 132.9MB in the beginning and 121.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-05-12 10:50:27,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.36ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 120.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 10:50:27,850 INFO L158 Benchmark]: Boogie Preprocessor took 51.71ms. Allocated memory is still 159.4MB. Free memory was 120.4MB in the beginning and 118.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 10:50:27,850 INFO L158 Benchmark]: RCFGBuilder took 454.31ms. Allocated memory is still 159.4MB. Free memory was 118.3MB in the beginning and 86.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-05-12 10:50:27,850 INFO L158 Benchmark]: TraceAbstraction took 3911.31ms. Allocated memory was 159.4MB in the beginning and 272.6MB in the end (delta: 113.2MB). Free memory was 86.3MB in the beginning and 189.8MB in the end (delta: -103.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-05-12 10:50:27,851 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.11ms. Allocated memory is still 98.6MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.08ms. Allocated memory is still 159.4MB. Free memory was 136.7MB in the beginning and 136.3MB in the end (delta: 369.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.89ms. Allocated memory is still 159.4MB. Free memory was 132.9MB in the beginning and 121.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.36ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 120.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.71ms. Allocated memory is still 159.4MB. Free memory was 120.4MB in the beginning and 118.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.31ms. Allocated memory is still 159.4MB. Free memory was 118.3MB in the beginning and 86.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3911.31ms. Allocated memory was 159.4MB in the beginning and 272.6MB in the end (delta: 113.2MB). Free memory was 86.3MB in the beginning and 189.8MB in the end (delta: -103.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 69]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 70]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 71]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 76]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 39 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 394 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 694 IncrementalHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 4 mSDtfsCounter, 694 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=8, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 1092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-12 10:50:27,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE