./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe022_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe022_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe022_tso.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.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:04:08,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:04:08,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:04:08,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:04:08,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:04:08,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:04:08,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:04:08,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:04:08,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:04:08,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:04:08,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:04:08,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:04:08,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:04:08,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:04:08,447 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:04:08,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:04:08,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:04:08,448 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:04:08,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:04:08,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:04:08,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:04:08,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:04:08,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:04:08,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:04:08,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:04:08,450 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:04:08,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:04:08,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:04:08,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:04:08,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:04:08,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:04:08,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:04:08,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:04:08,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:04:08,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:04:08,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:04:08,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:04:08,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:04:08,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:04:08,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:04:08,456 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:04:08,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:04:08,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:04:08,457 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-02-07 19:04:08,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:04:08,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:04:08,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:04:08,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:04:08,759 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:04:08,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_tso.i [2024-02-07 19:04:10,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:04:10,510 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:04:10,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_tso.i [2024-02-07 19:04:10,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa71c18e/e4f349e19b8c45b99cf19ab2a1859562/FLAG8a8f4092d [2024-02-07 19:04:10,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa71c18e/e4f349e19b8c45b99cf19ab2a1859562 [2024-02-07 19:04:10,556 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:04:10,557 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:04:10,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe022_tso.yml/witness.yml [2024-02-07 19:04:10,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:04:10,647 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:04:10,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:04:10,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:04:10,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:04:10,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:04:10" (1/2) ... [2024-02-07 19:04:10,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1a6107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:10, skipping insertion in model container [2024-02-07 19:04:10,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:04:10" (1/2) ... [2024-02-07 19:04:10,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6c0e35ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:10, skipping insertion in model container [2024-02-07 19:04:10,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:04:10" (2/2) ... [2024-02-07 19:04:10,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1a6107 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:10, skipping insertion in model container [2024-02-07 19:04:10,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:04:10" (2/2) ... [2024-02-07 19:04:10,658 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:04:10,727 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:04:10,728 INFO L76 edCorrectnessWitness]: Location invariant before [L730-L730] 0 <= __unbuffered_cnt [2024-02-07 19:04:10,729 INFO L76 edCorrectnessWitness]: Location invariant before [L741-L741] ((0 <= __unbuffered_p1_EBX) && (__unbuffered_p1_EBX <= 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) [2024-02-07 19:04:10,729 INFO L76 edCorrectnessWitness]: Location invariant before [L731-L731] 1 <= __unbuffered_cnt [2024-02-07 19:04:10,729 INFO L76 edCorrectnessWitness]: Location invariant before [L765-L765] 0 <= __unbuffered_cnt [2024-02-07 19:04:10,730 INFO L76 edCorrectnessWitness]: Location invariant before [L723-L723] y == 1 [2024-02-07 19:04:10,731 INFO L76 edCorrectnessWitness]: Location invariant before [L773-L773] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:04:10,732 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:04:10,732 INFO L76 edCorrectnessWitness]: Location invariant before [L737-L737] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 19:04:10,732 INFO L76 edCorrectnessWitness]: Location invariant before [L771-L771] (((0 <= __unbuffered_p1_EBX) && (__unbuffered_p1_EBX <= 1)) && (__unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) [2024-02-07 19:04:10,732 INFO L76 edCorrectnessWitness]: Location invariant before [L766-L766] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:04:10,732 INFO L76 edCorrectnessWitness]: Location invariant before [L726-L726] x == 1 [2024-02-07 19:04:10,732 INFO L76 edCorrectnessWitness]: Location invariant before [L738-L738] ((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 19:04:10,733 INFO L76 edCorrectnessWitness]: Location invariant before [L746-L746] 1 <= __unbuffered_cnt [2024-02-07 19:04:10,733 INFO L76 edCorrectnessWitness]: Location invariant before [L767-L767] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:04:10,733 INFO L76 edCorrectnessWitness]: Location invariant before [L740-L740] ((0 <= y) && (y <= 1)) && (y == 0 || y == 1) [2024-02-07 19:04:10,733 INFO L76 edCorrectnessWitness]: Location invariant before [L745-L745] 0 <= __unbuffered_cnt [2024-02-07 19:04:10,733 INFO L76 edCorrectnessWitness]: Location invariant before [L772-L772] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:04:10,785 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:04:10,981 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_tso.i[945,958] [2024-02-07 19:04:11,153 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:04:11,164 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:04:11,206 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_tso.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:04:11,243 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:04:11,280 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:04:11,281 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11 WrapperNode [2024-02-07 19:04:11,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:04:11,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:04:11,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:04:11,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:04:11,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (1/1) ... [2024-02-07 19:04:11,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (1/1) ... [2024-02-07 19:04:11,351 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2024-02-07 19:04:11,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:04:11,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:04:11,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:04:11,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:04:11,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (1/1) ... [2024-02-07 19:04:11,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (1/1) ... [2024-02-07 19:04:11,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (1/1) ... [2024-02-07 19:04:11,396 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-07 19:04:11,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (1/1) ... [2024-02-07 19:04:11,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (1/1) ... [2024-02-07 19:04:11,418 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (1/1) ... [2024-02-07 19:04:11,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (1/1) ... [2024-02-07 19:04:11,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (1/1) ... [2024-02-07 19:04:11,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (1/1) ... [2024-02-07 19:04:11,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:04:11,494 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:04:11,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:04:11,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:04:11,496 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (1/1) ... [2024-02-07 19:04:11,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:04:11,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:04:11,575 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-02-07 19:04:11,618 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-02-07 19:04:11,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:04:11,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:04:11,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:04:11,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:04:11,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:04:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:04:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:04:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:04:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:04:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:04:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:04:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:04:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:04:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:04:11,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:04:11,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:04:11,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:04:11,654 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 19:04:11,770 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:04:11,772 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:04:12,006 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:04:12,006 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:04:12,175 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:04:12,176 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:04:12,177 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:04:12 BoogieIcfgContainer [2024-02-07 19:04:12,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:04:12,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:04:12,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:04:12,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:04:12,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:04:10" (1/4) ... [2024-02-07 19:04:12,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9d3f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:04:12, skipping insertion in model container [2024-02-07 19:04:12,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:04:10" (2/4) ... [2024-02-07 19:04:12,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9d3f7b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:04:12, skipping insertion in model container [2024-02-07 19:04:12,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:11" (3/4) ... [2024-02-07 19:04:12,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9d3f7b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:04:12, skipping insertion in model container [2024-02-07 19:04:12,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:04:12" (4/4) ... [2024-02-07 19:04:12,190 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_tso.i [2024-02-07 19:04:12,211 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:04:12,212 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-02-07 19:04:12,212 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:04:12,260 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:04:12,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 47 transitions, 102 flow [2024-02-07 19:04:12,338 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-02-07 19:04:12,339 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:04:12,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-02-07 19:04:12,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 47 transitions, 102 flow [2024-02-07 19:04:12,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 45 transitions, 96 flow [2024-02-07 19:04:12,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:04:12,369 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;@6928d06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:04:12,370 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-02-07 19:04:12,374 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:04:12,374 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:04:12,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:04:12,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:12,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:04:12,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:04:12,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash 8615742, now seen corresponding path program 1 times [2024-02-07 19:04:12,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:12,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143962934] [2024-02-07 19:04:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:12,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:12,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143962934] [2024-02-07 19:04:12,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143962934] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:12,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:12,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:12,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936610488] [2024-02-07 19:04:12,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:12,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 19:04:12,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:12,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 19:04:12,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 19:04:12,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-02-07 19:04:12,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 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-02-07 19:04:12,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:12,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-02-07 19:04:12,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:13,224 INFO L124 PetriNetUnfolderBase]: 701/1499 cut-off events. [2024-02-07 19:04:13,225 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-07 19:04:13,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 1499 events. 701/1499 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10288 event pairs, 701 based on Foata normal form. 48/1099 useless extension candidates. Maximal degree in co-relation 2653. Up to 1147 conditions per place. [2024-02-07 19:04:13,261 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 24 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2024-02-07 19:04:13,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 126 flow [2024-02-07 19:04:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 19:04:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 19:04:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2024-02-07 19:04:13,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.648936170212766 [2024-02-07 19:04:13,288 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 96 flow. Second operand 2 states and 61 transitions. [2024-02-07 19:04:13,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 126 flow [2024-02-07 19:04:13,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:13,313 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 76 flow [2024-02-07 19:04:13,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2024-02-07 19:04:13,320 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2024-02-07 19:04:13,320 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 76 flow [2024-02-07 19:04:13,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 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-02-07 19:04:13,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:13,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 19:04:13,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:04:13,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:04:13,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:13,323 INFO L85 PathProgramCache]: Analyzing trace with hash -310236585, now seen corresponding path program 1 times [2024-02-07 19:04:13,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:13,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272333682] [2024-02-07 19:04:13,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:13,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:13,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:13,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272333682] [2024-02-07 19:04:13,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272333682] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:13,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:13,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:13,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116233000] [2024-02-07 19:04:13,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:13,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:13,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:13,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:13,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:13,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-02-07 19:04:13,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-02-07 19:04:13,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:13,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-02-07 19:04:13,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:13,988 INFO L124 PetriNetUnfolderBase]: 667/1268 cut-off events. [2024-02-07 19:04:13,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:04:13,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2379 conditions, 1268 events. 667/1268 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8085 event pairs, 187 based on Foata normal form. 0/928 useless extension candidates. Maximal degree in co-relation 2376. Up to 804 conditions per place. [2024-02-07 19:04:14,000 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 38 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-02-07 19:04:14,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 190 flow [2024-02-07 19:04:14,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-02-07 19:04:14,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5886524822695035 [2024-02-07 19:04:14,020 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 76 flow. Second operand 3 states and 83 transitions. [2024-02-07 19:04:14,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 190 flow [2024-02-07 19:04:14,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:04:14,024 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 84 flow [2024-02-07 19:04:14,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-02-07 19:04:14,025 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2024-02-07 19:04:14,025 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 84 flow [2024-02-07 19:04:14,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-02-07 19:04:14,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:14,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 19:04:14,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:04:14,026 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:04:14,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash -310237537, now seen corresponding path program 1 times [2024-02-07 19:04:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:14,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405076593] [2024-02-07 19:04:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:14,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-02-07 19:04:14,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:14,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405076593] [2024-02-07 19:04:14,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405076593] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:14,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:14,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:14,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475088686] [2024-02-07 19:04:14,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:14,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:14,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:14,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:14,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:14,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-02-07 19:04:14,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-02-07 19:04:14,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:14,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-02-07 19:04:14,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:14,391 INFO L124 PetriNetUnfolderBase]: 486/928 cut-off events. [2024-02-07 19:04:14,391 INFO L125 PetriNetUnfolderBase]: For 77/78 co-relation queries the response was YES. [2024-02-07 19:04:14,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1893 conditions, 928 events. 486/928 cut-off events. For 77/78 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5288 event pairs, 188 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 1888. Up to 571 conditions per place. [2024-02-07 19:04:14,404 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 38 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2024-02-07 19:04:14,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 207 flow [2024-02-07 19:04:14,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-02-07 19:04:14,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6099290780141844 [2024-02-07 19:04:14,409 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 84 flow. Second operand 3 states and 86 transitions. [2024-02-07 19:04:14,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 207 flow [2024-02-07 19:04:14,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:14,425 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 103 flow [2024-02-07 19:04:14,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2024-02-07 19:04:14,427 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-02-07 19:04:14,427 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 103 flow [2024-02-07 19:04:14,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-02-07 19:04:14,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:14,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:14,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:04:14,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:04:14,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:14,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1027399215, now seen corresponding path program 1 times [2024-02-07 19:04:14,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:14,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380838550] [2024-02-07 19:04:14,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:14,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:14,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:14,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380838550] [2024-02-07 19:04:14,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380838550] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:14,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:14,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289019377] [2024-02-07 19:04:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:14,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:14,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:14,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:14,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:14,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-02-07 19:04:14,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-02-07 19:04:14,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:14,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-02-07 19:04:14,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:14,667 INFO L124 PetriNetUnfolderBase]: 471/876 cut-off events. [2024-02-07 19:04:14,668 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-02-07 19:04:14,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1995 conditions, 876 events. 471/876 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4858 event pairs, 141 based on Foata normal form. 0/759 useless extension candidates. Maximal degree in co-relation 1989. Up to 721 conditions per place. [2024-02-07 19:04:14,675 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 38 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-02-07 19:04:14,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 218 flow [2024-02-07 19:04:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-02-07 19:04:14,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-02-07 19:04:14,679 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 103 flow. Second operand 3 states and 81 transitions. [2024-02-07 19:04:14,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 218 flow [2024-02-07 19:04:14,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:04:14,682 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 108 flow [2024-02-07 19:04:14,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-02-07 19:04:14,684 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-02-07 19:04:14,684 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 108 flow [2024-02-07 19:04:14,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-02-07 19:04:14,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:14,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:14,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:04:14,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:04:14,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1027428746, now seen corresponding path program 1 times [2024-02-07 19:04:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593345325] [2024-02-07 19:04:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:14,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593345325] [2024-02-07 19:04:14,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593345325] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:14,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:14,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:14,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614652412] [2024-02-07 19:04:14,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:14,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:14,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:14,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:14,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-02-07 19:04:14,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:14,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:14,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-02-07 19:04:14,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:14,903 INFO L124 PetriNetUnfolderBase]: 471/1017 cut-off events. [2024-02-07 19:04:14,903 INFO L125 PetriNetUnfolderBase]: For 213/214 co-relation queries the response was YES. [2024-02-07 19:04:14,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 1017 events. 471/1017 cut-off events. For 213/214 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6366 event pairs, 453 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 2187. Up to 794 conditions per place. [2024-02-07 19:04:14,913 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 25 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2024-02-07 19:04:14,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 158 flow [2024-02-07 19:04:14,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2024-02-07 19:04:14,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45390070921985815 [2024-02-07 19:04:14,915 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 108 flow. Second operand 3 states and 64 transitions. [2024-02-07 19:04:14,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 158 flow [2024-02-07 19:04:14,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:14,919 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 104 flow [2024-02-07 19:04:14,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-02-07 19:04:14,921 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2024-02-07 19:04:14,922 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 104 flow [2024-02-07 19:04:14,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:14,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:14,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:14,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:04:14,923 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:04:14,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1674842089, now seen corresponding path program 1 times [2024-02-07 19:04:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:14,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390440775] [2024-02-07 19:04:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:14,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:14,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:14,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390440775] [2024-02-07 19:04:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390440775] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:14,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:14,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:14,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522306474] [2024-02-07 19:04:14,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:14,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:14,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:14,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:14,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-02-07 19:04:14,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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-02-07 19:04:14,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:14,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-02-07 19:04:14,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:15,099 INFO L124 PetriNetUnfolderBase]: 431/858 cut-off events. [2024-02-07 19:04:15,099 INFO L125 PetriNetUnfolderBase]: For 144/145 co-relation queries the response was YES. [2024-02-07 19:04:15,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 858 events. 431/858 cut-off events. For 144/145 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4976 event pairs, 147 based on Foata normal form. 27/792 useless extension candidates. Maximal degree in co-relation 1882. Up to 523 conditions per place. [2024-02-07 19:04:15,105 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 39 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2024-02-07 19:04:15,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 218 flow [2024-02-07 19:04:15,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-02-07 19:04:15,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-02-07 19:04:15,107 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 104 flow. Second operand 3 states and 81 transitions. [2024-02-07 19:04:15,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 218 flow [2024-02-07 19:04:15,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:15,109 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 99 flow [2024-02-07 19:04:15,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-02-07 19:04:15,113 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-02-07 19:04:15,113 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 99 flow [2024-02-07 19:04:15,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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-02-07 19:04:15,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:15,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:15,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:04:15,114 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:04:15,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:15,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1674847951, now seen corresponding path program 1 times [2024-02-07 19:04:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:15,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211972852] [2024-02-07 19:04:15,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:15,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:15,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:15,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211972852] [2024-02-07 19:04:15,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211972852] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:15,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:15,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:15,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017069732] [2024-02-07 19:04:15,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:15,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:15,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:15,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:15,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:15,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-02-07 19:04:15,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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-02-07 19:04:15,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:15,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-02-07 19:04:15,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:15,284 INFO L124 PetriNetUnfolderBase]: 376/719 cut-off events. [2024-02-07 19:04:15,285 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2024-02-07 19:04:15,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1608 conditions, 719 events. 376/719 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3835 event pairs, 88 based on Foata normal form. 34/677 useless extension candidates. Maximal degree in co-relation 1602. Up to 565 conditions per place. [2024-02-07 19:04:15,289 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 37 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2024-02-07 19:04:15,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 205 flow [2024-02-07 19:04:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-02-07 19:04:15,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5602836879432624 [2024-02-07 19:04:15,291 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 99 flow. Second operand 3 states and 79 transitions. [2024-02-07 19:04:15,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 205 flow [2024-02-07 19:04:15,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:15,294 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 94 flow [2024-02-07 19:04:15,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-02-07 19:04:15,295 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2024-02-07 19:04:15,295 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 94 flow [2024-02-07 19:04:15,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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-02-07 19:04:15,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:15,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:15,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:04:15,296 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:04:15,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:15,297 INFO L85 PathProgramCache]: Analyzing trace with hash 483460802, now seen corresponding path program 1 times [2024-02-07 19:04:15,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:15,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355236090] [2024-02-07 19:04:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:15,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:15,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:15,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355236090] [2024-02-07 19:04:15,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355236090] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:15,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:15,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:04:15,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756144296] [2024-02-07 19:04:15,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:15,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:04:15,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:15,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:04:15,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:04:15,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-02-07 19:04:15,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:15,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:15,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-02-07 19:04:15,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:15,575 INFO L124 PetriNetUnfolderBase]: 294/688 cut-off events. [2024-02-07 19:04:15,575 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-02-07 19:04:15,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 688 events. 294/688 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3967 event pairs, 62 based on Foata normal form. 29/614 useless extension candidates. Maximal degree in co-relation 1416. Up to 289 conditions per place. [2024-02-07 19:04:15,580 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 38 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2024-02-07 19:04:15,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 230 flow [2024-02-07 19:04:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:04:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:04:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-02-07 19:04:15,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-02-07 19:04:15,582 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 94 flow. Second operand 4 states and 96 transitions. [2024-02-07 19:04:15,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 230 flow [2024-02-07 19:04:15,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:04:15,585 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 115 flow [2024-02-07 19:04:15,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-02-07 19:04:15,587 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2024-02-07 19:04:15,587 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 115 flow [2024-02-07 19:04:15,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:15,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:15,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:15,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:04:15,588 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:04:15,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1090379666, now seen corresponding path program 1 times [2024-02-07 19:04:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:15,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820919505] [2024-02-07 19:04:15,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:15,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:15,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820919505] [2024-02-07 19:04:15,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820919505] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:15,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:15,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55328189] [2024-02-07 19:04:15,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:15,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:15,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:15,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:15,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:15,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-02-07 19:04:15,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-02-07 19:04:15,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:15,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-02-07 19:04:15,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:15,692 INFO L124 PetriNetUnfolderBase]: 220/522 cut-off events. [2024-02-07 19:04:15,692 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2024-02-07 19:04:15,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 522 events. 220/522 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2700 event pairs, 110 based on Foata normal form. 16/487 useless extension candidates. Maximal degree in co-relation 1166. Up to 336 conditions per place. [2024-02-07 19:04:15,696 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 25 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2024-02-07 19:04:15,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 179 flow [2024-02-07 19:04:15,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-02-07 19:04:15,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-02-07 19:04:15,698 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 115 flow. Second operand 3 states and 74 transitions. [2024-02-07 19:04:15,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 179 flow [2024-02-07 19:04:15,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:15,700 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 96 flow [2024-02-07 19:04:15,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2024-02-07 19:04:15,701 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-02-07 19:04:15,701 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 96 flow [2024-02-07 19:04:15,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-02-07 19:04:15,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:15,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:15,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:04:15,702 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:04:15,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:15,702 INFO L85 PathProgramCache]: Analyzing trace with hash -662665581, now seen corresponding path program 1 times [2024-02-07 19:04:15,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:15,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054544454] [2024-02-07 19:04:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:15,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:15,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:15,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054544454] [2024-02-07 19:04:15,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054544454] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:15,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:15,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:04:15,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135574067] [2024-02-07 19:04:15,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:15,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:04:15,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:15,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:04:15,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:04:15,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-02-07 19:04:15,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:15,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:15,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-02-07 19:04:15,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:15,863 INFO L124 PetriNetUnfolderBase]: 102/240 cut-off events. [2024-02-07 19:04:15,863 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-02-07 19:04:15,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 240 events. 102/240 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 828 event pairs, 26 based on Foata normal form. 16/241 useless extension candidates. Maximal degree in co-relation 573. Up to 86 conditions per place. [2024-02-07 19:04:15,865 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 26 selfloop transitions, 6 changer transitions 1/44 dead transitions. [2024-02-07 19:04:15,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 194 flow [2024-02-07 19:04:15,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:04:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:04:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-02-07 19:04:15,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2024-02-07 19:04:15,866 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 96 flow. Second operand 5 states and 100 transitions. [2024-02-07 19:04:15,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 194 flow [2024-02-07 19:04:15,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 181 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 19:04:15,869 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 107 flow [2024-02-07 19:04:15,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2024-02-07 19:04:15,869 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-02-07 19:04:15,870 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 107 flow [2024-02-07 19:04:15,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:15,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:15,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:15,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:04:15,870 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:04:15,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1461587233, now seen corresponding path program 1 times [2024-02-07 19:04:15,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:15,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297637928] [2024-02-07 19:04:15,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:04:15,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:04:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:04:15,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:04:15,914 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:04:15,915 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 30 remaining) [2024-02-07 19:04:15,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 30 remaining) [2024-02-07 19:04:15,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 30 remaining) [2024-02-07 19:04:15,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 30 remaining) [2024-02-07 19:04:15,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 30 remaining) [2024-02-07 19:04:15,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 30 remaining) [2024-02-07 19:04:15,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 30 remaining) [2024-02-07 19:04:15,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 30 remaining) [2024-02-07 19:04:15,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 30 remaining) [2024-02-07 19:04:15,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 30 remaining) [2024-02-07 19:04:15,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 30 remaining) [2024-02-07 19:04:15,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 30 remaining) [2024-02-07 19:04:15,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 30 remaining) [2024-02-07 19:04:15,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 30 remaining) [2024-02-07 19:04:15,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 30 remaining) [2024-02-07 19:04:15,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 30 remaining) [2024-02-07 19:04:15,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 30 remaining) [2024-02-07 19:04:15,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (12 of 30 remaining) [2024-02-07 19:04:15,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 30 remaining) [2024-02-07 19:04:15,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 30 remaining) [2024-02-07 19:04:15,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 30 remaining) [2024-02-07 19:04:15,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 30 remaining) [2024-02-07 19:04:15,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 30 remaining) [2024-02-07 19:04:15,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 30 remaining) [2024-02-07 19:04:15,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 30 remaining) [2024-02-07 19:04:15,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 30 remaining) [2024-02-07 19:04:15,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 30 remaining) [2024-02-07 19:04:15,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 30 remaining) [2024-02-07 19:04:15,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 30 remaining) [2024-02-07 19:04:15,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 30 remaining) [2024-02-07 19:04:15,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 19:04:15,922 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:15,928 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:04:15,929 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:04:15,955 INFO L503 ceAbstractionStarter]: Automizer considered 17 witness invariants [2024-02-07 19:04:15,956 INFO L504 ceAbstractionStarter]: WitnessConsidered=17 [2024-02-07 19:04:15,957 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:04:15 BasicIcfg [2024-02-07 19:04:15,957 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:04:15,957 INFO L158 Benchmark]: Toolchain (without parser) took 5310.19ms. Allocated memory was 163.6MB in the beginning and 211.8MB in the end (delta: 48.2MB). Free memory was 100.6MB in the beginning and 60.9MB in the end (delta: 39.7MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2024-02-07 19:04:15,958 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:04:15,958 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:04:15,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 632.51ms. Allocated memory is still 163.6MB. Free memory was 100.2MB in the beginning and 72.0MB in the end (delta: 28.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-02-07 19:04:15,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.62ms. Allocated memory is still 163.6MB. Free memory was 72.0MB in the beginning and 69.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:04:15,959 INFO L158 Benchmark]: Boogie Preprocessor took 138.72ms. Allocated memory is still 163.6MB. Free memory was 69.9MB in the beginning and 132.1MB in the end (delta: -62.1MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-02-07 19:04:15,959 INFO L158 Benchmark]: RCFGBuilder took 683.60ms. Allocated memory was 163.6MB in the beginning and 211.8MB in the end (delta: 48.2MB). Free memory was 132.0MB in the beginning and 155.5MB in the end (delta: -23.5MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-02-07 19:04:15,959 INFO L158 Benchmark]: TraceAbstraction took 3776.31ms. Allocated memory is still 211.8MB. Free memory was 154.5MB in the beginning and 60.9MB in the end (delta: 93.6MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. [2024-02-07 19:04:15,960 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 632.51ms. Allocated memory is still 163.6MB. Free memory was 100.2MB in the beginning and 72.0MB in the end (delta: 28.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.62ms. Allocated memory is still 163.6MB. Free memory was 72.0MB in the beginning and 69.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.72ms. Allocated memory is still 163.6MB. Free memory was 69.9MB in the beginning and 132.1MB in the end (delta: -62.1MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * RCFGBuilder took 683.60ms. Allocated memory was 163.6MB in the beginning and 211.8MB in the end (delta: 48.2MB). Free memory was 132.0MB in the beginning and 155.5MB in the end (delta: -23.5MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3776.31ms. Allocated memory is still 211.8MB. Free memory was 154.5MB in the beginning and 60.9MB in the end (delta: 93.6MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 771]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L760] 0 pthread_t t2317; [L761] FCALL, FORK 0 pthread_create(&t2317, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2317={5:0}, x=0, y=0] [L722] 1 y = 1 [L723] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=1] [L762] 0 pthread_t t2318; [L763] FCALL, FORK 0 pthread_create(&t2318, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2317={5:0}, t2318={3:0}, x=0, y=1] [L737] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L737] 2 __unbuffered_p1_EAX = x [L738] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=1] [L725] 1 x = 1 [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L740] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]]]] [L740] 2 __unbuffered_p1_EBX = y [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EBX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EBX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L730] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L731] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L745] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L745] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L765] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L765] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L766] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2317={5:0}, t2318={3:0}, x=1, y=1] [L767] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L767] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L767] RET 0 assume_abort_if_not(main$tmp_guard0) [L771] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EBX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EBX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2317={5:0}, t2318={3:0}, x=1, y=1] - UnprovableResult [Line: 723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 740]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 763]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 73 locations, 30 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.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 181 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 440 IncrementalHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 4 mSDtfsCounter, 440 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=8, InterpolantAutomatonStates: 32, 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.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 RESULT: Ultimate proved your program to be incorrect! [2024-02-07 19:04:16,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE