./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/stateful01-1.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/stateful01-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 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/stateful01-1.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/stateful01-1.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-dev-958ec4d-m [2024-02-07 14:44:03,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:44:03,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:44:03,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:44:03,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:44:03,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:44:03,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:44:03,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:44:03,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:44:03,603 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:44:03,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:44:03,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:44:03,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:44:03,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:44:03,606 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:44:03,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:44:03,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:44:03,607 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:44:03,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:44:03,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:44:03,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:44:03,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:44:03,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:44:03,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:44:03,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:44:03,609 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:44:03,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:44:03,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:44:03,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:44:03,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:44:03,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:44:03,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:44:03,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:44:03,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:44:03,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:44:03,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:44:03,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:44:03,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:44:03,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:44:03,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:44:03,612 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:44:03,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:44:03,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:44:03,613 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 14:44:03,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:44:03,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:44:03,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:44:03,876 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:44:03,881 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:44:03,883 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/stateful01-1.yml/witness.yml [2024-02-07 14:44:04,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:44:04,009 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:44:04,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stateful01-1.i [2024-02-07 14:44:05,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:44:05,498 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:44:05,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i [2024-02-07 14:44:05,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8264d83ed/adb065b69edc49d9aff533cc8e8c49f2/FLAG6fd68bb64 [2024-02-07 14:44:05,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8264d83ed/adb065b69edc49d9aff533cc8e8c49f2 [2024-02-07 14:44:05,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:44:05,806 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:44:05,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:44:05,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:44:05,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:44:05,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:44:04" (1/2) ... [2024-02-07 14:44:05,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6776dddd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:44:05, skipping insertion in model container [2024-02-07 14:44:05,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:44:04" (1/2) ... [2024-02-07 14:44:05,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7071c7ad and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:44:05, skipping insertion in model container [2024-02-07 14:44:05,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:44:05" (2/2) ... [2024-02-07 14:44:05,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6776dddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:05, skipping insertion in model container [2024-02-07 14:44:05,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:44:05" (2/2) ... [2024-02-07 14:44:05,817 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:44:05,849 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:44:05,850 INFO L76 edCorrectnessWitness]: Location invariant before [L697-L697] 10 <= data1 [2024-02-07 14:44:05,850 INFO L76 edCorrectnessWitness]: Location invariant before [L711-L711] data2 <= 2147483641 [2024-02-07 14:44:05,850 INFO L76 edCorrectnessWitness]: Location invariant before [L720-L720] data1 == 10 [2024-02-07 14:44:05,850 INFO L76 edCorrectnessWitness]: Location invariant before [L721-L721] data2 == 10 [2024-02-07 14:44:05,851 INFO L76 edCorrectnessWitness]: Location invariant before [L708-L708] 15 <= data1 [2024-02-07 14:44:05,851 INFO L76 edCorrectnessWitness]: Location invariant before [L725-L725] 10 <= data1 [2024-02-07 14:44:05,851 INFO L76 edCorrectnessWitness]: Location invariant before [L701-L701] -2147483647 <= data2 [2024-02-07 14:44:05,851 INFO L76 edCorrectnessWitness]: Location invariant before [L707-L707] 10 <= data1 [2024-02-07 14:44:05,851 INFO L76 edCorrectnessWitness]: Location invariant before [L698-L698] 11 <= data1 [2024-02-07 14:44:05,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:44:06,227 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/stateful01-1.i[30826,30839] [2024-02-07 14:44:06,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:44:06,249 INFO L203 MainTranslator]: Completed pre-run 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 14:44:06,363 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/stateful01-1.i[30826,30839] [2024-02-07 14:44:06,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:44:06,421 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:44:06,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06 WrapperNode [2024-02-07 14:44:06,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:44:06,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:44:06,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:44:06,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:44:06,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (1/1) ... [2024-02-07 14:44:06,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (1/1) ... [2024-02-07 14:44:06,532 INFO L138 Inliner]: procedures = 169, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-02-07 14:44:06,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:44:06,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:44:06,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:44:06,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:44:06,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (1/1) ... [2024-02-07 14:44:06,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (1/1) ... [2024-02-07 14:44:06,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (1/1) ... [2024-02-07 14:44:06,594 INFO L175 MemorySlicer]: Split 16 memory accesses to 5 slices as follows [2, 5, 2, 5, 2]. 31 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 0, 5, 0]. The 2 writes are split as follows [0, 0, 1, 0, 1]. [2024-02-07 14:44:06,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (1/1) ... [2024-02-07 14:44:06,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (1/1) ... [2024-02-07 14:44:06,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (1/1) ... [2024-02-07 14:44:06,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (1/1) ... [2024-02-07 14:44:06,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (1/1) ... [2024-02-07 14:44:06,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (1/1) ... [2024-02-07 14:44:06,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:44:06,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:44:06,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:44:06,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:44:06,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (1/1) ... [2024-02-07 14:44:06,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:44:06,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:44:06,652 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 14:44:06,656 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 14:44:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 14:44:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 14:44:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 14:44:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 14:44:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 14:44:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 14:44:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 14:44:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 14:44:06,692 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 14:44:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:44:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:44:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:44:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:44:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 14:44:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-07 14:44:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:44:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:44:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:44:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:44:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:44:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:44:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:44:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 14:44:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-07 14:44:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:44:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:44:06,696 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 14:44:06,807 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:44:06,809 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:44:07,055 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:44:07,055 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:44:07,169 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:44:07,169 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 14:44:07,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:44:07 BoogieIcfgContainer [2024-02-07 14:44:07,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:44:07,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:44:07,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:44:07,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:44:07,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:44:04" (1/4) ... [2024-02-07 14:44:07,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5039abf2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:44:07, skipping insertion in model container [2024-02-07 14:44:07,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:44:05" (2/4) ... [2024-02-07 14:44:07,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5039abf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:44:07, skipping insertion in model container [2024-02-07 14:44:07,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:06" (3/4) ... [2024-02-07 14:44:07,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5039abf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:44:07, skipping insertion in model container [2024-02-07 14:44:07,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:44:07" (4/4) ... [2024-02-07 14:44:07,176 INFO L112 eAbstractionObserver]: Analyzing ICFG stateful01-1.i [2024-02-07 14:44:07,191 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:44:07,191 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-02-07 14:44:07,191 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:44:07,252 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-07 14:44:07,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 118 flow [2024-02-07 14:44:07,333 INFO L124 PetriNetUnfolderBase]: 1/50 cut-off events. [2024-02-07 14:44:07,333 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-07 14:44:07,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 50 events. 1/50 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2024-02-07 14:44:07,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 118 flow [2024-02-07 14:44:07,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 47 transitions, 106 flow [2024-02-07 14:44:07,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:44:07,352 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;@2cd16d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:44:07,354 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-02-07 14:44:07,356 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:44:07,357 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 14:44:07,357 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:44:07,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:07,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 14:44:07,362 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:44:07,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:07,369 INFO L85 PathProgramCache]: Analyzing trace with hash 8450, now seen corresponding path program 1 times [2024-02-07 14:44:07,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:07,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950461634] [2024-02-07 14:44:07,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:07,626 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 14:44:07,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:07,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950461634] [2024-02-07 14:44:07,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950461634] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:07,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:07,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:44:07,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842302519] [2024-02-07 14:44:07,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:07,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:44:07,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:07,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:44:07,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:44:07,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2024-02-07 14:44:07,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 14:44:07,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:07,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2024-02-07 14:44:07,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:07,807 INFO L124 PetriNetUnfolderBase]: 280/628 cut-off events. [2024-02-07 14:44:07,807 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-02-07 14:44:07,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 628 events. 280/628 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3147 event pairs, 131 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 1066. Up to 493 conditions per place. [2024-02-07 14:44:07,817 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 34 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2024-02-07 14:44:07,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 195 flow [2024-02-07 14:44:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:44:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:44:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-02-07 14:44:07,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718 [2024-02-07 14:44:07,829 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 106 flow. Second operand 3 states and 97 transitions. [2024-02-07 14:44:07,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 195 flow [2024-02-07 14:44:07,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 185 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-07 14:44:07,838 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 117 flow [2024-02-07 14:44:07,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-02-07 14:44:07,843 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2024-02-07 14:44:07,843 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 117 flow [2024-02-07 14:44:07,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 14:44:07,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:07,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-07 14:44:07,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:44:07,845 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:44:07,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:07,846 INFO L85 PathProgramCache]: Analyzing trace with hash 262202, now seen corresponding path program 1 times [2024-02-07 14:44:07,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:07,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357122955] [2024-02-07 14:44:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:07,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:07,910 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 14:44:07,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:07,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357122955] [2024-02-07 14:44:07,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357122955] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:07,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:07,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:44:07,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199963877] [2024-02-07 14:44:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:07,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:44:07,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:07,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:44:07,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:44:07,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2024-02-07 14:44:07,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 14:44:07,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:07,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2024-02-07 14:44:07,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:08,025 INFO L124 PetriNetUnfolderBase]: 240/513 cut-off events. [2024-02-07 14:44:08,025 INFO L125 PetriNetUnfolderBase]: For 43/63 co-relation queries the response was YES. [2024-02-07 14:44:08,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 513 events. 240/513 cut-off events. For 43/63 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2423 event pairs, 90 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 769. Up to 318 conditions per place. [2024-02-07 14:44:08,029 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 39 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-02-07 14:44:08,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 230 flow [2024-02-07 14:44:08,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:44:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:44:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-02-07 14:44:08,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6858974358974359 [2024-02-07 14:44:08,036 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 117 flow. Second operand 3 states and 107 transitions. [2024-02-07 14:44:08,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 230 flow [2024-02-07 14:44:08,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:44:08,038 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 129 flow [2024-02-07 14:44:08,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2024-02-07 14:44:08,039 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2024-02-07 14:44:08,039 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 129 flow [2024-02-07 14:44:08,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 14:44:08,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:08,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:08,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:44:08,040 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:44:08,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:08,042 INFO L85 PathProgramCache]: Analyzing trace with hash 405153790, now seen corresponding path program 1 times [2024-02-07 14:44:08,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:08,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049756566] [2024-02-07 14:44:08,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:08,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:44:08,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:08,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049756566] [2024-02-07 14:44:08,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049756566] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:08,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:08,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:44:08,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31694188] [2024-02-07 14:44:08,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:08,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:44:08,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:08,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:44:08,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:44:08,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2024-02-07 14:44:08,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 129 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 14:44:08,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:08,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2024-02-07 14:44:08,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:08,332 INFO L124 PetriNetUnfolderBase]: 240/550 cut-off events. [2024-02-07 14:44:08,332 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-02-07 14:44:08,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 550 events. 240/550 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2587 event pairs, 99 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 429. Up to 422 conditions per place. [2024-02-07 14:44:08,335 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 34 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2024-02-07 14:44:08,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 202 flow [2024-02-07 14:44:08,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:44:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:44:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-02-07 14:44:08,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144230769230769 [2024-02-07 14:44:08,337 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 129 flow. Second operand 4 states and 107 transitions. [2024-02-07 14:44:08,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 202 flow [2024-02-07 14:44:08,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:44:08,338 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 120 flow [2024-02-07 14:44:08,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-02-07 14:44:08,339 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2024-02-07 14:44:08,339 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 120 flow [2024-02-07 14:44:08,340 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 14:44:08,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:08,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:08,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:44:08,340 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:44:08,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:08,341 INFO L85 PathProgramCache]: Analyzing trace with hash -100864930, now seen corresponding path program 1 times [2024-02-07 14:44:08,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:08,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515424690] [2024-02-07 14:44:08,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:08,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:44:08,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515424690] [2024-02-07 14:44:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515424690] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:08,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:44:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103332452] [2024-02-07 14:44:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:08,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:44:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:44:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:44:08,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2024-02-07 14:44:08,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 14:44:08,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:08,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2024-02-07 14:44:08,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:08,481 INFO L124 PetriNetUnfolderBase]: 240/532 cut-off events. [2024-02-07 14:44:08,481 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-02-07 14:44:08,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 532 events. 240/532 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2439 event pairs, 51 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 821. Up to 332 conditions per place. [2024-02-07 14:44:08,484 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 39 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2024-02-07 14:44:08,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 225 flow [2024-02-07 14:44:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:44:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:44:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-02-07 14:44:08,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2024-02-07 14:44:08,486 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 120 flow. Second operand 4 states and 108 transitions. [2024-02-07 14:44:08,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 225 flow [2024-02-07 14:44:08,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 54 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:44:08,487 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 120 flow [2024-02-07 14:44:08,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-02-07 14:44:08,488 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2024-02-07 14:44:08,488 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 120 flow [2024-02-07 14:44:08,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 14:44:08,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:08,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:08,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:44:08,489 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:44:08,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:08,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1589820075, now seen corresponding path program 1 times [2024-02-07 14:44:08,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:08,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747585820] [2024-02-07 14:44:08,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:08,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:44:08,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:08,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747585820] [2024-02-07 14:44:08,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747585820] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:08,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:44:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87539954] [2024-02-07 14:44:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:08,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:44:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:08,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:44:08,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:44:08,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2024-02-07 14:44:08,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 14:44:08,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:08,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2024-02-07 14:44:08,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:08,623 INFO L124 PetriNetUnfolderBase]: 221/469 cut-off events. [2024-02-07 14:44:08,623 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2024-02-07 14:44:08,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 469 events. 221/469 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2172 event pairs, 68 based on Foata normal form. 14/465 useless extension candidates. Maximal degree in co-relation 739. Up to 144 conditions per place. [2024-02-07 14:44:08,625 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 47 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2024-02-07 14:44:08,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 278 flow [2024-02-07 14:44:08,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:44:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:44:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-02-07 14:44:08,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6682692307692307 [2024-02-07 14:44:08,627 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 120 flow. Second operand 4 states and 139 transitions. [2024-02-07 14:44:08,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 278 flow [2024-02-07 14:44:08,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:44:08,629 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 131 flow [2024-02-07 14:44:08,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2024-02-07 14:44:08,629 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2024-02-07 14:44:08,630 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 131 flow [2024-02-07 14:44:08,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 14:44:08,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:08,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:08,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:44:08,630 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:44:08,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:08,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1295130266, now seen corresponding path program 1 times [2024-02-07 14:44:08,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:08,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509753583] [2024-02-07 14:44:08,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:08,670 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 14:44:08,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:08,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509753583] [2024-02-07 14:44:08,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509753583] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:08,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:08,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:44:08,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767269109] [2024-02-07 14:44:08,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:08,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:44:08,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:08,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:44:08,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:44:08,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2024-02-07 14:44:08,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 14:44:08,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:08,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2024-02-07 14:44:08,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:08,780 INFO L124 PetriNetUnfolderBase]: 231/500 cut-off events. [2024-02-07 14:44:08,780 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2024-02-07 14:44:08,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 500 events. 231/500 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2326 event pairs, 91 based on Foata normal form. 20/502 useless extension candidates. Maximal degree in co-relation 865. Up to 178 conditions per place. [2024-02-07 14:44:08,782 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 46 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2024-02-07 14:44:08,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 295 flow [2024-02-07 14:44:08,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:44:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:44:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-02-07 14:44:08,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7019230769230769 [2024-02-07 14:44:08,784 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 131 flow. Second operand 4 states and 146 transitions. [2024-02-07 14:44:08,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 295 flow [2024-02-07 14:44:08,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 67 transitions, 286 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-07 14:44:08,786 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 166 flow [2024-02-07 14:44:08,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-02-07 14:44:08,786 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2024-02-07 14:44:08,787 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 166 flow [2024-02-07 14:44:08,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 14:44:08,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:08,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:08,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:44:08,787 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:44:08,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:08,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2049374301, now seen corresponding path program 1 times [2024-02-07 14:44:08,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:08,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865764430] [2024-02-07 14:44:08,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:08,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:08,853 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 14:44:08,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:08,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865764430] [2024-02-07 14:44:08,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865764430] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:08,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:08,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:44:08,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092833842] [2024-02-07 14:44:08,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:08,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:44:08,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:44:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:44:08,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 52 [2024-02-07 14:44:08,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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 14:44:08,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:08,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 52 [2024-02-07 14:44:08,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:08,909 INFO L124 PetriNetUnfolderBase]: 116/345 cut-off events. [2024-02-07 14:44:08,910 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-02-07 14:44:08,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 345 events. 116/345 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1386 event pairs, 45 based on Foata normal form. 32/373 useless extension candidates. Maximal degree in co-relation 535. Up to 144 conditions per place. [2024-02-07 14:44:08,911 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 27 selfloop transitions, 8 changer transitions 0/52 dead transitions. [2024-02-07 14:44:08,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 52 transitions, 244 flow [2024-02-07 14:44:08,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:44:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:44:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-02-07 14:44:08,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7243589743589743 [2024-02-07 14:44:08,913 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 166 flow. Second operand 3 states and 113 transitions. [2024-02-07 14:44:08,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 52 transitions, 244 flow [2024-02-07 14:44:08,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 232 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-07 14:44:08,915 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 162 flow [2024-02-07 14:44:08,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-02-07 14:44:08,915 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2024-02-07 14:44:08,916 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 162 flow [2024-02-07 14:44:08,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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 14:44:08,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:08,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:08,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:44:08,916 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:44:08,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1700867767, now seen corresponding path program 1 times [2024-02-07 14:44:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:08,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385950508] [2024-02-07 14:44:08,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:08,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:08,968 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 14:44:08,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:08,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385950508] [2024-02-07 14:44:08,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385950508] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:08,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:08,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:44:08,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484612903] [2024-02-07 14:44:08,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:08,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:44:08,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:08,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:44:08,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:44:08,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2024-02-07 14:44:08,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:44:08,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:08,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2024-02-07 14:44:08,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:09,046 INFO L124 PetriNetUnfolderBase]: 120/328 cut-off events. [2024-02-07 14:44:09,046 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2024-02-07 14:44:09,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 328 events. 120/328 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1282 event pairs, 49 based on Foata normal form. 6/324 useless extension candidates. Maximal degree in co-relation 564. Up to 100 conditions per place. [2024-02-07 14:44:09,048 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 44 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2024-02-07 14:44:09,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 326 flow [2024-02-07 14:44:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:44:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:44:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2024-02-07 14:44:09,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6384615384615384 [2024-02-07 14:44:09,049 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 162 flow. Second operand 5 states and 166 transitions. [2024-02-07 14:44:09,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 326 flow [2024-02-07 14:44:09,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 300 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 14:44:09,051 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 154 flow [2024-02-07 14:44:09,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-02-07 14:44:09,051 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2024-02-07 14:44:09,052 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 154 flow [2024-02-07 14:44:09,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:44:09,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:09,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:09,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:44:09,052 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:44:09,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2104000256, now seen corresponding path program 1 times [2024-02-07 14:44:09,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:09,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77869933] [2024-02-07 14:44:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:09,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:09,119 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 14:44:09,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:09,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77869933] [2024-02-07 14:44:09,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77869933] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:09,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:09,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:44:09,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785866788] [2024-02-07 14:44:09,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:09,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:44:09,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:09,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:44:09,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:44:09,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2024-02-07 14:44:09,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:44:09,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:09,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2024-02-07 14:44:09,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:09,186 INFO L124 PetriNetUnfolderBase]: 116/318 cut-off events. [2024-02-07 14:44:09,187 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2024-02-07 14:44:09,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 318 events. 116/318 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1256 event pairs, 65 based on Foata normal form. 4/312 useless extension candidates. Maximal degree in co-relation 519. Up to 145 conditions per place. [2024-02-07 14:44:09,188 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 40 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2024-02-07 14:44:09,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 277 flow [2024-02-07 14:44:09,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:44:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:44:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-02-07 14:44:09,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6076923076923076 [2024-02-07 14:44:09,190 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 154 flow. Second operand 5 states and 158 transitions. [2024-02-07 14:44:09,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 277 flow [2024-02-07 14:44:09,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 258 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-02-07 14:44:09,191 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 139 flow [2024-02-07 14:44:09,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-02-07 14:44:09,192 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2024-02-07 14:44:09,192 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 139 flow [2024-02-07 14:44:09,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:44:09,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:09,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:09,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:44:09,193 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:44:09,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1260275821, now seen corresponding path program 1 times [2024-02-07 14:44:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084758121] [2024-02-07 14:44:09,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:09,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:44:09,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:44:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:44:09,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:44:09,249 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:44:09,251 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2024-02-07 14:44:09,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 18 remaining) [2024-02-07 14:44:09,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 18 remaining) [2024-02-07 14:44:09,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 18 remaining) [2024-02-07 14:44:09,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 18 remaining) [2024-02-07 14:44:09,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 18 remaining) [2024-02-07 14:44:09,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 18 remaining) [2024-02-07 14:44:09,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 18 remaining) [2024-02-07 14:44:09,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 18 remaining) [2024-02-07 14:44:09,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 18 remaining) [2024-02-07 14:44:09,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2024-02-07 14:44:09,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 18 remaining) [2024-02-07 14:44:09,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 18 remaining) [2024-02-07 14:44:09,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 18 remaining) [2024-02-07 14:44:09,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 18 remaining) [2024-02-07 14:44:09,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 18 remaining) [2024-02-07 14:44:09,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 18 remaining) [2024-02-07 14:44:09,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 18 remaining) [2024-02-07 14:44:09,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:44:09,255 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:09,260 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:44:09,260 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:44:09,315 INFO L503 ceAbstractionStarter]: Automizer considered 9 witness invariants [2024-02-07 14:44:09,315 INFO L504 ceAbstractionStarter]: WitnessConsidered=9 [2024-02-07 14:44:09,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:44:09 BasicIcfg [2024-02-07 14:44:09,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:44:09,317 INFO L158 Benchmark]: Toolchain (without parser) took 3510.71ms. Allocated memory was 203.4MB in the beginning and 262.1MB in the end (delta: 58.7MB). Free memory was 126.0MB in the beginning and 227.1MB in the end (delta: -101.1MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. [2024-02-07 14:44:09,317 INFO L158 Benchmark]: Witness Parser took 0.28ms. Allocated memory is still 203.4MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:44:09,317 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 203.4MB. Free memory was 173.5MB in the beginning and 173.3MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:44:09,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.49ms. Allocated memory is still 203.4MB. Free memory was 125.8MB in the beginning and 154.4MB in the end (delta: -28.6MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-02-07 14:44:09,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.78ms. Allocated memory is still 203.4MB. Free memory was 154.4MB in the beginning and 152.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:44:09,318 INFO L158 Benchmark]: Boogie Preprocessor took 81.38ms. Allocated memory is still 203.4MB. Free memory was 152.2MB in the beginning and 150.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:44:09,318 INFO L158 Benchmark]: RCFGBuilder took 554.37ms. Allocated memory is still 203.4MB. Free memory was 150.1MB in the beginning and 118.7MB in the end (delta: 31.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-07 14:44:09,319 INFO L158 Benchmark]: TraceAbstraction took 2145.09ms. Allocated memory was 203.4MB in the beginning and 262.1MB in the end (delta: 58.7MB). Free memory was 118.6MB in the beginning and 227.1MB in the end (delta: -108.4MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2024-02-07 14:44:09,320 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.28ms. Allocated memory is still 203.4MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 203.4MB. Free memory was 173.5MB in the beginning and 173.3MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 614.49ms. Allocated memory is still 203.4MB. Free memory was 125.8MB in the beginning and 154.4MB in the end (delta: -28.6MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.78ms. Allocated memory is still 203.4MB. Free memory was 154.4MB in the beginning and 152.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.38ms. Allocated memory is still 203.4MB. Free memory was 152.2MB in the beginning and 150.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 554.37ms. Allocated memory is still 203.4MB. Free memory was 150.1MB in the beginning and 118.7MB in the end (delta: 31.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2145.09ms. Allocated memory was 203.4MB in the beginning and 262.1MB in the end (delta: 58.7MB). Free memory was 118.6MB in the beginning and 227.1MB in the end (delta: -108.4MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 727]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L693] 0 int data1, data2; [L716] 0 pthread_t t1, t2; [L719] 0 data1 = 10 VAL [data1=10, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L720] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[10]]]] [L720] 0 data2 = 10 VAL [data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L721] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[10]]]] [L721] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] [L697] 1 data1++ VAL [arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L698] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[11],IdentifierExpression[data1]]]] VAL [arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L722] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L723] 0 \read(t1) VAL [arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L700] 1 data2++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L701] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[data2]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L707] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] [L707] 2 data1+=5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L708] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[15],IdentifierExpression[data1]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L702] 1 return 0; [L723] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L724] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L710] 2 data2-=6 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L711] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[data2],IntegerLiteral[2147483641]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L712] 2 return 0; [L724] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L725] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L725] COND TRUE 0 data1==16 && data2==5 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L727] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: 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: 722]: 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, 86 locations, 18 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: 2.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 367 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 641 IncrementalHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 9 mSDtfsCounter, 641 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=6, InterpolantAutomatonStates: 35, 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.4s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 14:44:09,357 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