./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe036.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/safe036.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/safe036.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe036.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:05:01,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:05:02,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:05:02,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:05:02,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:05:02,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:05:02,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:05:02,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:05:02,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:05:02,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:05:02,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:05:02,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:05:02,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:05:02,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:05:02,086 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:05:02,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:05:02,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:05:02,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:05:02,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:05:02,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:05:02,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:05:02,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:05:02,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:05:02,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:05:02,088 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:05:02,088 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:05:02,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:05:02,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:05:02,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:05:02,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:05:02,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:05:02,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:05:02,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:05:02,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:05:02,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:05:02,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:05:02,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:05:02,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:05:02,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:05:02,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:05:02,092 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:05:02,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:05:02,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:05:02,092 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:05:02,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:05:02,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:05:02,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:05:02,345 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:05:02,346 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:05:02,347 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/safe036.yml/witness.yml [2024-02-07 19:05:02,445 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:05:02,446 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:05:02,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe036.i [2024-02-07 19:05:03,535 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:05:03,802 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:05:03,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe036.i [2024-02-07 19:05:03,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c3ff577a/59b7b5bdf8734717991741c17a57256b/FLAGd0f64483a [2024-02-07 19:05:03,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c3ff577a/59b7b5bdf8734717991741c17a57256b [2024-02-07 19:05:03,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:05:03,842 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:05:03,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:05:03,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:05:03,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:05:03,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:05:02" (1/2) ... [2024-02-07 19:05:03,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5176292f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:03, skipping insertion in model container [2024-02-07 19:05:03,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:05:02" (1/2) ... [2024-02-07 19:05:03,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@14a20b79 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:03, skipping insertion in model container [2024-02-07 19:05:03,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:05:03" (2/2) ... [2024-02-07 19:05:03,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5176292f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:03, skipping insertion in model container [2024-02-07 19:05:03,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:05:03" (2/2) ... [2024-02-07 19:05:03,853 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:05:03,900 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:05:03,901 INFO L76 edCorrectnessWitness]: Location invariant before [L732-L732] 0 <= __unbuffered_cnt [2024-02-07 19:05:03,901 INFO L76 edCorrectnessWitness]: Location invariant before [L769-L769] 0 <= __unbuffered_cnt [2024-02-07 19:05:03,901 INFO L76 edCorrectnessWitness]: Location invariant before [L728-L728] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 19:05:03,901 INFO L76 edCorrectnessWitness]: Location invariant before [L775-L775] (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (__unbuffered_p0_EAX == 0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 19:05:03,901 INFO L76 edCorrectnessWitness]: Location invariant before [L727-L727] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 19:05:03,901 INFO L76 edCorrectnessWitness]: Location invariant before [L750-L750] 1 <= __unbuffered_cnt [2024-02-07 19:05:03,902 INFO L76 edCorrectnessWitness]: Location invariant before [L777-L777] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:05:03,902 INFO L76 edCorrectnessWitness]: Location invariant before [L776-L776] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:05:03,902 INFO L76 edCorrectnessWitness]: Location invariant before [L733-L733] 1 <= __unbuffered_cnt [2024-02-07 19:05:03,902 INFO L76 edCorrectnessWitness]: Location invariant before [L740-L740] x == 1 [2024-02-07 19:05:03,902 INFO L76 edCorrectnessWitness]: Location invariant before [L744-L744] ((0 <= y) && (y <= 1)) && (y == 0 || y == 1) [2024-02-07 19:05:03,902 INFO L76 edCorrectnessWitness]: Location invariant before [L770-L770] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:05:03,902 INFO L76 edCorrectnessWitness]: Location invariant before [L745-L745] ((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 19:05:03,903 INFO L76 edCorrectnessWitness]: Location invariant before [L771-L771] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:05:03,903 INFO L76 edCorrectnessWitness]: Location invariant before [L723-L723] y == 1 [2024-02-07 19:05:03,903 INFO L76 edCorrectnessWitness]: Location invariant before [L749-L749] 0 <= __unbuffered_cnt [2024-02-07 19:05:03,903 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:05:03,937 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:05:04,097 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/safe036.i[941,954] [2024-02-07 19:05:04,236 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:05:04,243 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:05:04,306 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/safe036.i[941,954] 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:05:04,337 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:05:04,375 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:05:04,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04 WrapperNode [2024-02-07 19:05:04,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:05:04,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:05:04,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:05:04,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:05:04,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,433 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2024-02-07 19:05:04,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:05:04,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:05:04,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:05:04,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:05:04,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,468 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:05:04,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:05:04,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:05:04,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:05:04,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:05:04,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:05:04,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:05:04,541 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:05:04,547 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:05:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:05:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:05:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:05:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:05:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:05:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:05:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:05:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:05:04,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:05:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:05:04,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:05:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:05:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:05:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:05:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:05:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:05:04,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:05:04,578 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:05:04,694 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:05:04,696 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:05:04,887 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:05:04,887 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:05:04,971 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:05:04,971 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:05:04,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:05:04 BoogieIcfgContainer [2024-02-07 19:05:04,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:05:04,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:05:04,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:05:04,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:05:04,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:05:02" (1/4) ... [2024-02-07 19:05:04,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2306799 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:05:04, skipping insertion in model container [2024-02-07 19:05:04,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:05:03" (2/4) ... [2024-02-07 19:05:04,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2306799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:05:04, skipping insertion in model container [2024-02-07 19:05:04,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (3/4) ... [2024-02-07 19:05:04,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2306799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:05:04, skipping insertion in model container [2024-02-07 19:05:04,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:05:04" (4/4) ... [2024-02-07 19:05:04,978 INFO L112 eAbstractionObserver]: Analyzing ICFG safe036.i [2024-02-07 19:05:04,991 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:05:04,991 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-02-07 19:05:04,992 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:05:05,037 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:05:05,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 106 flow [2024-02-07 19:05:05,079 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2024-02-07 19:05:05,079 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:05:05,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 47 events. 1/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-02-07 19:05:05,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 49 transitions, 106 flow [2024-02-07 19:05:05,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 47 transitions, 100 flow [2024-02-07 19:05:05,090 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:05:05,094 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;@64c7b0e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:05:05,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-02-07 19:05:05,097 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:05:05,097 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:05:05,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:05:05,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:05,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:05:05,098 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:05:05,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash 8174771, now seen corresponding path program 1 times [2024-02-07 19:05:05,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:05,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365083627] [2024-02-07 19:05:05,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:05,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:05,216 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:05:05,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:05,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365083627] [2024-02-07 19:05:05,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365083627] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:05,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:05,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390109667] [2024-02-07 19:05:05,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:05,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 19:05:05,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:05,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 19:05:05,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 19:05:05,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 19:05:05,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 100 flow. Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:05,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:05,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 19:05:05,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:05,572 INFO L124 PetriNetUnfolderBase]: 720/1515 cut-off events. [2024-02-07 19:05:05,572 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-07 19:05:05,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2711 conditions, 1515 events. 720/1515 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10924 event pairs, 720 based on Foata normal form. 42/1091 useless extension candidates. Maximal degree in co-relation 2701. Up to 1177 conditions per place. [2024-02-07 19:05:05,586 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 24 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-02-07 19:05:05,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 130 flow [2024-02-07 19:05:05,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 19:05:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 19:05:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2024-02-07 19:05:05,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6632653061224489 [2024-02-07 19:05:05,597 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 100 flow. Second operand 2 states and 65 transitions. [2024-02-07 19:05:05,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 130 flow [2024-02-07 19:05:05,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:05,601 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 80 flow [2024-02-07 19:05:05,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-02-07 19:05:05,605 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2024-02-07 19:05:05,605 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 80 flow [2024-02-07 19:05:05,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:05,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:05,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 19:05:05,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:05:05,606 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:05,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash -734068165, now seen corresponding path program 1 times [2024-02-07 19:05:05,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:05,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551527928] [2024-02-07 19:05:05,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:05,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:05,717 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:05:05,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:05,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551527928] [2024-02-07 19:05:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551527928] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:05,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:05,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703206706] [2024-02-07 19:05:05,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:05,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:05,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:05,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:05,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:05,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 19:05:05,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:05:05,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:05,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 19:05:05,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:05,848 INFO L124 PetriNetUnfolderBase]: 533/1033 cut-off events. [2024-02-07 19:05:05,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:05:05,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 1033 events. 533/1033 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6319 event pairs, 235 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 1937. Up to 571 conditions per place. [2024-02-07 19:05:05,856 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 38 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2024-02-07 19:05:05,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 198 flow [2024-02-07 19:05:05,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-02-07 19:05:05,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6258503401360545 [2024-02-07 19:05:05,863 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 80 flow. Second operand 3 states and 92 transitions. [2024-02-07 19:05:05,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 198 flow [2024-02-07 19:05:05,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:05:05,866 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 103 flow [2024-02-07 19:05:05,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-02-07 19:05:05,867 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2024-02-07 19:05:05,867 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 103 flow [2024-02-07 19:05:05,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:05:05,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:05,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 19:05:05,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:05:05,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:05,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:05,870 INFO L85 PathProgramCache]: Analyzing trace with hash -733970411, now seen corresponding path program 1 times [2024-02-07 19:05:05,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:05,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241067614] [2024-02-07 19:05:05,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:05,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:05,947 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:05:05,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:05,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241067614] [2024-02-07 19:05:05,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241067614] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:05,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:05,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:05,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889663758] [2024-02-07 19:05:05,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:05,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:05,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:05,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:05,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:05,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 19:05:05,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:05:05,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:05,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 19:05:05,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:06,194 INFO L124 PetriNetUnfolderBase]: 516/991 cut-off events. [2024-02-07 19:05:06,194 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-02-07 19:05:06,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 991 events. 516/991 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5892 event pairs, 86 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 2095. Up to 774 conditions per place. [2024-02-07 19:05:06,201 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 36 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-02-07 19:05:06,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 208 flow [2024-02-07 19:05:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-02-07 19:05:06,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5782312925170068 [2024-02-07 19:05:06,205 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 103 flow. Second operand 3 states and 85 transitions. [2024-02-07 19:05:06,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 208 flow [2024-02-07 19:05:06,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:06,207 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 108 flow [2024-02-07 19:05:06,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-02-07 19:05:06,208 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2024-02-07 19:05:06,208 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 108 flow [2024-02-07 19:05:06,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:05:06,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:06,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:06,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:05:06,209 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:06,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1281276323, now seen corresponding path program 1 times [2024-02-07 19:05:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:06,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812483525] [2024-02-07 19:05:06,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:06,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:06,290 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:05:06,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:06,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812483525] [2024-02-07 19:05:06,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812483525] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:06,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:06,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:06,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277257428] [2024-02-07 19:05:06,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:06,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:06,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:06,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:06,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:06,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-02-07 19:05:06,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:05:06,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:06,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-02-07 19:05:06,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:06,406 INFO L124 PetriNetUnfolderBase]: 516/1075 cut-off events. [2024-02-07 19:05:06,407 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-02-07 19:05:06,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2246 conditions, 1075 events. 516/1075 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7103 event pairs, 498 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 2240. Up to 863 conditions per place. [2024-02-07 19:05:06,415 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 25 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2024-02-07 19:05:06,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 158 flow [2024-02-07 19:05:06,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-02-07 19:05:06,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-02-07 19:05:06,419 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 108 flow. Second operand 3 states and 70 transitions. [2024-02-07 19:05:06,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 158 flow [2024-02-07 19:05:06,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:06,422 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 104 flow [2024-02-07 19:05:06,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-02-07 19:05:06,423 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-02-07 19:05:06,423 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 104 flow [2024-02-07 19:05:06,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:05:06,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:06,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:06,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:05:06,424 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:06,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:06,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1063917646, now seen corresponding path program 1 times [2024-02-07 19:05:06,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:06,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030108381] [2024-02-07 19:05:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:06,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:06,487 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:05:06,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:06,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030108381] [2024-02-07 19:05:06,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030108381] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:06,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:06,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:06,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748261297] [2024-02-07 19:05:06,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:06,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:06,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:06,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:06,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:06,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 19:05:06,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:05:06,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:06,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 19:05:06,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:06,578 INFO L124 PetriNetUnfolderBase]: 501/956 cut-off events. [2024-02-07 19:05:06,579 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2024-02-07 19:05:06,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 956 events. 501/956 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5561 event pairs, 106 based on Foata normal form. 0/827 useless extension candidates. Maximal degree in co-relation 2056. Up to 767 conditions per place. [2024-02-07 19:05:06,584 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 38 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-02-07 19:05:06,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 219 flow [2024-02-07 19:05:06,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-02-07 19:05:06,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2024-02-07 19:05:06,586 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 104 flow. Second operand 3 states and 87 transitions. [2024-02-07 19:05:06,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 219 flow [2024-02-07 19:05:06,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:06,588 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 111 flow [2024-02-07 19:05:06,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2024-02-07 19:05:06,590 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-02-07 19:05:06,590 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 111 flow [2024-02-07 19:05:06,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:05:06,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:06,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:06,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:05:06,591 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:06,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:06,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1349075264, now seen corresponding path program 1 times [2024-02-07 19:05:06,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:06,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52323324] [2024-02-07 19:05:06,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:06,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:06,676 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:05:06,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:06,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52323324] [2024-02-07 19:05:06,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52323324] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:06,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:06,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:06,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918946210] [2024-02-07 19:05:06,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:06,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:06,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:06,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:06,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 19:05:06,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:06,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:06,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 19:05:06,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:06,767 INFO L124 PetriNetUnfolderBase]: 487/935 cut-off events. [2024-02-07 19:05:06,767 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-02-07 19:05:06,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 935 events. 487/935 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5394 event pairs, 147 based on Foata normal form. 0/846 useless extension candidates. Maximal degree in co-relation 2135. Up to 714 conditions per place. [2024-02-07 19:05:06,772 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 37 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2024-02-07 19:05:06,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 229 flow [2024-02-07 19:05:06,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-02-07 19:05:06,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2024-02-07 19:05:06,773 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 111 flow. Second operand 3 states and 87 transitions. [2024-02-07 19:05:06,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 229 flow [2024-02-07 19:05:06,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:06,774 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 126 flow [2024-02-07 19:05:06,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2024-02-07 19:05:06,777 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2024-02-07 19:05:06,777 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 126 flow [2024-02-07 19:05:06,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:06,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:06,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:06,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:05:06,777 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:06,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1053065834, now seen corresponding path program 1 times [2024-02-07 19:05:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009561189] [2024-02-07 19:05:06,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:06,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:06,821 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:05:06,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:06,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009561189] [2024-02-07 19:05:06,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009561189] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:06,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:06,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062239234] [2024-02-07 19:05:06,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:06,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:06,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:06,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:06,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:06,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 19:05:06,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:05:06,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:06,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 19:05:06,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:06,923 INFO L124 PetriNetUnfolderBase]: 421/827 cut-off events. [2024-02-07 19:05:06,924 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2024-02-07 19:05:06,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 827 events. 421/827 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4608 event pairs, 69 based on Foata normal form. 40/814 useless extension candidates. Maximal degree in co-relation 1976. Up to 627 conditions per place. [2024-02-07 19:05:06,929 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 38 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2024-02-07 19:05:06,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 234 flow [2024-02-07 19:05:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-02-07 19:05:06,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-07 19:05:06,931 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 126 flow. Second operand 3 states and 84 transitions. [2024-02-07 19:05:06,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 234 flow [2024-02-07 19:05:06,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:06,933 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 119 flow [2024-02-07 19:05:06,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-02-07 19:05:06,934 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-02-07 19:05:06,934 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 119 flow [2024-02-07 19:05:06,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:05:06,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:06,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:06,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:05:06,935 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:06,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1227073100, now seen corresponding path program 1 times [2024-02-07 19:05:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:06,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147729786] [2024-02-07 19:05:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:06,988 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:05:06,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:06,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147729786] [2024-02-07 19:05:06,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147729786] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:06,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:06,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:06,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535154796] [2024-02-07 19:05:06,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:06,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:06,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:06,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:06,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 19:05:06,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:05:06,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:06,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 19:05:06,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:07,094 INFO L124 PetriNetUnfolderBase]: 368/723 cut-off events. [2024-02-07 19:05:07,094 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2024-02-07 19:05:07,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1703 conditions, 723 events. 368/723 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3807 event pairs, 129 based on Foata normal form. 33/707 useless extension candidates. Maximal degree in co-relation 1696. Up to 557 conditions per place. [2024-02-07 19:05:07,099 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 39 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2024-02-07 19:05:07,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 235 flow [2024-02-07 19:05:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-02-07 19:05:07,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5782312925170068 [2024-02-07 19:05:07,100 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 119 flow. Second operand 3 states and 85 transitions. [2024-02-07 19:05:07,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 235 flow [2024-02-07 19:05:07,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:07,103 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 114 flow [2024-02-07 19:05:07,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-02-07 19:05:07,105 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2024-02-07 19:05:07,105 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 114 flow [2024-02-07 19:05:07,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:05:07,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:07,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:07,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:05:07,106 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:07,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1128339503, now seen corresponding path program 1 times [2024-02-07 19:05:07,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:07,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989048023] [2024-02-07 19:05:07,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:07,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:07,171 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:05:07,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:07,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989048023] [2024-02-07 19:05:07,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989048023] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:07,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:07,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:07,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669670245] [2024-02-07 19:05:07,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:07,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:07,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:07,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:07,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:07,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-02-07 19:05:07,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:05:07,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:07,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-02-07 19:05:07,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:07,277 INFO L124 PetriNetUnfolderBase]: 368/769 cut-off events. [2024-02-07 19:05:07,277 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2024-02-07 19:05:07,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 769 events. 368/769 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4615 event pairs, 324 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 1742. Up to 627 conditions per place. [2024-02-07 19:05:07,282 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 25 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2024-02-07 19:05:07,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 164 flow [2024-02-07 19:05:07,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-02-07 19:05:07,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-02-07 19:05:07,283 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 114 flow. Second operand 3 states and 68 transitions. [2024-02-07 19:05:07,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 164 flow [2024-02-07 19:05:07,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 163 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:07,284 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 113 flow [2024-02-07 19:05:07,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-02-07 19:05:07,285 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2024-02-07 19:05:07,285 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 113 flow [2024-02-07 19:05:07,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:05:07,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:07,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:07,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:05:07,286 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:07,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash -618785941, now seen corresponding path program 1 times [2024-02-07 19:05:07,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:07,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927913735] [2024-02-07 19:05:07,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:07,368 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:05:07,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:07,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927913735] [2024-02-07 19:05:07,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927913735] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:07,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:07,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:05:07,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313994704] [2024-02-07 19:05:07,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:07,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:05:07,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:07,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:05:07,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:05:07,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-02-07 19:05:07,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:05:07,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:07,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-02-07 19:05:07,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:07,473 INFO L124 PetriNetUnfolderBase]: 294/664 cut-off events. [2024-02-07 19:05:07,473 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2024-02-07 19:05:07,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 664 events. 294/664 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3811 event pairs, 59 based on Foata normal form. 29/601 useless extension candidates. Maximal degree in co-relation 1472. Up to 289 conditions per place. [2024-02-07 19:05:07,477 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 40 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2024-02-07 19:05:07,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 259 flow [2024-02-07 19:05:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:05:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:05:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-02-07 19:05:07,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-02-07 19:05:07,478 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 113 flow. Second operand 4 states and 104 transitions. [2024-02-07 19:05:07,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 259 flow [2024-02-07 19:05:07,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:07,480 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 134 flow [2024-02-07 19:05:07,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2024-02-07 19:05:07,480 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-02-07 19:05:07,480 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 134 flow [2024-02-07 19:05:07,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:05:07,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:07,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:07,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:05:07,481 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:07,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:07,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1081936029, now seen corresponding path program 1 times [2024-02-07 19:05:07,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:07,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734735780] [2024-02-07 19:05:07,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:07,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:07,502 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:05:07,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:07,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734735780] [2024-02-07 19:05:07,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734735780] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:07,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:07,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099963002] [2024-02-07 19:05:07,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:07,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:07,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:07,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:07,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:07,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 19:05:07,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:05:07,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:07,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 19:05:07,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:07,573 INFO L124 PetriNetUnfolderBase]: 220/506 cut-off events. [2024-02-07 19:05:07,573 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2024-02-07 19:05:07,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 506 events. 220/506 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2668 event pairs, 107 based on Foata normal form. 16/478 useless extension candidates. Maximal degree in co-relation 1222. Up to 336 conditions per place. [2024-02-07 19:05:07,576 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 27 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-02-07 19:05:07,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 206 flow [2024-02-07 19:05:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-02-07 19:05:07,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54421768707483 [2024-02-07 19:05:07,578 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 134 flow. Second operand 3 states and 80 transitions. [2024-02-07 19:05:07,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 206 flow [2024-02-07 19:05:07,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:07,581 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 115 flow [2024-02-07 19:05:07,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=115, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2024-02-07 19:05:07,582 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-02-07 19:05:07,582 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 115 flow [2024-02-07 19:05:07,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:05:07,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:07,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:07,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 19:05:07,582 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:07,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:07,583 INFO L85 PathProgramCache]: Analyzing trace with hash -389839926, now seen corresponding path program 1 times [2024-02-07 19:05:07,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:07,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042446955] [2024-02-07 19:05:07,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:07,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:07,669 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:05:07,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:07,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042446955] [2024-02-07 19:05:07,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042446955] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:07,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:07,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:07,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799489885] [2024-02-07 19:05:07,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:07,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:05:07,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:07,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:05:07,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:05:07,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 19:05:07,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:05:07,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:07,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 19:05:07,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:07,751 INFO L124 PetriNetUnfolderBase]: 190/448 cut-off events. [2024-02-07 19:05:07,752 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2024-02-07 19:05:07,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 448 events. 190/448 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2323 event pairs, 40 based on Foata normal form. 4/425 useless extension candidates. Maximal degree in co-relation 1063. Up to 258 conditions per place. [2024-02-07 19:05:07,754 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 35 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2024-02-07 19:05:07,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 263 flow [2024-02-07 19:05:07,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:05:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:05:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-02-07 19:05:07,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2024-02-07 19:05:07,756 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 115 flow. Second operand 4 states and 103 transitions. [2024-02-07 19:05:07,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 263 flow [2024-02-07 19:05:07,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 235 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-02-07 19:05:07,759 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 135 flow [2024-02-07 19:05:07,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2024-02-07 19:05:07,759 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2024-02-07 19:05:07,759 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 135 flow [2024-02-07 19:05:07,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:05:07,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:07,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:07,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 19:05:07,760 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:07,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash -205952504, now seen corresponding path program 1 times [2024-02-07 19:05:07,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:07,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840126973] [2024-02-07 19:05:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:07,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:07,832 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:05:07,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:07,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840126973] [2024-02-07 19:05:07,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840126973] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:07,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:07,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:07,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510302029] [2024-02-07 19:05:07,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:07,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:05:07,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:07,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:05:07,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:05:07,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 19:05:07,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:05:07,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:07,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 19:05:07,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:07,953 INFO L124 PetriNetUnfolderBase]: 206/516 cut-off events. [2024-02-07 19:05:07,954 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2024-02-07 19:05:07,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 516 events. 206/516 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2723 event pairs, 77 based on Foata normal form. 4/478 useless extension candidates. Maximal degree in co-relation 1226. Up to 298 conditions per place. [2024-02-07 19:05:07,957 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 40 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2024-02-07 19:05:07,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 302 flow [2024-02-07 19:05:07,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:05:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:05:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-02-07 19:05:07,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459183673469388 [2024-02-07 19:05:07,959 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 135 flow. Second operand 4 states and 107 transitions. [2024-02-07 19:05:07,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 302 flow [2024-02-07 19:05:07,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:07,961 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 166 flow [2024-02-07 19:05:07,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2024-02-07 19:05:07,962 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2024-02-07 19:05:07,962 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 166 flow [2024-02-07 19:05:07,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:05:07,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:07,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:07,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 19:05:07,963 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:07,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:07,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2007339448, now seen corresponding path program 1 times [2024-02-07 19:05:07,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:07,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111007722] [2024-02-07 19:05:07,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:08,084 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:05:08,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:08,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111007722] [2024-02-07 19:05:08,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111007722] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:08,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:08,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:05:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943125738] [2024-02-07 19:05:08,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:08,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:05:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:08,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:05:08,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:05:08,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-02-07 19:05:08,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:05:08,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:08,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-02-07 19:05:08,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:08,176 INFO L124 PetriNetUnfolderBase]: 122/274 cut-off events. [2024-02-07 19:05:08,176 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2024-02-07 19:05:08,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 274 events. 122/274 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1039 event pairs, 24 based on Foata normal form. 20/273 useless extension candidates. Maximal degree in co-relation 800. Up to 116 conditions per place. [2024-02-07 19:05:08,178 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 34 selfloop transitions, 6 changer transitions 1/53 dead transitions. [2024-02-07 19:05:08,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 307 flow [2024-02-07 19:05:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:05:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:05:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2024-02-07 19:05:08,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-02-07 19:05:08,180 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 166 flow. Second operand 5 states and 110 transitions. [2024-02-07 19:05:08,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 307 flow [2024-02-07 19:05:08,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 282 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-02-07 19:05:08,183 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 168 flow [2024-02-07 19:05:08,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2024-02-07 19:05:08,183 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-02-07 19:05:08,184 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 168 flow [2024-02-07 19:05:08,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:05:08,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:08,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:08,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 19:05:08,184 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:08,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:08,185 INFO L85 PathProgramCache]: Analyzing trace with hash 110935548, now seen corresponding path program 1 times [2024-02-07 19:05:08,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:08,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406589058] [2024-02-07 19:05:08,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:08,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:08,282 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:05:08,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:08,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406589058] [2024-02-07 19:05:08,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406589058] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:08,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:08,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:05:08,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220811517] [2024-02-07 19:05:08,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:08,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:05:08,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:08,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:05:08,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:05:08,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-07 19:05:08,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:05:08,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:08,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-07 19:05:08,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:08,372 INFO L124 PetriNetUnfolderBase]: 125/309 cut-off events. [2024-02-07 19:05:08,372 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2024-02-07 19:05:08,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 309 events. 125/309 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1279 event pairs, 44 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 860. Up to 127 conditions per place. [2024-02-07 19:05:08,374 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 34 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2024-02-07 19:05:08,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 52 transitions, 320 flow [2024-02-07 19:05:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:05:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:05:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-02-07 19:05:08,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49489795918367346 [2024-02-07 19:05:08,376 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 168 flow. Second operand 4 states and 97 transitions. [2024-02-07 19:05:08,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 52 transitions, 320 flow [2024-02-07 19:05:08,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 267 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-02-07 19:05:08,378 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 170 flow [2024-02-07 19:05:08,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2024-02-07 19:05:08,379 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2024-02-07 19:05:08,379 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 170 flow [2024-02-07 19:05:08,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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:05:08,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:08,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:08,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-07 19:05:08,380 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 27 more)] === [2024-02-07 19:05:08,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash -40217984, now seen corresponding path program 2 times [2024-02-07 19:05:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207097140] [2024-02-07 19:05:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:05:08,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:05:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:05:08,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:05:08,443 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:05:08,445 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 30 remaining) [2024-02-07 19:05:08,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 30 remaining) [2024-02-07 19:05:08,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 30 remaining) [2024-02-07 19:05:08,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 30 remaining) [2024-02-07 19:05:08,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 30 remaining) [2024-02-07 19:05:08,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 30 remaining) [2024-02-07 19:05:08,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 30 remaining) [2024-02-07 19:05:08,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 30 remaining) [2024-02-07 19:05:08,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 30 remaining) [2024-02-07 19:05:08,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 30 remaining) [2024-02-07 19:05:08,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 30 remaining) [2024-02-07 19:05:08,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 30 remaining) [2024-02-07 19:05:08,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 30 remaining) [2024-02-07 19:05:08,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 30 remaining) [2024-02-07 19:05:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 30 remaining) [2024-02-07 19:05:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 30 remaining) [2024-02-07 19:05:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 30 remaining) [2024-02-07 19:05:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (12 of 30 remaining) [2024-02-07 19:05:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 30 remaining) [2024-02-07 19:05:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 30 remaining) [2024-02-07 19:05:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 30 remaining) [2024-02-07 19:05:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 30 remaining) [2024-02-07 19:05:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 30 remaining) [2024-02-07 19:05:08,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 30 remaining) [2024-02-07 19:05:08,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 30 remaining) [2024-02-07 19:05:08,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 30 remaining) [2024-02-07 19:05:08,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 30 remaining) [2024-02-07 19:05:08,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 30 remaining) [2024-02-07 19:05:08,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 30 remaining) [2024-02-07 19:05:08,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 30 remaining) [2024-02-07 19:05:08,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-07 19:05:08,452 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:08,460 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:05:08,460 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:05:08,515 INFO L503 ceAbstractionStarter]: Automizer considered 17 witness invariants [2024-02-07 19:05:08,515 INFO L504 ceAbstractionStarter]: WitnessConsidered=17 [2024-02-07 19:05:08,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:05:08 BasicIcfg [2024-02-07 19:05:08,516 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:05:08,516 INFO L158 Benchmark]: Toolchain (without parser) took 4674.48ms. Allocated memory was 178.3MB in the beginning and 333.4MB in the end (delta: 155.2MB). Free memory was 109.9MB in the beginning and 186.3MB in the end (delta: -76.3MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. [2024-02-07 19:05:08,516 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 94.4MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:05:08,516 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:05:08,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.55ms. Allocated memory is still 178.3MB. Free memory was 109.4MB in the beginning and 127.0MB in the end (delta: -17.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-02-07 19:05:08,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.61ms. Allocated memory is still 178.3MB. Free memory was 127.0MB in the beginning and 124.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:05:08,517 INFO L158 Benchmark]: Boogie Preprocessor took 57.77ms. Allocated memory is still 178.3MB. Free memory was 124.8MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:05:08,517 INFO L158 Benchmark]: RCFGBuilder took 479.29ms. Allocated memory is still 178.3MB. Free memory was 122.7MB in the beginning and 94.3MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-02-07 19:05:08,517 INFO L158 Benchmark]: TraceAbstraction took 3542.09ms. Allocated memory was 178.3MB in the beginning and 333.4MB in the end (delta: 155.2MB). Free memory was 93.4MB in the beginning and 186.3MB in the end (delta: -92.9MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-02-07 19:05:08,519 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.18ms. Allocated memory is still 94.4MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.55ms. Allocated memory is still 178.3MB. Free memory was 109.4MB in the beginning and 127.0MB in the end (delta: -17.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.61ms. Allocated memory is still 178.3MB. Free memory was 127.0MB in the beginning and 124.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.77ms. Allocated memory is still 178.3MB. Free memory was 124.8MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 479.29ms. Allocated memory is still 178.3MB. Free memory was 122.7MB in the beginning and 94.3MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3542.09ms. Allocated memory was 178.3MB in the beginning and 333.4MB in the end (delta: 155.2MB). Free memory was 93.4MB in the beginning and 186.3MB in the end (delta: -92.9MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 775]: 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_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L764] 0 pthread_t t2625; [L765] FCALL, FORK 0 pthread_create(&t2625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2625={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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=1] [L766] 0 pthread_t t2626; [L767] FCALL, FORK 0 pthread_create(&t2626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2625={5:0}, t2626={3:0}, x=0, y=1] [L739] 2 x = 1 [L740] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L727] 1 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]]]]]] [L727] 1 __unbuffered_p0_EAX = x [L728] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=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] [L732] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L732] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L733] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=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] [L744] 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]]]]]] [L744] 2 __unbuffered_p1_EAX = y [L745] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=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] [L749] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L749] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L750] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=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] [L769] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L769] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L770] 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_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2625={5:0}, t2626={3:0}, x=1, y=1] [L771] 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]]]]]] [L771] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(main$tmp_guard0) [L775] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2625={5:0}, t2626={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: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 728]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: 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: 744]: 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: 749]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 777]: 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: 767]: 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: 765]: 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, 77 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.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 662 IncrementalHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 3 mSDtfsCounter, 662 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=15, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:05:08,548 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