./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 a340643f 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-a340643-m [2024-01-27 14:53:42,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 14:53:42,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 14:53:42,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 14:53:42,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 14:53:42,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 14:53:42,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 14:53:42,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 14:53:42,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 14:53:42,151 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 14:53:42,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 14:53:42,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 14:53:42,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 14:53:42,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 14:53:42,153 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 14:53:42,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 14:53:42,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 14:53:42,154 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 14:53:42,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 14:53:42,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 14:53:42,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 14:53:42,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 14:53:42,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 14:53:42,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 14:53:42,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 14:53:42,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 14:53:42,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 14:53:42,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 14:53:42,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 14:53:42,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 14:53:42,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 14:53:42,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 14:53:42,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:53:42,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 14:53:42,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 14:53:42,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 14:53:42,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 14:53:42,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 14:53:42,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 14:53:42,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 14:53:42,159 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 14:53:42,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 14:53:42,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 14:53:42,160 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 14:53:42,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 14:53:42,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 14:53:42,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 14:53:42,407 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 14:53:42,407 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 14:53:42,408 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 14:53:42,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 14:53:42,551 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 14:53:42,551 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 14:53:43,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 14:53:43,791 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 14:53:43,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i [2024-01-27 14:53:43,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de156220/7ec9e50ae2db41e390f5c625431f8a79/FLAGfcd63913e [2024-01-27 14:53:43,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de156220/7ec9e50ae2db41e390f5c625431f8a79 [2024-01-27 14:53:43,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 14:53:43,813 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 14:53:43,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 14:53:43,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 14:53:43,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 14:53:43,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:53:42" (1/2) ... [2024-01-27 14:53:43,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a563f4e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:53:43, skipping insertion in model container [2024-01-27 14:53:43,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:53:42" (1/2) ... [2024-01-27 14:53:43,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3fb1bda7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:53:43, skipping insertion in model container [2024-01-27 14:53:43,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:53:43" (2/2) ... [2024-01-27 14:53:43,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a563f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:43, skipping insertion in model container [2024-01-27 14:53:43,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:53:43" (2/2) ... [2024-01-27 14:53:43,822 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 14:53:43,868 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 14:53:43,869 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] 11 <= data1 [2024-01-27 14:53:43,870 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] (unsigned long )arg == 0UL [2024-01-27 14:53:43,870 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L712] (unsigned long )arg == 0UL [2024-01-27 14:53:43,870 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] (unsigned long )arg == 0UL [2024-01-27 14:53:43,870 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (unsigned long )arg == 0UL [2024-01-27 14:53:43,871 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] (unsigned long )arg == 0UL [2024-01-27 14:53:43,871 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] 10 <= data1 [2024-01-27 14:53:43,871 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] (unsigned long )arg == 0UL [2024-01-27 14:53:43,872 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] (unsigned long )arg == 0UL [2024-01-27 14:53:43,872 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] 10 <= data1 [2024-01-27 14:53:43,872 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] 10 <= data1 [2024-01-27 14:53:43,872 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] data2 <= 2147483641 [2024-01-27 14:53:43,872 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] (unsigned long )arg == 0UL [2024-01-27 14:53:43,872 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] 10 <= data1 [2024-01-27 14:53:43,872 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (unsigned long )arg == 0UL [2024-01-27 14:53:43,873 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] data1 == 0 [2024-01-27 14:53:43,873 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] data2 == 0 [2024-01-27 14:53:43,873 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] data2 == 0 [2024-01-27 14:53:43,873 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] data1 == 0 [2024-01-27 14:53:43,873 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] 10 <= data1 [2024-01-27 14:53:43,873 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] (unsigned long )arg == 0UL [2024-01-27 14:53:43,874 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] -2147483647 <= data2 [2024-01-27 14:53:43,874 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (unsigned long )arg == 0UL [2024-01-27 14:53:43,874 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] 10 <= data1 [2024-01-27 14:53:43,874 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] data1 == 10 [2024-01-27 14:53:43,874 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] data2 == 10 [2024-01-27 14:53:43,875 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] data1 == 0 [2024-01-27 14:53:43,875 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] data2 == 0 [2024-01-27 14:53:43,875 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (unsigned long )arg == 0UL [2024-01-27 14:53:43,875 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (unsigned long )arg == 0UL [2024-01-27 14:53:43,875 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] 15 <= data1 [2024-01-27 14:53:43,875 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] data1 == 10 [2024-01-27 14:53:43,875 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] data2 == 0 [2024-01-27 14:53:43,875 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] (unsigned long )arg == 0UL [2024-01-27 14:53:43,915 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 14:53:44,222 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 14:53:44,226 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:53:44,237 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 14:53:44,345 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 14:53:44,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:53:44,378 INFO L206 MainTranslator]: Completed translation [2024-01-27 14:53:44,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44 WrapperNode [2024-01-27 14:53:44,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 14:53:44,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 14:53:44,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 14:53:44,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 14:53:44,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (1/1) ... [2024-01-27 14:53:44,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (1/1) ... [2024-01-27 14:53:44,434 INFO L138 Inliner]: procedures = 169, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2024-01-27 14:53:44,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 14:53:44,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 14:53:44,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 14:53:44,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 14:53:44,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (1/1) ... [2024-01-27 14:53:44,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (1/1) ... [2024-01-27 14:53:44,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (1/1) ... [2024-01-27 14:53:44,471 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 14:53:44,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (1/1) ... [2024-01-27 14:53:44,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (1/1) ... [2024-01-27 14:53:44,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (1/1) ... [2024-01-27 14:53:44,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (1/1) ... [2024-01-27 14:53:44,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (1/1) ... [2024-01-27 14:53:44,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (1/1) ... [2024-01-27 14:53:44,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 14:53:44,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 14:53:44,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 14:53:44,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 14:53:44,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (1/1) ... [2024-01-27 14:53:44,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:53:44,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:53:44,516 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 14:53:44,518 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 14:53:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 14:53:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 14:53:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 14:53:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 14:53:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 14:53:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 14:53:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 14:53:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 14:53:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 14:53:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 14:53:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 14:53:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 14:53:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 14:53:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 14:53:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 14:53:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 14:53:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 14:53:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 14:53:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 14:53:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 14:53:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 14:53:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 14:53:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 14:53:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 14:53:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 14:53:44,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 14:53:44,562 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 14:53:44,684 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 14:53:44,686 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 14:53:44,982 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 14:53:44,982 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 14:53:45,112 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 14:53:45,112 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 14:53:45,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:53:45 BoogieIcfgContainer [2024-01-27 14:53:45,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 14:53:45,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 14:53:45,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 14:53:45,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 14:53:45,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:53:42" (1/4) ... [2024-01-27 14:53:45,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7a02b5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:53:45, skipping insertion in model container [2024-01-27 14:53:45,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 02:53:43" (2/4) ... [2024-01-27 14:53:45,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7a02b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:53:45, skipping insertion in model container [2024-01-27 14:53:45,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:44" (3/4) ... [2024-01-27 14:53:45,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7a02b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:53:45, skipping insertion in model container [2024-01-27 14:53:45,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:53:45" (4/4) ... [2024-01-27 14:53:45,125 INFO L112 eAbstractionObserver]: Analyzing ICFG stateful01-1.i [2024-01-27 14:53:45,143 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 14:53:45,143 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-01-27 14:53:45,143 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 14:53:45,235 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 14:53:45,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 102 transitions, 218 flow [2024-01-27 14:53:45,305 INFO L124 PetriNetUnfolderBase]: 1/100 cut-off events. [2024-01-27 14:53:45,305 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 14:53:45,307 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 14:53:45,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 102 transitions, 218 flow [2024-01-27 14:53:45,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 97 transitions, 206 flow [2024-01-27 14:53:45,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 14:53:45,331 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;@1ab08c0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 14:53:45,331 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-01-27 14:53:45,333 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 14:53:45,333 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 14:53:45,333 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:53:45,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:45,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 14:53:45,334 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 14:53:45,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash 9952, now seen corresponding path program 1 times [2024-01-27 14:53:45,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:45,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717582511] [2024-01-27 14:53:45,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:45,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:45,587 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 14:53:45,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:45,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717582511] [2024-01-27 14:53:45,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717582511] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:45,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:45,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:53:45,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524627873] [2024-01-27 14:53:45,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:45,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:53:45,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:45,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:53:45,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:53:45,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2024-01-27 14:53:45,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 97 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 14:53:45,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:45,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2024-01-27 14:53:45,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:45,840 INFO L124 PetriNetUnfolderBase]: 240/709 cut-off events. [2024-01-27 14:53:45,840 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-27 14:53:45,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 709 events. 240/709 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4472 event pairs, 240 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1074. Up to 444 conditions per place. [2024-01-27 14:53:45,853 INFO L140 encePairwiseOnDemand]: 96/102 looper letters, 32 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-27 14:53:45,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 93 transitions, 266 flow [2024-01-27 14:53:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:53:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:53:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-01-27 14:53:45,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7320261437908496 [2024-01-27 14:53:45,864 INFO L175 Difference]: Start difference. First operand has 104 places, 97 transitions, 206 flow. Second operand 3 states and 224 transitions. [2024-01-27 14:53:45,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 93 transitions, 266 flow [2024-01-27 14:53:45,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 258 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 14:53:45,871 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 194 flow [2024-01-27 14:53:45,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2024-01-27 14:53:45,875 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -6 predicate places. [2024-01-27 14:53:45,875 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 194 flow [2024-01-27 14:53:45,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 14:53:45,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:45,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 14:53:45,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 14:53:45,878 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 14:53:45,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash 308815, now seen corresponding path program 1 times [2024-01-27 14:53:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:45,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180148724] [2024-01-27 14:53:45,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:45,926 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 14:53:45,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:45,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180148724] [2024-01-27 14:53:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180148724] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:45,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:45,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:53:45,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852132819] [2024-01-27 14:53:45,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:45,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:53:45,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:45,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:53:45,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:53:45,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2024-01-27 14:53:45,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 14:53:45,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:45,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2024-01-27 14:53:45,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:46,109 INFO L124 PetriNetUnfolderBase]: 327/1097 cut-off events. [2024-01-27 14:53:46,109 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 14:53:46,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 1097 events. 327/1097 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7223 event pairs, 327 based on Foata normal form. 0/933 useless extension candidates. Maximal degree in co-relation 1691. Up to 595 conditions per place. [2024-01-27 14:53:46,116 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 32 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-01-27 14:53:46,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 90 transitions, 256 flow [2024-01-27 14:53:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:53:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:53:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2024-01-27 14:53:46,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.738562091503268 [2024-01-27 14:53:46,119 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 194 flow. Second operand 3 states and 226 transitions. [2024-01-27 14:53:46,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 90 transitions, 256 flow [2024-01-27 14:53:46,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 90 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:46,121 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 188 flow [2024-01-27 14:53:46,121 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 14:53:46,121 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2024-01-27 14:53:46,122 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 188 flow [2024-01-27 14:53:46,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 14:53:46,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:46,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:53:46,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 14:53:46,122 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 14:53:46,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1698758338, now seen corresponding path program 1 times [2024-01-27 14:53:46,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:46,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653853745] [2024-01-27 14:53:46,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:46,215 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 14:53:46,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:46,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653853745] [2024-01-27 14:53:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653853745] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:46,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 14:53:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766884908] [2024-01-27 14:53:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:46,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:53:46,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:46,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:53:46,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:53:46,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 102 [2024-01-27 14:53:46,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 14:53:46,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:46,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 102 [2024-01-27 14:53:46,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:46,369 INFO L124 PetriNetUnfolderBase]: 412/1186 cut-off events. [2024-01-27 14:53:46,369 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-27 14:53:46,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1948 conditions, 1186 events. 412/1186 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7864 event pairs, 203 based on Foata normal form. 5/948 useless extension candidates. Maximal degree in co-relation 1931. Up to 724 conditions per place. [2024-01-27 14:53:46,376 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 41 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2024-01-27 14:53:46,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 95 transitions, 287 flow [2024-01-27 14:53:46,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:53:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:53:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2024-01-27 14:53:46,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7549019607843137 [2024-01-27 14:53:46,378 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 188 flow. Second operand 3 states and 231 transitions. [2024-01-27 14:53:46,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 95 transitions, 287 flow [2024-01-27 14:53:46,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:46,380 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 201 flow [2024-01-27 14:53:46,380 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 14:53:46,381 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -10 predicate places. [2024-01-27 14:53:46,381 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 201 flow [2024-01-27 14:53:46,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 14:53:46,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:46,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:53:46,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 14:53:46,382 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 14:53:46,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1121901276, now seen corresponding path program 1 times [2024-01-27 14:53:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:46,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624738458] [2024-01-27 14:53:46,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:46,416 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 14:53:46,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:46,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624738458] [2024-01-27 14:53:46,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624738458] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:46,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:46,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 14:53:46,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274870523] [2024-01-27 14:53:46,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:46,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:53:46,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:46,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:53:46,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:53:46,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-27 14:53:46,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 14:53:46,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:46,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-27 14:53:46,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:46,541 INFO L124 PetriNetUnfolderBase]: 240/783 cut-off events. [2024-01-27 14:53:46,541 INFO L125 PetriNetUnfolderBase]: For 44/66 co-relation queries the response was YES. [2024-01-27 14:53:46,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 783 events. 240/783 cut-off events. For 44/66 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4759 event pairs, 90 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 979. Up to 324 conditions per place. [2024-01-27 14:53:46,545 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 46 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2024-01-27 14:53:46,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 102 transitions, 328 flow [2024-01-27 14:53:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:53:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:53:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2024-01-27 14:53:46,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2024-01-27 14:53:46,547 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 201 flow. Second operand 3 states and 243 transitions. [2024-01-27 14:53:46,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 102 transitions, 328 flow [2024-01-27 14:53:46,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 102 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:53:46,553 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 213 flow [2024-01-27 14:53:46,554 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 14:53:46,555 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2024-01-27 14:53:46,555 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 213 flow [2024-01-27 14:53:46,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 14:53:46,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:46,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:53:46,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 14:53:46,557 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 14:53:46,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1332084932, now seen corresponding path program 1 times [2024-01-27 14:53:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:46,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590148632] [2024-01-27 14:53:46,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:46,707 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 14:53:46,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:46,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590148632] [2024-01-27 14:53:46,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590148632] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:46,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:46,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:46,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121513673] [2024-01-27 14:53:46,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:46,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:46,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:46,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:46,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:46,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-27 14:53:46,722 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 14:53:46,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:46,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-27 14:53:46,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:46,838 INFO L124 PetriNetUnfolderBase]: 213/865 cut-off events. [2024-01-27 14:53:46,838 INFO L125 PetriNetUnfolderBase]: For 83/93 co-relation queries the response was YES. [2024-01-27 14:53:46,839 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 38. Compared 5536 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 14:53:46,842 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 40 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-27 14:53:46,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 309 flow [2024-01-27 14:53:46,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 305 transitions. [2024-01-27 14:53:46,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7475490196078431 [2024-01-27 14:53:46,843 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 213 flow. Second operand 4 states and 305 transitions. [2024-01-27 14:53:46,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 309 flow [2024-01-27 14:53:46,844 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 14:53:46,845 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 200 flow [2024-01-27 14:53:46,845 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 14:53:46,847 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -14 predicate places. [2024-01-27 14:53:46,848 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 200 flow [2024-01-27 14:53:46,848 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 14:53:46,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:46,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:53:46,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 14:53:46,848 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 14:53:46,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:46,848 INFO L85 PathProgramCache]: Analyzing trace with hash -234538837, now seen corresponding path program 1 times [2024-01-27 14:53:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:46,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826791603] [2024-01-27 14:53:46,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:46,931 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 14:53:46,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826791603] [2024-01-27 14:53:46,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826791603] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:46,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:46,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:46,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654156900] [2024-01-27 14:53:46,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:46,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:46,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:46,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:46,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:46,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-27 14:53:46,959 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 14:53:46,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:46,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-27 14:53:46,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:47,072 INFO L124 PetriNetUnfolderBase]: 213/654 cut-off events. [2024-01-27 14:53:47,073 INFO L125 PetriNetUnfolderBase]: For 74/90 co-relation queries the response was YES. [2024-01-27 14:53:47,074 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 31. Compared 3788 event pairs, 49 based on Foata normal form. 108/715 useless extension candidates. Maximal degree in co-relation 1126. Up to 337 conditions per place. [2024-01-27 14:53:47,077 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 47 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-27 14:53:47,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 94 transitions, 327 flow [2024-01-27 14:53:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 312 transitions. [2024-01-27 14:53:47,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2024-01-27 14:53:47,079 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 200 flow. Second operand 4 states and 312 transitions. [2024-01-27 14:53:47,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 94 transitions, 327 flow [2024-01-27 14:53:47,081 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 14:53:47,082 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 187 flow [2024-01-27 14:53:47,082 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 14:53:47,084 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-27 14:53:47,085 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 187 flow [2024-01-27 14:53:47,085 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 14:53:47,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:47,085 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 14:53:47,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 14:53:47,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 14:53:47,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2070598463, now seen corresponding path program 1 times [2024-01-27 14:53:47,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:47,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193688154] [2024-01-27 14:53:47,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:47,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:47,135 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 14:53:47,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:47,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193688154] [2024-01-27 14:53:47,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193688154] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:47,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:47,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:47,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911604562] [2024-01-27 14:53:47,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:47,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:47,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:47,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:47,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2024-01-27 14:53:47,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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 14:53:47,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:47,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2024-01-27 14:53:47,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:47,260 INFO L124 PetriNetUnfolderBase]: 327/887 cut-off events. [2024-01-27 14:53:47,260 INFO L125 PetriNetUnfolderBase]: For 113/121 co-relation queries the response was YES. [2024-01-27 14:53:47,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 887 events. 327/887 cut-off events. For 113/121 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5032 event pairs, 133 based on Foata normal form. 62/897 useless extension candidates. Maximal degree in co-relation 1581. Up to 560 conditions per place. [2024-01-27 14:53:47,264 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 41 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2024-01-27 14:53:47,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 272 flow [2024-01-27 14:53:47,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2024-01-27 14:53:47,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.678921568627451 [2024-01-27 14:53:47,266 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 187 flow. Second operand 4 states and 277 transitions. [2024-01-27 14:53:47,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 272 flow [2024-01-27 14:53:47,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:47,268 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 172 flow [2024-01-27 14:53:47,268 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 14:53:47,269 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -26 predicate places. [2024-01-27 14:53:47,269 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 172 flow [2024-01-27 14:53:47,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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 14:53:47,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:47,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:53:47,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 14:53:47,270 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 14:53:47,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:47,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1415217760, now seen corresponding path program 1 times [2024-01-27 14:53:47,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:47,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191246525] [2024-01-27 14:53:47,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:47,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:47,308 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 14:53:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:47,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191246525] [2024-01-27 14:53:47,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191246525] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:47,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:47,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:47,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160617862] [2024-01-27 14:53:47,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:47,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:47,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:47,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:47,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:47,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 102 [2024-01-27 14:53:47,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 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 14:53:47,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:47,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 102 [2024-01-27 14:53:47,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:47,428 INFO L124 PetriNetUnfolderBase]: 327/889 cut-off events. [2024-01-27 14:53:47,428 INFO L125 PetriNetUnfolderBase]: For 122/130 co-relation queries the response was YES. [2024-01-27 14:53:47,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 889 events. 327/889 cut-off events. For 122/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4919 event pairs, 63 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 1584. Up to 458 conditions per place. [2024-01-27 14:53:47,432 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 47 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-01-27 14:53:47,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 297 flow [2024-01-27 14:53:47,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2024-01-27 14:53:47,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2024-01-27 14:53:47,433 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 172 flow. Second operand 4 states and 280 transitions. [2024-01-27 14:53:47,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 297 flow [2024-01-27 14:53:47,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 81 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:47,435 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 172 flow [2024-01-27 14:53:47,436 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 14:53:47,436 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -26 predicate places. [2024-01-27 14:53:47,436 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 172 flow [2024-01-27 14:53:47,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 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 14:53:47,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:47,437 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] [2024-01-27 14:53:47,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 14:53:47,437 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 14:53:47,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash -595792375, now seen corresponding path program 1 times [2024-01-27 14:53:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:47,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018676748] [2024-01-27 14:53:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:47,483 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 14:53:47,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:47,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018676748] [2024-01-27 14:53:47,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018676748] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:47,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:47,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:47,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333608699] [2024-01-27 14:53:47,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:47,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:47,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:47,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:47,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:47,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-27 14:53:47,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 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 14:53:47,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:47,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-27 14:53:47,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:47,618 INFO L124 PetriNetUnfolderBase]: 221/602 cut-off events. [2024-01-27 14:53:47,619 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-01-27 14:53:47,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 602 events. 221/602 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3162 event pairs, 68 based on Foata normal form. 14/579 useless extension candidates. Maximal degree in co-relation 1114. Up to 149 conditions per place. [2024-01-27 14:53:47,622 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 54 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2024-01-27 14:53:47,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 90 transitions, 344 flow [2024-01-27 14:53:47,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2024-01-27 14:53:47,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7794117647058824 [2024-01-27 14:53:47,623 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 172 flow. Second operand 4 states and 318 transitions. [2024-01-27 14:53:47,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 90 transitions, 344 flow [2024-01-27 14:53:47,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 90 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:47,625 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 183 flow [2024-01-27 14:53:47,625 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 14:53:47,626 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -24 predicate places. [2024-01-27 14:53:47,626 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 183 flow [2024-01-27 14:53:47,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 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 14:53:47,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:47,627 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 14:53:47,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 14:53:47,627 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 14:53:47,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:47,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1586323528, now seen corresponding path program 1 times [2024-01-27 14:53:47,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:47,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459365033] [2024-01-27 14:53:47,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:47,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:47,699 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 14:53:47,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:47,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459365033] [2024-01-27 14:53:47,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459365033] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:47,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:47,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:47,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825423023] [2024-01-27 14:53:47,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:47,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:47,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:47,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:47,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:47,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 102 [2024-01-27 14:53:47,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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 14:53:47,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:47,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 102 [2024-01-27 14:53:47,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:47,818 INFO L124 PetriNetUnfolderBase]: 231/640 cut-off events. [2024-01-27 14:53:47,818 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2024-01-27 14:53:47,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 640 events. 231/640 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3468 event pairs, 91 based on Foata normal form. 20/614 useless extension candidates. Maximal degree in co-relation 1229. Up to 179 conditions per place. [2024-01-27 14:53:47,821 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 53 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-01-27 14:53:47,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 92 transitions, 361 flow [2024-01-27 14:53:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2024-01-27 14:53:47,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7965686274509803 [2024-01-27 14:53:47,822 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 183 flow. Second operand 4 states and 325 transitions. [2024-01-27 14:53:47,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 92 transitions, 361 flow [2024-01-27 14:53:47,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 92 transitions, 352 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:47,824 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 218 flow [2024-01-27 14:53:47,825 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 14:53:47,825 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-27 14:53:47,825 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 218 flow [2024-01-27 14:53:47,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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 14:53:47,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:47,825 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 14:53:47,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 14:53:47,826 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 14:53:47,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1490903074, now seen corresponding path program 1 times [2024-01-27 14:53:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:47,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755538880] [2024-01-27 14:53:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:47,894 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 14:53:47,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:47,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755538880] [2024-01-27 14:53:47,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755538880] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:47,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:47,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:47,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217333590] [2024-01-27 14:53:47,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:47,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:53:47,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:47,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:53:47,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:53:47,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 102 [2024-01-27 14:53:47,896 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 14:53:47,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:47,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 102 [2024-01-27 14:53:47,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:47,981 INFO L124 PetriNetUnfolderBase]: 116/492 cut-off events. [2024-01-27 14:53:47,981 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2024-01-27 14:53:47,982 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 2334 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 14:53:47,982 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 30 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2024-01-27 14:53:47,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 77 transitions, 302 flow [2024-01-27 14:53:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:53:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:53:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-01-27 14:53:47,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8398692810457516 [2024-01-27 14:53:47,984 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 218 flow. Second operand 3 states and 257 transitions. [2024-01-27 14:53:47,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 77 transitions, 302 flow [2024-01-27 14:53:47,985 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 14:53:47,985 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 214 flow [2024-01-27 14:53:47,985 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 14:53:47,986 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-27 14:53:47,986 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 214 flow [2024-01-27 14:53:47,986 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 14:53:47,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:47,986 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 14:53:47,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 14:53:47,986 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 14:53:47,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash -185742901, now seen corresponding path program 1 times [2024-01-27 14:53:47,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:47,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395047546] [2024-01-27 14:53:47,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:47,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:48,046 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 14:53:48,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:48,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395047546] [2024-01-27 14:53:48,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395047546] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:48,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:48,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:53:48,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397835093] [2024-01-27 14:53:48,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:48,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 14:53:48,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:48,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 14:53:48,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-27 14:53:48,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 102 [2024-01-27 14:53:48,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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 14:53:48,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:48,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 102 [2024-01-27 14:53:48,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:48,159 INFO L124 PetriNetUnfolderBase]: 120/453 cut-off events. [2024-01-27 14:53:48,159 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-01-27 14:53:48,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 453 events. 120/453 cut-off events. For 197/197 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 101 conditions per place. [2024-01-27 14:53:48,161 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 51 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2024-01-27 14:53:48,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 90 transitions, 392 flow [2024-01-27 14:53:48,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:53:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:53:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2024-01-27 14:53:48,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7607843137254902 [2024-01-27 14:53:48,163 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 214 flow. Second operand 5 states and 388 transitions. [2024-01-27 14:53:48,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 90 transitions, 392 flow [2024-01-27 14:53:48,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 366 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 14:53:48,165 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 206 flow [2024-01-27 14:53:48,165 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 14:53:48,166 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-27 14:53:48,166 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 206 flow [2024-01-27 14:53:48,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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 14:53:48,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:48,167 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] [2024-01-27 14:53:48,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 14:53:48,167 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-27 14:53:48,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:48,167 INFO L85 PathProgramCache]: Analyzing trace with hash -478832956, now seen corresponding path program 1 times [2024-01-27 14:53:48,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:48,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704199040] [2024-01-27 14:53:48,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:48,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:48,280 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 14:53:48,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704199040] [2024-01-27 14:53:48,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704199040] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:48,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:48,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:53:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62488309] [2024-01-27 14:53:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:48,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 14:53:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:48,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 14:53:48,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-27 14:53:48,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 102 [2024-01-27 14:53:48,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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 14:53:48,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:48,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 102 [2024-01-27 14:53:48,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:48,370 INFO L124 PetriNetUnfolderBase]: 116/433 cut-off events. [2024-01-27 14:53:48,370 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2024-01-27 14:53:48,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 433 events. 116/433 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1959 event pairs, 65 based on Foata normal form. 4/399 useless extension candidates. Maximal degree in co-relation 814. Up to 146 conditions per place. [2024-01-27 14:53:48,373 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 47 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2024-01-27 14:53:48,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 343 flow [2024-01-27 14:53:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:53:48,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:53:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2024-01-27 14:53:48,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7450980392156863 [2024-01-27 14:53:48,374 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 206 flow. Second operand 5 states and 380 transitions. [2024-01-27 14:53:48,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 343 flow [2024-01-27 14:53:48,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 324 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-01-27 14:53:48,377 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 191 flow [2024-01-27 14:53:48,377 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 14:53:48,378 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -22 predicate places. [2024-01-27 14:53:48,378 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 191 flow [2024-01-27 14:53:48,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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 14:53:48,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:53:48,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 14:53:48,379 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 14:53:48,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1529960877, now seen corresponding path program 1 times [2024-01-27 14:53:48,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:48,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361501943] [2024-01-27 14:53:48,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:48,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:53:48,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 14:53:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:53:48,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 14:53:48,456 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 14:53:48,457 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (60 of 61 remaining) [2024-01-27 14:53:48,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 61 remaining) [2024-01-27 14:53:48,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 61 remaining) [2024-01-27 14:53:48,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 61 remaining) [2024-01-27 14:53:48,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 61 remaining) [2024-01-27 14:53:48,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 61 remaining) [2024-01-27 14:53:48,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 61 remaining) [2024-01-27 14:53:48,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 61 remaining) [2024-01-27 14:53:48,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 61 remaining) [2024-01-27 14:53:48,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 61 remaining) [2024-01-27 14:53:48,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 61 remaining) [2024-01-27 14:53:48,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 61 remaining) [2024-01-27 14:53:48,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 61 remaining) [2024-01-27 14:53:48,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 61 remaining) [2024-01-27 14:53:48,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 61 remaining) [2024-01-27 14:53:48,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 61 remaining) [2024-01-27 14:53:48,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 61 remaining) [2024-01-27 14:53:48,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 61 remaining) [2024-01-27 14:53:48,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 61 remaining) [2024-01-27 14:53:48,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 61 remaining) [2024-01-27 14:53:48,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 61 remaining) [2024-01-27 14:53:48,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 61 remaining) [2024-01-27 14:53:48,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 61 remaining) [2024-01-27 14:53:48,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 61 remaining) [2024-01-27 14:53:48,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 61 remaining) [2024-01-27 14:53:48,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 61 remaining) [2024-01-27 14:53:48,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 61 remaining) [2024-01-27 14:53:48,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 61 remaining) [2024-01-27 14:53:48,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 61 remaining) [2024-01-27 14:53:48,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 61 remaining) [2024-01-27 14:53:48,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 61 remaining) [2024-01-27 14:53:48,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 61 remaining) [2024-01-27 14:53:48,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 61 remaining) [2024-01-27 14:53:48,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 61 remaining) [2024-01-27 14:53:48,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 61 remaining) [2024-01-27 14:53:48,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2024-01-27 14:53:48,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2024-01-27 14:53:48,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 61 remaining) [2024-01-27 14:53:48,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 61 remaining) [2024-01-27 14:53:48,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 61 remaining) [2024-01-27 14:53:48,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 61 remaining) [2024-01-27 14:53:48,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 61 remaining) [2024-01-27 14:53:48,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 61 remaining) [2024-01-27 14:53:48,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 61 remaining) [2024-01-27 14:53:48,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 61 remaining) [2024-01-27 14:53:48,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 61 remaining) [2024-01-27 14:53:48,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 61 remaining) [2024-01-27 14:53:48,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 61 remaining) [2024-01-27 14:53:48,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 61 remaining) [2024-01-27 14:53:48,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 61 remaining) [2024-01-27 14:53:48,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 61 remaining) [2024-01-27 14:53:48,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 61 remaining) [2024-01-27 14:53:48,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 61 remaining) [2024-01-27 14:53:48,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 61 remaining) [2024-01-27 14:53:48,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 61 remaining) [2024-01-27 14:53:48,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 61 remaining) [2024-01-27 14:53:48,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 61 remaining) [2024-01-27 14:53:48,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 61 remaining) [2024-01-27 14:53:48,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 61 remaining) [2024-01-27 14:53:48,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 61 remaining) [2024-01-27 14:53:48,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 61 remaining) [2024-01-27 14:53:48,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 14:53:48,468 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:53:48,474 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 14:53:48,474 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 14:53:48,533 INFO L503 ceAbstractionStarter]: Automizer considered 34 witness invariants [2024-01-27 14:53:48,536 INFO L504 ceAbstractionStarter]: WitnessConsidered=34 [2024-01-27 14:53:48,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 02:53:48 BasicIcfg [2024-01-27 14:53:48,537 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 14:53:48,538 INFO L158 Benchmark]: Toolchain (without parser) took 4724.45ms. Allocated memory was 146.8MB in the beginning and 241.2MB in the end (delta: 94.4MB). Free memory was 69.9MB in the beginning and 68.1MB in the end (delta: 1.8MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. [2024-01-27 14:53:48,538 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:53:48,538 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:53:48,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.56ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 69.6MB in the beginning and 144.0MB in the end (delta: -74.5MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-01-27 14:53:48,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.11ms. Allocated memory is still 186.6MB. Free memory was 144.0MB in the beginning and 141.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:53:48,539 INFO L158 Benchmark]: Boogie Preprocessor took 44.99ms. Allocated memory is still 186.6MB. Free memory was 141.9MB in the beginning and 139.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:53:48,539 INFO L158 Benchmark]: RCFGBuilder took 631.94ms. Allocated memory is still 186.6MB. Free memory was 139.9MB in the beginning and 105.2MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-01-27 14:53:48,539 INFO L158 Benchmark]: TraceAbstraction took 3421.45ms. Allocated memory was 186.6MB in the beginning and 241.2MB in the end (delta: 54.5MB). Free memory was 104.2MB in the beginning and 68.1MB in the end (delta: 36.1MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. [2024-01-27 14:53:48,540 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.56ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 69.6MB in the beginning and 144.0MB in the end (delta: -74.5MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.11ms. Allocated memory is still 186.6MB. Free memory was 144.0MB in the beginning and 141.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.99ms. Allocated memory is still 186.6MB. Free memory was 141.9MB in the beginning and 139.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 631.94ms. Allocated memory is still 186.6MB. Free memory was 139.9MB in the beginning and 105.2MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3421.45ms. Allocated memory was 186.6MB in the beginning and 241.2MB in the end (delta: 54.5MB). Free memory was 104.2MB in the beginning and 68.1MB in the end (delta: 36.1MB). Peak memory consumption was 90.6MB. 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[data2],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[data1],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[data2],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[data1],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[data2],IntegerLiteral[0]]]] VAL [data1=10, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L720] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[10]]]] [L720] 0 data2 = 10 VAL [data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L721] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[10]]]] 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]]]] [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[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}] [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}] [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[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}] [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}] [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}] [L710] 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]]]] [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[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}] [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[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}] [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: 3.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 831 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 564 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1196 IncrementalHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 67 mSDtfsCounter, 1196 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.7s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 662 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 14:53:48,582 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