./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.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/stateful01-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cb09d658 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.2023-12-19_14-39-08.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-cb09d65-m [2024-01-27 23:11:31,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 23:11:31,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 23:11:31,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 23:11:31,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 23:11:31,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 23:11:31,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 23:11:31,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 23:11:31,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 23:11:31,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 23:11:31,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 23:11:31,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 23:11:31,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 23:11:31,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 23:11:31,968 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 23:11:31,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 23:11:31,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 23:11:31,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 23:11:31,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 23:11:31,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 23:11:31,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 23:11:31,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 23:11:31,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 23:11:31,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 23:11:31,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 23:11:31,971 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 23:11:31,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 23:11:31,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 23:11:31,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 23:11:31,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 23:11:31,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 23:11:31,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 23:11:31,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:11:31,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 23:11:31,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 23:11:31,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 23:11:31,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 23:11:31,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 23:11:31,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 23:11:31,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 23:11:31,974 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 23:11:31,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 23:11:31,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 23:11:31,975 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-01-27 23:11:32,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 23:11:32,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 23:11:32,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 23:11:32,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 23:11:32,218 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 23:11:32,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stateful01-1.i [2024-01-27 23:11:33,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 23:11:33,505 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 23:11:33,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i [2024-01-27 23:11:33,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/217de38b2/74a675a4d9964d468b7cb64e9cfd7b2b/FLAG2882fc180 [2024-01-27 23:11:33,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/217de38b2/74a675a4d9964d468b7cb64e9cfd7b2b [2024-01-27 23:11:33,527 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 23:11:33,528 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 23:11:33,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/stateful01-1.yml/witness.yml [2024-01-27 23:11:33,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 23:11:33,621 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 23:11:33,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 23:11:33,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 23:11:33,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 23:11:33,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:11:33" (1/2) ... [2024-01-27 23:11:33,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367e4cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:11:33, skipping insertion in model container [2024-01-27 23:11:33,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:11:33" (1/2) ... [2024-01-27 23:11:33,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f239132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:11:33, skipping insertion in model container [2024-01-27 23:11:33,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:11:33" (2/2) ... [2024-01-27 23:11:33,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367e4cb1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:33, skipping insertion in model container [2024-01-27 23:11:33,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:11:33" (2/2) ... [2024-01-27 23:11:33,630 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 23:11:33,667 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 23:11:33,668 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] data2 == 0 [2024-01-27 23:11:33,668 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] data1 == 0 [2024-01-27 23:11:33,668 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (unsigned long )arg == 0UL [2024-01-27 23:11:33,668 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (unsigned long )arg == 0UL [2024-01-27 23:11:33,669 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] (unsigned long )arg == 0UL [2024-01-27 23:11:33,669 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] 10 <= data1 [2024-01-27 23:11:33,669 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L712] (unsigned long )arg == 0UL [2024-01-27 23:11:33,669 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] 11 <= data1 [2024-01-27 23:11:33,669 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] (unsigned long )arg == 0UL [2024-01-27 23:11:33,669 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] data2 == 10 [2024-01-27 23:11:33,670 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] data1 == 10 [2024-01-27 23:11:33,670 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] (unsigned long )arg == 0UL [2024-01-27 23:11:33,670 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] data2 <= 2147483641 [2024-01-27 23:11:33,670 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] 10 <= data1 [2024-01-27 23:11:33,670 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] (unsigned long )arg == 0UL [2024-01-27 23:11:33,670 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] 10 <= data1 [2024-01-27 23:11:33,670 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] data2 == 0 [2024-01-27 23:11:33,671 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] data1 == 0 [2024-01-27 23:11:33,671 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] (unsigned long )arg == 0UL [2024-01-27 23:11:33,671 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] 15 <= data1 [2024-01-27 23:11:33,671 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (unsigned long )arg == 0UL [2024-01-27 23:11:33,671 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] (unsigned long )arg == 0UL [2024-01-27 23:11:33,672 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] (unsigned long )arg == 0UL [2024-01-27 23:11:33,672 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] 10 <= data1 [2024-01-27 23:11:33,672 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] (unsigned long )arg == 0UL [2024-01-27 23:11:33,672 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (unsigned long )arg == 0UL [2024-01-27 23:11:33,672 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] -2147483647 <= data2 [2024-01-27 23:11:33,672 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] 10 <= data1 [2024-01-27 23:11:33,672 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] data2 == 0 [2024-01-27 23:11:33,672 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] data1 == 10 [2024-01-27 23:11:33,673 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] data2 == 0 [2024-01-27 23:11:33,673 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] data1 == 0 [2024-01-27 23:11:33,673 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] 10 <= data1 [2024-01-27 23:11:33,673 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (unsigned long )arg == 0UL [2024-01-27 23:11:33,709 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 23:11:34,011 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-01-27 23:11:34,016 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:11:34,027 INFO L202 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local 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-01-27 23:11:34,116 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-01-27 23:11:34,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:11:34,150 INFO L206 MainTranslator]: Completed translation [2024-01-27 23:11:34,151 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34 WrapperNode [2024-01-27 23:11:34,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 23:11:34,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 23:11:34,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 23:11:34,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 23:11:34,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (1/1) ... [2024-01-27 23:11:34,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (1/1) ... [2024-01-27 23:11:34,185 INFO L138 Inliner]: procedures = 169, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2024-01-27 23:11:34,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 23:11:34,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 23:11:34,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 23:11:34,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 23:11:34,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (1/1) ... [2024-01-27 23:11:34,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (1/1) ... [2024-01-27 23:11:34,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (1/1) ... [2024-01-27 23:11:34,213 INFO L175 MemorySlicer]: Split 16 memory accesses to 5 slices as follows [2, 5, 5, 2, 2]. 31 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0, 0]. The 2 writes are split as follows [0, 0, 0, 1, 1]. [2024-01-27 23:11:34,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (1/1) ... [2024-01-27 23:11:34,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (1/1) ... [2024-01-27 23:11:34,218 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (1/1) ... [2024-01-27 23:11:34,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (1/1) ... [2024-01-27 23:11:34,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (1/1) ... [2024-01-27 23:11:34,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (1/1) ... [2024-01-27 23:11:34,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 23:11:34,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 23:11:34,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 23:11:34,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 23:11:34,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (1/1) ... [2024-01-27 23:11:34,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:11:34,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 23:11:34,262 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-01-27 23:11:34,298 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-01-27 23:11:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 23:11:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 23:11:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 23:11:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 23:11:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 23:11:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 23:11:34,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 23:11:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 23:11:34,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 23:11:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 23:11:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 23:11:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 23:11:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 23:11:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 23:11:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 23:11:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 23:11:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 23:11:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 23:11:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 23:11:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 23:11:34,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 23:11:34,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 23:11:34,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 23:11:34,384 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 23:11:34,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 23:11:34,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 23:11:34,385 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 23:11:34,529 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 23:11:34,531 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 23:11:34,953 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 23:11:34,954 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 23:11:35,067 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 23:11:35,070 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 23:11:35,071 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:11:35 BoogieIcfgContainer [2024-01-27 23:11:35,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 23:11:35,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 23:11:35,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 23:11:35,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 23:11:35,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:11:33" (1/4) ... [2024-01-27 23:11:35,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7454338e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:11:35, skipping insertion in model container [2024-01-27 23:11:35,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:11:33" (2/4) ... [2024-01-27 23:11:35,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7454338e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:11:35, skipping insertion in model container [2024-01-27 23:11:35,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:11:34" (3/4) ... [2024-01-27 23:11:35,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7454338e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:11:35, skipping insertion in model container [2024-01-27 23:11:35,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:11:35" (4/4) ... [2024-01-27 23:11:35,081 INFO L112 eAbstractionObserver]: Analyzing ICFG stateful01-1.i [2024-01-27 23:11:35,095 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 23:11:35,095 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-01-27 23:11:35,095 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 23:11:35,149 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 23:11:35,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 102 transitions, 218 flow [2024-01-27 23:11:35,234 INFO L124 PetriNetUnfolderBase]: 1/100 cut-off events. [2024-01-27 23:11:35,234 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 23:11:35,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 1/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 144 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-01-27 23:11:35,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 102 transitions, 218 flow [2024-01-27 23:11:35,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 97 transitions, 206 flow [2024-01-27 23:11:35,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 23:11:35,250 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;@3a6ac310, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 23:11:35,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-01-27 23:11:35,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 23:11:35,252 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 23:11:35,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:11:35,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:35,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 23:11:35,253 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:35,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash 9952, now seen corresponding path program 1 times [2024-01-27 23:11:35,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:35,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879469957] [2024-01-27 23:11:35,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:35,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:35,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:35,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879469957] [2024-01-27 23:11:35,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879469957] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:35,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:35,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:11:35,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773965449] [2024-01-27 23:11:35,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:35,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:11:35,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:35,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:11:35,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:11:35,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 102 [2024-01-27 23:11:35,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 97 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-01-27 23:11:35,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:35,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 102 [2024-01-27 23:11:35,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:35,665 INFO L124 PetriNetUnfolderBase]: 360/1160 cut-off events. [2024-01-27 23:11:35,665 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-01-27 23:11:35,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 1160 events. 360/1160 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 7545 event pairs, 360 based on Foata normal form. 0/999 useless extension candidates. Maximal degree in co-relation 1720. Up to 654 conditions per place. [2024-01-27 23:11:35,674 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 37 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-27 23:11:35,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 94 transitions, 278 flow [2024-01-27 23:11:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:11:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:11:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2024-01-27 23:11:35,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-01-27 23:11:35,685 INFO L175 Difference]: Start difference. First operand has 104 places, 97 transitions, 206 flow. Second operand 3 states and 216 transitions. [2024-01-27 23:11:35,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 94 transitions, 278 flow [2024-01-27 23:11:35,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 94 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 23:11:35,690 INFO L231 Difference]: Finished difference. Result has 99 places, 94 transitions, 196 flow [2024-01-27 23:11:35,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=99, PETRI_TRANSITIONS=94} [2024-01-27 23:11:35,694 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -5 predicate places. [2024-01-27 23:11:35,695 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 94 transitions, 196 flow [2024-01-27 23:11:35,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-01-27 23:11:35,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:35,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 23:11:35,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 23:11:35,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:35,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:35,696 INFO L85 PathProgramCache]: Analyzing trace with hash 308815, now seen corresponding path program 1 times [2024-01-27 23:11:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:35,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139645910] [2024-01-27 23:11:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:35,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:35,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139645910] [2024-01-27 23:11:35,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139645910] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:35,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:35,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:11:35,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026131062] [2024-01-27 23:11:35,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:35,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:11:35,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:35,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:11:35,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:11:35,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 102 [2024-01-27 23:11:35,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:11:35,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:35,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 102 [2024-01-27 23:11:35,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:35,832 INFO L124 PetriNetUnfolderBase]: 240/706 cut-off events. [2024-01-27 23:11:35,832 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:11:35,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 706 events. 240/706 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4413 event pairs, 240 based on Foata normal form. 1/532 useless extension candidates. Maximal degree in co-relation 1151. Up to 443 conditions per place. [2024-01-27 23:11:35,836 INFO L140 encePairwiseOnDemand]: 96/102 looper letters, 28 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-01-27 23:11:35,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 90 transitions, 248 flow [2024-01-27 23:11:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:11:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:11:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2024-01-27 23:11:35,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7581699346405228 [2024-01-27 23:11:35,838 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 196 flow. Second operand 3 states and 232 transitions. [2024-01-27 23:11:35,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 90 transitions, 248 flow [2024-01-27 23:11:35,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 90 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:11:35,840 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 188 flow [2024-01-27 23:11:35,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2024-01-27 23:11:35,840 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2024-01-27 23:11:35,841 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 188 flow [2024-01-27 23:11:35,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:11:35,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:35,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:11:35,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 23:11:35,841 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:35,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1884864004, now seen corresponding path program 1 times [2024-01-27 23:11:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:35,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078452695] [2024-01-27 23:11:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:35,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:35,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078452695] [2024-01-27 23:11:35,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078452695] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:35,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:35,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:11:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888588004] [2024-01-27 23:11:35,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:35,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:11:35,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:35,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:11:35,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:11:35,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2024-01-27 23:11:35,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:11:35,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:35,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2024-01-27 23:11:35,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:36,013 INFO L124 PetriNetUnfolderBase]: 412/1186 cut-off events. [2024-01-27 23:11:36,014 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-27 23:11:36,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 1186 events. 412/1186 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 7869 event pairs, 203 based on Foata normal form. 5/1000 useless extension candidates. Maximal degree in co-relation 1929. Up to 726 conditions per place. [2024-01-27 23:11:36,019 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 45 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2024-01-27 23:11:36,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 95 transitions, 295 flow [2024-01-27 23:11:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:11:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:11:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2024-01-27 23:11:36,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7287581699346405 [2024-01-27 23:11:36,021 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 188 flow. Second operand 3 states and 223 transitions. [2024-01-27 23:11:36,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 95 transitions, 295 flow [2024-01-27 23:11:36,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:11:36,023 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 201 flow [2024-01-27 23:11:36,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2024-01-27 23:11:36,024 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -10 predicate places. [2024-01-27 23:11:36,024 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 201 flow [2024-01-27 23:11:36,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:11:36,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:36,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:11:36,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 23:11:36,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:36,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:36,025 INFO L85 PathProgramCache]: Analyzing trace with hash 419201516, now seen corresponding path program 1 times [2024-01-27 23:11:36,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:36,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961516047] [2024-01-27 23:11:36,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:36,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:36,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:36,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961516047] [2024-01-27 23:11:36,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961516047] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:36,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:36,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:11:36,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239237753] [2024-01-27 23:11:36,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:36,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:11:36,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:36,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:11:36,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:11:36,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 102 [2024-01-27 23:11:36,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-01-27 23:11:36,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:36,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 102 [2024-01-27 23:11:36,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:36,150 INFO L124 PetriNetUnfolderBase]: 240/783 cut-off events. [2024-01-27 23:11:36,151 INFO L125 PetriNetUnfolderBase]: For 46/68 co-relation queries the response was YES. [2024-01-27 23:11:36,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 783 events. 240/783 cut-off events. For 46/68 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4761 event pairs, 90 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 979. Up to 321 conditions per place. [2024-01-27 23:11:36,155 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 42 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2024-01-27 23:11:36,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 102 transitions, 320 flow [2024-01-27 23:11:36,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:11:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:11:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2024-01-27 23:11:36,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8202614379084967 [2024-01-27 23:11:36,156 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 201 flow. Second operand 3 states and 251 transitions. [2024-01-27 23:11:36,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 102 transitions, 320 flow [2024-01-27 23:11:36,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 102 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:11:36,158 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 213 flow [2024-01-27 23:11:36,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2024-01-27 23:11:36,159 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2024-01-27 23:11:36,159 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 213 flow [2024-01-27 23:11:36,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-01-27 23:11:36,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:36,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:11:36,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 23:11:36,160 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:36,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1332084932, now seen corresponding path program 1 times [2024-01-27 23:11:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:36,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837201152] [2024-01-27 23:11:36,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:36,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:36,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837201152] [2024-01-27 23:11:36,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837201152] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:36,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:36,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:11:36,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156289311] [2024-01-27 23:11:36,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:36,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:11:36,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:36,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:11:36,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:11:36,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-27 23:11:36,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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-01-27 23:11:36,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:36,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-27 23:11:36,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:36,414 INFO L124 PetriNetUnfolderBase]: 213/865 cut-off events. [2024-01-27 23:11:36,414 INFO L125 PetriNetUnfolderBase]: For 83/93 co-relation queries the response was YES. [2024-01-27 23:11:36,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 865 events. 213/865 cut-off events. For 83/93 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5567 event pairs, 101 based on Foata normal form. 108/808 useless extension candidates. Maximal degree in co-relation 553. Up to 367 conditions per place. [2024-01-27 23:11:36,418 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 40 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-27 23:11:36,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 309 flow [2024-01-27 23:11:36,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:11:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:11:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 305 transitions. [2024-01-27 23:11:36,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7475490196078431 [2024-01-27 23:11:36,419 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 213 flow. Second operand 4 states and 305 transitions. [2024-01-27 23:11:36,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 309 flow [2024-01-27 23:11:36,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 94 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:11:36,421 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 200 flow [2024-01-27 23:11:36,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=90, PETRI_TRANSITIONS=84} [2024-01-27 23:11:36,422 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -14 predicate places. [2024-01-27 23:11:36,422 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 200 flow [2024-01-27 23:11:36,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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-01-27 23:11:36,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:36,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:11:36,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 23:11:36,423 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:36,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:36,423 INFO L85 PathProgramCache]: Analyzing trace with hash -234538837, now seen corresponding path program 1 times [2024-01-27 23:11:36,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:36,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002152070] [2024-01-27 23:11:36,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:36,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:36,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:36,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002152070] [2024-01-27 23:11:36,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002152070] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:36,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:36,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:11:36,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099704596] [2024-01-27 23:11:36,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:36,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:11:36,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:36,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:11:36,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:11:36,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-27 23:11:36,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 84 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-01-27 23:11:36,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:36,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-27 23:11:36,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:36,605 INFO L124 PetriNetUnfolderBase]: 213/654 cut-off events. [2024-01-27 23:11:36,605 INFO L125 PetriNetUnfolderBase]: For 74/90 co-relation queries the response was YES. [2024-01-27 23:11:36,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 654 events. 213/654 cut-off events. For 74/90 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3804 event pairs, 49 based on Foata normal form. 108/703 useless extension candidates. Maximal degree in co-relation 1126. Up to 337 conditions per place. [2024-01-27 23:11:36,608 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 47 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-27 23:11:36,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 94 transitions, 327 flow [2024-01-27 23:11:36,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:11:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:11:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 312 transitions. [2024-01-27 23:11:36,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2024-01-27 23:11:36,610 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 200 flow. Second operand 4 states and 312 transitions. [2024-01-27 23:11:36,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 94 transitions, 327 flow [2024-01-27 23:11:36,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 94 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:11:36,611 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 187 flow [2024-01-27 23:11:36,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2024-01-27 23:11:36,612 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-27 23:11:36,612 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 187 flow [2024-01-27 23:11:36,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-01-27 23:11:36,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:36,613 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] [2024-01-27 23:11:36,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 23:11:36,613 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:36,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:36,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2070598463, now seen corresponding path program 1 times [2024-01-27 23:11:36,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:36,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717512011] [2024-01-27 23:11:36,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:36,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:36,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:36,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717512011] [2024-01-27 23:11:36,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717512011] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:36,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:36,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:11:36,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15419396] [2024-01-27 23:11:36,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:36,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:11:36,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:36,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:11:36,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:11:36,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 102 [2024-01-27 23:11:36,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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-01-27 23:11:36,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:36,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 102 [2024-01-27 23:11:36,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:36,790 INFO L124 PetriNetUnfolderBase]: 360/946 cut-off events. [2024-01-27 23:11:36,791 INFO L125 PetriNetUnfolderBase]: For 103/111 co-relation queries the response was YES. [2024-01-27 23:11:36,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 946 events. 360/946 cut-off events. For 103/111 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5294 event pairs, 149 based on Foata normal form. 44/936 useless extension candidates. Maximal degree in co-relation 1701. Up to 617 conditions per place. [2024-01-27 23:11:36,795 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 46 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2024-01-27 23:11:36,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 282 flow [2024-01-27 23:11:36,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:11:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:11:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2024-01-27 23:11:36,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6421568627450981 [2024-01-27 23:11:36,797 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 187 flow. Second operand 4 states and 262 transitions. [2024-01-27 23:11:36,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 282 flow [2024-01-27 23:11:36,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:11:36,803 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 172 flow [2024-01-27 23:11:36,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2024-01-27 23:11:36,804 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -26 predicate places. [2024-01-27 23:11:36,804 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 172 flow [2024-01-27 23:11:36,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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-01-27 23:11:36,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:36,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:11:36,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 23:11:36,805 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:36,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash 922078032, now seen corresponding path program 1 times [2024-01-27 23:11:36,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:36,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410448977] [2024-01-27 23:11:36,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:36,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:36,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:36,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410448977] [2024-01-27 23:11:36,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410448977] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:36,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:36,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:11:36,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291148285] [2024-01-27 23:11:36,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:36,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:11:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:11:36,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:11:36,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 102 [2024-01-27 23:11:36,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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-01-27 23:11:36,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:36,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 102 [2024-01-27 23:11:36,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:37,018 INFO L124 PetriNetUnfolderBase]: 360/922 cut-off events. [2024-01-27 23:11:37,018 INFO L125 PetriNetUnfolderBase]: For 100/108 co-relation queries the response was YES. [2024-01-27 23:11:37,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1713 conditions, 922 events. 360/922 cut-off events. For 100/108 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5028 event pairs, 63 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1678. Up to 515 conditions per place. [2024-01-27 23:11:37,022 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 52 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-01-27 23:11:37,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 307 flow [2024-01-27 23:11:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:11:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:11:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2024-01-27 23:11:37,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6495098039215687 [2024-01-27 23:11:37,023 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 172 flow. Second operand 4 states and 265 transitions. [2024-01-27 23:11:37,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 307 flow [2024-01-27 23:11:37,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 81 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:11:37,025 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 172 flow [2024-01-27 23:11:37,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2024-01-27 23:11:37,027 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -26 predicate places. [2024-01-27 23:11:37,027 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 172 flow [2024-01-27 23:11:37,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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-01-27 23:11:37,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:37,030 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] [2024-01-27 23:11:37,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 23:11:37,030 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:37,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash 257875542, now seen corresponding path program 1 times [2024-01-27 23:11:37,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:37,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081714111] [2024-01-27 23:11:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:37,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:37,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:37,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081714111] [2024-01-27 23:11:37,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081714111] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:37,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:37,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:11:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772947907] [2024-01-27 23:11:37,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:37,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:11:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:11:37,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:11:37,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 102 [2024-01-27 23:11:37,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 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-01-27 23:11:37,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:37,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 102 [2024-01-27 23:11:37,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:37,185 INFO L124 PetriNetUnfolderBase]: 221/602 cut-off events. [2024-01-27 23:11:37,185 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-01-27 23:11:37,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 602 events. 221/602 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3185 event pairs, 68 based on Foata normal form. 14/579 useless extension candidates. Maximal degree in co-relation 1114. Up to 146 conditions per place. [2024-01-27 23:11:37,188 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 50 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2024-01-27 23:11:37,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 90 transitions, 336 flow [2024-01-27 23:11:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:11:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:11:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 330 transitions. [2024-01-27 23:11:37,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8088235294117647 [2024-01-27 23:11:37,189 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 172 flow. Second operand 4 states and 330 transitions. [2024-01-27 23:11:37,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 90 transitions, 336 flow [2024-01-27 23:11:37,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 90 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:11:37,191 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 183 flow [2024-01-27 23:11:37,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2024-01-27 23:11:37,192 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -24 predicate places. [2024-01-27 23:11:37,192 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 183 flow [2024-01-27 23:11:37,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 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-01-27 23:11:37,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:37,193 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] [2024-01-27 23:11:37,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 23:11:37,193 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:37,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:37,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1586323528, now seen corresponding path program 1 times [2024-01-27 23:11:37,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:37,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423117527] [2024-01-27 23:11:37,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:37,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:37,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423117527] [2024-01-27 23:11:37,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423117527] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:37,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:37,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:11:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429378132] [2024-01-27 23:11:37,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:37,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:11:37,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:37,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:11:37,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:11:37,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 102 [2024-01-27 23:11:37,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 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-01-27 23:11:37,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:37,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 102 [2024-01-27 23:11:37,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:37,371 INFO L124 PetriNetUnfolderBase]: 231/640 cut-off events. [2024-01-27 23:11:37,371 INFO L125 PetriNetUnfolderBase]: For 257/257 co-relation queries the response was YES. [2024-01-27 23:11:37,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 640 events. 231/640 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3428 event pairs, 91 based on Foata normal form. 20/614 useless extension candidates. Maximal degree in co-relation 1229. Up to 178 conditions per place. [2024-01-27 23:11:37,374 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 49 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-01-27 23:11:37,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 92 transitions, 353 flow [2024-01-27 23:11:37,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:11:37,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:11:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-01-27 23:11:37,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8259803921568627 [2024-01-27 23:11:37,376 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 183 flow. Second operand 4 states and 337 transitions. [2024-01-27 23:11:37,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 92 transitions, 353 flow [2024-01-27 23:11:37,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 92 transitions, 344 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 23:11:37,378 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 218 flow [2024-01-27 23:11:37,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2024-01-27 23:11:37,379 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-27 23:11:37,379 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 218 flow [2024-01-27 23:11:37,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 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-01-27 23:11:37,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:37,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:11:37,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 23:11:37,380 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:37,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:37,380 INFO L85 PathProgramCache]: Analyzing trace with hash 323383452, now seen corresponding path program 1 times [2024-01-27 23:11:37,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:37,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006043936] [2024-01-27 23:11:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:37,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:37,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006043936] [2024-01-27 23:11:37,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006043936] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:37,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:37,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:11:37,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462672386] [2024-01-27 23:11:37,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:37,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:11:37,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:37,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:11:37,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:11:37,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 102 [2024-01-27 23:11:37,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-01-27 23:11:37,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:37,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 102 [2024-01-27 23:11:37,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:37,520 INFO L124 PetriNetUnfolderBase]: 116/492 cut-off events. [2024-01-27 23:11:37,520 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2024-01-27 23:11:37,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 492 events. 116/492 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2327 event pairs, 45 based on Foata normal form. 32/506 useless extension candidates. Maximal degree in co-relation 870. Up to 144 conditions per place. [2024-01-27 23:11:37,523 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 30 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2024-01-27 23:11:37,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 77 transitions, 302 flow [2024-01-27 23:11:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:11:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:11:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-01-27 23:11:37,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8398692810457516 [2024-01-27 23:11:37,524 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 218 flow. Second operand 3 states and 257 transitions. [2024-01-27 23:11:37,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 77 transitions, 302 flow [2024-01-27 23:11:37,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 77 transitions, 290 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-27 23:11:37,526 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 214 flow [2024-01-27 23:11:37,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-01-27 23:11:37,527 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-27 23:11:37,527 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 214 flow [2024-01-27 23:11:37,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-01-27 23:11:37,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:37,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:11:37,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 23:11:37,528 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:37,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:37,528 INFO L85 PathProgramCache]: Analyzing trace with hash -185742901, now seen corresponding path program 1 times [2024-01-27 23:11:37,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:37,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627913066] [2024-01-27 23:11:37,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:37,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:37,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:37,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627913066] [2024-01-27 23:11:37,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627913066] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:37,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:37,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 23:11:37,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974241418] [2024-01-27 23:11:37,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:37,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 23:11:37,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:37,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 23:11:37,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-27 23:11:37,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 102 [2024-01-27 23:11:37,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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-01-27 23:11:37,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:37,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 102 [2024-01-27 23:11:37,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:37,701 INFO L124 PetriNetUnfolderBase]: 120/453 cut-off events. [2024-01-27 23:11:37,701 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-01-27 23:11:37,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 453 events. 120/453 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2037 event pairs, 49 based on Foata normal form. 6/431 useless extension candidates. Maximal degree in co-relation 880. Up to 100 conditions per place. [2024-01-27 23:11:37,703 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 47 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2024-01-27 23:11:37,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 90 transitions, 384 flow [2024-01-27 23:11:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 23:11:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 23:11:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions. [2024-01-27 23:11:37,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.792156862745098 [2024-01-27 23:11:37,704 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 214 flow. Second operand 5 states and 404 transitions. [2024-01-27 23:11:37,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 90 transitions, 384 flow [2024-01-27 23:11:37,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 358 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 23:11:37,706 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 206 flow [2024-01-27 23:11:37,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=84, PETRI_TRANSITIONS=69} [2024-01-27 23:11:37,707 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-27 23:11:37,707 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 206 flow [2024-01-27 23:11:37,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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-01-27 23:11:37,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:37,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:11:37,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 23:11:37,708 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:37,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash 815837755, now seen corresponding path program 1 times [2024-01-27 23:11:37,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:37,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284066110] [2024-01-27 23:11:37,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:37,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:11:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:11:37,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:11:37,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284066110] [2024-01-27 23:11:37,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284066110] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:11:37,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:11:37,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 23:11:37,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116903946] [2024-01-27 23:11:37,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:11:37,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 23:11:37,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:11:37,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 23:11:37,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-27 23:11:37,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 102 [2024-01-27 23:11:37,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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-01-27 23:11:37,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:11:37,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 102 [2024-01-27 23:11:37,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:11:37,875 INFO L124 PetriNetUnfolderBase]: 116/433 cut-off events. [2024-01-27 23:11:37,876 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2024-01-27 23:11:37,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 433 events. 116/433 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1970 event pairs, 65 based on Foata normal form. 4/399 useless extension candidates. Maximal degree in co-relation 814. Up to 145 conditions per place. [2024-01-27 23:11:37,878 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 43 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2024-01-27 23:11:37,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 335 flow [2024-01-27 23:11:37,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 23:11:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 23:11:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 396 transitions. [2024-01-27 23:11:37,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7764705882352941 [2024-01-27 23:11:37,879 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 206 flow. Second operand 5 states and 396 transitions. [2024-01-27 23:11:37,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 335 flow [2024-01-27 23:11:37,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 316 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-01-27 23:11:37,881 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 191 flow [2024-01-27 23:11:37,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2024-01-27 23:11:37,881 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -22 predicate places. [2024-01-27 23:11:37,882 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 191 flow [2024-01-27 23:11:37,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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-01-27 23:11:37,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:11:37,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:11:37,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 23:11:37,883 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 23:11:37,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:11:37,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1403162609, now seen corresponding path program 1 times [2024-01-27 23:11:37,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:11:37,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127867181] [2024-01-27 23:11:37,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:11:37,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:11:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:11:37,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 23:11:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:11:37,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 23:11:37,941 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 23:11:37,942 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (60 of 61 remaining) [2024-01-27 23:11:37,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 61 remaining) [2024-01-27 23:11:37,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 61 remaining) [2024-01-27 23:11:37,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 61 remaining) [2024-01-27 23:11:37,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 61 remaining) [2024-01-27 23:11:37,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 61 remaining) [2024-01-27 23:11:37,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 61 remaining) [2024-01-27 23:11:37,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 61 remaining) [2024-01-27 23:11:37,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 61 remaining) [2024-01-27 23:11:37,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 61 remaining) [2024-01-27 23:11:37,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 61 remaining) [2024-01-27 23:11:37,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 61 remaining) [2024-01-27 23:11:37,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 61 remaining) [2024-01-27 23:11:37,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 61 remaining) [2024-01-27 23:11:37,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 61 remaining) [2024-01-27 23:11:37,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 61 remaining) [2024-01-27 23:11:37,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 61 remaining) [2024-01-27 23:11:37,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 61 remaining) [2024-01-27 23:11:37,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 61 remaining) [2024-01-27 23:11:37,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 61 remaining) [2024-01-27 23:11:37,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 61 remaining) [2024-01-27 23:11:37,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 61 remaining) [2024-01-27 23:11:37,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 61 remaining) [2024-01-27 23:11:37,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 61 remaining) [2024-01-27 23:11:37,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 61 remaining) [2024-01-27 23:11:37,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 61 remaining) [2024-01-27 23:11:37,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 61 remaining) [2024-01-27 23:11:37,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 61 remaining) [2024-01-27 23:11:37,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 61 remaining) [2024-01-27 23:11:37,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 61 remaining) [2024-01-27 23:11:37,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 61 remaining) [2024-01-27 23:11:37,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 61 remaining) [2024-01-27 23:11:37,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 61 remaining) [2024-01-27 23:11:37,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 61 remaining) [2024-01-27 23:11:37,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 61 remaining) [2024-01-27 23:11:37,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2024-01-27 23:11:37,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2024-01-27 23:11:37,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 61 remaining) [2024-01-27 23:11:37,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 61 remaining) [2024-01-27 23:11:37,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 61 remaining) [2024-01-27 23:11:37,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 61 remaining) [2024-01-27 23:11:37,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 61 remaining) [2024-01-27 23:11:37,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 61 remaining) [2024-01-27 23:11:37,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 61 remaining) [2024-01-27 23:11:37,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 61 remaining) [2024-01-27 23:11:37,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 61 remaining) [2024-01-27 23:11:37,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 61 remaining) [2024-01-27 23:11:37,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 61 remaining) [2024-01-27 23:11:37,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 61 remaining) [2024-01-27 23:11:37,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 61 remaining) [2024-01-27 23:11:37,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 61 remaining) [2024-01-27 23:11:37,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 61 remaining) [2024-01-27 23:11:37,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 61 remaining) [2024-01-27 23:11:37,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 61 remaining) [2024-01-27 23:11:37,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 61 remaining) [2024-01-27 23:11:37,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 61 remaining) [2024-01-27 23:11:37,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 61 remaining) [2024-01-27 23:11:37,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 61 remaining) [2024-01-27 23:11:37,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 61 remaining) [2024-01-27 23:11:37,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 61 remaining) [2024-01-27 23:11:37,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 61 remaining) [2024-01-27 23:11:37,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 23:11:37,952 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:11:37,957 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 23:11:37,957 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 23:11:37,994 INFO L503 ceAbstractionStarter]: Automizer considered 34 witness invariants [2024-01-27 23:11:37,994 INFO L504 ceAbstractionStarter]: WitnessConsidered=34 [2024-01-27 23:11:37,995 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:11:37 BasicIcfg [2024-01-27 23:11:37,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 23:11:37,995 INFO L158 Benchmark]: Toolchain (without parser) took 4374.40ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 83.1MB in the beginning and 77.8MB in the end (delta: 5.3MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2024-01-27 23:11:37,995 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 115.3MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:11:37,995 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:11:37,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.67ms. Allocated memory is still 115.3MB. Free memory was 83.1MB in the beginning and 58.4MB in the end (delta: 24.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-27 23:11:37,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.93ms. Allocated memory is still 115.3MB. Free memory was 57.9MB in the beginning and 56.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:11:37,996 INFO L158 Benchmark]: Boogie Preprocessor took 33.39ms. Allocated memory is still 115.3MB. Free memory was 56.3MB in the beginning and 53.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 23:11:37,996 INFO L158 Benchmark]: RCFGBuilder took 847.26ms. Allocated memory is still 115.3MB. Free memory was 53.8MB in the beginning and 57.2MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-01-27 23:11:37,996 INFO L158 Benchmark]: TraceAbstraction took 2920.98ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 56.3MB in the beginning and 77.8MB in the end (delta: -21.5MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2024-01-27 23:11:37,997 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 115.3MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.67ms. Allocated memory is still 115.3MB. Free memory was 83.1MB in the beginning and 58.4MB in the end (delta: 24.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.93ms. Allocated memory is still 115.3MB. Free memory was 57.9MB in the beginning and 56.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.39ms. Allocated memory is still 115.3MB. Free memory was 56.3MB in the beginning and 53.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 847.26ms. Allocated memory is still 115.3MB. Free memory was 53.8MB in the beginning and 57.2MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2920.98ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 56.3MB in the beginning and 77.8MB in the end (delta: -21.5MB). Peak memory consumption was 66.2MB. 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; VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L717] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]]]] VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L717] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]] [L718] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]]]] VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L718] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]] [L719] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]]]] VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L719] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]] [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]]]] VAL [data1=10, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L720] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]] [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[data1],IntegerLiteral[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}] [L696] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] VAL [arg={0:0}, arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [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[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] 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}] [L699] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L700] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, data1=11, data2=10, ma={3:0}, mb={4:0}] [L700] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] [L700] 1 data2++ VAL [arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L701] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] VAL [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}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L701] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L702] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L702] 1 return 0; [L722] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L706] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L707] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, 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 [\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}] [L708] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] 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}] [L708] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[15],IdentifierExpression[data1]]]] 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}] [L709] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] 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}] [L723] 0 \read(t1) 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}] [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 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] 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 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [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,IntegerLiteral[10],IdentifierExpression[data1]]]] 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}] [L711] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] 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 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [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] 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: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - 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: 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: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: 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: 701]: 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: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: 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: 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: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: 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: 711]: 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: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: 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: 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: 721]: 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, 172 locations, 61 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.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 815 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 557 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1179 IncrementalHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 63 mSDtfsCounter, 1179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=10, InterpolantAutomatonStates: 49, 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.6s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-01-27 23:11:38,047 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