./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 27552612 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-2755261-m [2024-01-26 15:10:17,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 15:10:17,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-26 15:10:17,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 15:10:17,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 15:10:18,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 15:10:18,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 15:10:18,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 15:10:18,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-26 15:10:18,005 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-26 15:10:18,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 15:10:18,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 15:10:18,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 15:10:18,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 15:10:18,007 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 15:10:18,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 15:10:18,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 15:10:18,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 15:10:18,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 15:10:18,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 15:10:18,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 15:10:18,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 15:10:18,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 15:10:18,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 15:10:18,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-26 15:10:18,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 15:10:18,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 15:10:18,010 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 15:10:18,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 15:10:18,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 15:10:18,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-26 15:10:18,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 15:10:18,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-26 15:10:18,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 15:10:18,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 15:10:18,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-26 15:10:18,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 15:10:18,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 15:10:18,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 15:10:18,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-26 15:10:18,014 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 15:10:18,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-26 15:10:18,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-26 15:10:18,014 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-26 15:10:18,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 15:10:18,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 15:10:18,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 15:10:18,233 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-26 15:10:18,233 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-26 15:10:18,234 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-26 15:10:18,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 15:10:18,337 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 15:10:18,338 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-26 15:10:19,370 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 15:10:19,659 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 15:10:19,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i [2024-01-26 15:10:19,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c44f1f0/c097dc31fab646c0b30b2be03c2ffbc9/FLAGe9b8cc373 [2024-01-26 15:10:19,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c44f1f0/c097dc31fab646c0b30b2be03c2ffbc9 [2024-01-26 15:10:19,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 15:10:19,690 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 15:10:19,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 15:10:19,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 15:10:19,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 15:10:19,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.01 03:10:18" (1/2) ... [2024-01-26 15:10:19,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1573cbb3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 26.01 03:10:19, skipping insertion in model container [2024-01-26 15:10:19,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.01 03:10:18" (1/2) ... [2024-01-26 15:10:19,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3ae2632f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 26.01 03:10:19, skipping insertion in model container [2024-01-26 15:10:19,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 03:10:19" (2/2) ... [2024-01-26 15:10:19,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1573cbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:19, skipping insertion in model container [2024-01-26 15:10:19,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 03:10:19" (2/2) ... [2024-01-26 15:10:19,699 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-26 15:10:19,731 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-26 15:10:19,733 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] data2 == 0 [2024-01-26 15:10:19,733 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] data1 == 0 [2024-01-26 15:10:19,733 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] 10 <= data1 [2024-01-26 15:10:19,733 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] (unsigned long )arg == 0UL [2024-01-26 15:10:19,733 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L712] (unsigned long )arg == 0UL [2024-01-26 15:10:19,733 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] 11 <= data1 [2024-01-26 15:10:19,734 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] (unsigned long )arg == 0UL [2024-01-26 15:10:19,734 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] data1 == 0 [2024-01-26 15:10:19,734 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] data2 == 0 [2024-01-26 15:10:19,734 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] 10 <= data1 [2024-01-26 15:10:19,734 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] (unsigned long )arg == 0UL [2024-01-26 15:10:19,734 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] (unsigned long )arg == 0UL [2024-01-26 15:10:19,734 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] data2 == 0 [2024-01-26 15:10:19,734 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] data1 == 10 [2024-01-26 15:10:19,735 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] (unsigned long )arg == 0UL [2024-01-26 15:10:19,735 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] 10 <= data1 [2024-01-26 15:10:19,735 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] data2 <= 2147483641 [2024-01-26 15:10:19,735 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (unsigned long )arg == 0UL [2024-01-26 15:10:19,735 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] 10 <= data1 [2024-01-26 15:10:19,735 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (unsigned long )arg == 0UL [2024-01-26 15:10:19,735 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] (unsigned long )arg == 0UL [2024-01-26 15:10:19,736 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] 15 <= data1 [2024-01-26 15:10:19,736 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (unsigned long )arg == 0UL [2024-01-26 15:10:19,736 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] (unsigned long )arg == 0UL [2024-01-26 15:10:19,736 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] 10 <= data1 [2024-01-26 15:10:19,736 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] (unsigned long )arg == 0UL [2024-01-26 15:10:19,736 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] data1 == 0 [2024-01-26 15:10:19,737 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] data2 == 0 [2024-01-26 15:10:19,737 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (unsigned long )arg == 0UL [2024-01-26 15:10:19,737 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (unsigned long )arg == 0UL [2024-01-26 15:10:19,737 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] -2147483647 <= data2 [2024-01-26 15:10:19,737 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] 10 <= data1 [2024-01-26 15:10:19,737 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] data1 == 10 [2024-01-26 15:10:19,737 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] data2 == 10 [2024-01-26 15:10:19,770 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 15:10:20,018 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-26 15:10:20,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 15:10:20,040 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-26 15:10:20,114 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-26 15:10:20,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 15:10:20,146 INFO L206 MainTranslator]: Completed translation [2024-01-26 15:10:20,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20 WrapperNode [2024-01-26 15:10:20,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 15:10:20,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 15:10:20,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 15:10:20,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 15:10:20,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (1/1) ... [2024-01-26 15:10:20,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (1/1) ... [2024-01-26 15:10:20,181 INFO L138 Inliner]: procedures = 169, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2024-01-26 15:10:20,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 15:10:20,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 15:10:20,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 15:10:20,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 15:10:20,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (1/1) ... [2024-01-26 15:10:20,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (1/1) ... [2024-01-26 15:10:20,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (1/1) ... [2024-01-26 15:10:20,209 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-26 15:10:20,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (1/1) ... [2024-01-26 15:10:20,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (1/1) ... [2024-01-26 15:10:20,218 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (1/1) ... [2024-01-26 15:10:20,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (1/1) ... [2024-01-26 15:10:20,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (1/1) ... [2024-01-26 15:10:20,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (1/1) ... [2024-01-26 15:10:20,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 15:10:20,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 15:10:20,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 15:10:20,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 15:10:20,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (1/1) ... [2024-01-26 15:10:20,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-26 15:10:20,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-26 15:10:20,248 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-26 15:10:20,263 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-26 15:10:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-26 15:10:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-26 15:10:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-26 15:10:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-26 15:10:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-26 15:10:20,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 15:10:20,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 15:10:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 15:10:20,276 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 15:10:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-26 15:10:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-26 15:10:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-26 15:10:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-26 15:10:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-26 15:10:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-26 15:10:20,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 15:10:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 15:10:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 15:10:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-26 15:10:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-26 15:10:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-26 15:10:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-26 15:10:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-26 15:10:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-26 15:10:20,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 15:10:20,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 15:10:20,279 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 15:10:20,442 INFO L244 CfgBuilder]: Building ICFG [2024-01-26 15:10:20,444 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 15:10:20,730 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-26 15:10:20,730 INFO L293 CfgBuilder]: Performing block encoding [2024-01-26 15:10:20,846 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 15:10:20,846 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-26 15:10:20,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 03:10:20 BoogieIcfgContainer [2024-01-26 15:10:20,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 15:10:20,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 15:10:20,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 15:10:20,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 15:10:20,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.01 03:10:18" (1/4) ... [2024-01-26 15:10:20,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c114e33 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 26.01 03:10:20, skipping insertion in model container [2024-01-26 15:10:20,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 03:10:19" (2/4) ... [2024-01-26 15:10:20,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c114e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 03:10:20, skipping insertion in model container [2024-01-26 15:10:20,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:10:20" (3/4) ... [2024-01-26 15:10:20,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c114e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 03:10:20, skipping insertion in model container [2024-01-26 15:10:20,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 03:10:20" (4/4) ... [2024-01-26 15:10:20,860 INFO L112 eAbstractionObserver]: Analyzing ICFG stateful01-1.i [2024-01-26 15:10:20,874 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 15:10:20,874 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-01-26 15:10:20,874 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 15:10:20,950 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-26 15:10:20,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 102 transitions, 218 flow [2024-01-26 15:10:21,025 INFO L124 PetriNetUnfolderBase]: 1/100 cut-off events. [2024-01-26 15:10:21,026 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-26 15:10:21,028 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-26 15:10:21,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 102 transitions, 218 flow [2024-01-26 15:10:21,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 97 transitions, 206 flow [2024-01-26 15:10:21,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-26 15:10:21,051 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;@257774d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 15:10:21,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-01-26 15:10:21,053 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-26 15:10:21,053 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-26 15:10:21,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-26 15:10:21,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:21,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-26 15:10:21,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:21,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash 9952, now seen corresponding path program 1 times [2024-01-26 15:10:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938341208] [2024-01-26 15:10:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:21,271 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-26 15:10:21,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:21,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938341208] [2024-01-26 15:10:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938341208] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:10:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059965695] [2024-01-26 15:10:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:21,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:10:21,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:21,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:10:21,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:10:21,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2024-01-26 15:10:21,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 97 transitions, 206 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-26 15:10:21,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:21,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2024-01-26 15:10:21,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:21,463 INFO L124 PetriNetUnfolderBase]: 240/709 cut-off events. [2024-01-26 15:10:21,463 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-26 15:10:21,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 709 events. 240/709 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4335 event pairs, 240 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 1074. Up to 444 conditions per place. [2024-01-26 15:10:21,470 INFO L140 encePairwiseOnDemand]: 96/102 looper letters, 31 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-26 15:10:21,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 93 transitions, 264 flow [2024-01-26 15:10:21,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:10:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:10:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2024-01-26 15:10:21,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.738562091503268 [2024-01-26 15:10:21,482 INFO L175 Difference]: Start difference. First operand has 104 places, 97 transitions, 206 flow. Second operand 3 states and 226 transitions. [2024-01-26 15:10:21,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 93 transitions, 264 flow [2024-01-26 15:10:21,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 256 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-26 15:10:21,488 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 194 flow [2024-01-26 15:10:21,490 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-26 15:10:21,492 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -6 predicate places. [2024-01-26 15:10:21,493 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 194 flow [2024-01-26 15:10:21,493 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-26 15:10:21,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:21,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-26 15:10:21,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 15:10:21,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:21,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash 308815, now seen corresponding path program 1 times [2024-01-26 15:10:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414563952] [2024-01-26 15:10:21,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:21,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:21,524 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-26 15:10:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414563952] [2024-01-26 15:10:21,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414563952] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:21,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:21,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:10:21,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370135276] [2024-01-26 15:10:21,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:21,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:10:21,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:10:21,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:10:21,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2024-01-26 15:10:21,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 194 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-26 15:10:21,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:21,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2024-01-26 15:10:21,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:21,733 INFO L124 PetriNetUnfolderBase]: 327/1109 cut-off events. [2024-01-26 15:10:21,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-26 15:10:21,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1725 conditions, 1109 events. 327/1109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7348 event pairs, 327 based on Foata normal form. 0/930 useless extension candidates. Maximal degree in co-relation 1703. Up to 596 conditions per place. [2024-01-26 15:10:21,742 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 33 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-01-26 15:10:21,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 90 transitions, 258 flow [2024-01-26 15:10:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:10:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:10:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-01-26 15:10:21,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7320261437908496 [2024-01-26 15:10:21,748 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 194 flow. Second operand 3 states and 224 transitions. [2024-01-26 15:10:21,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 90 transitions, 258 flow [2024-01-26 15:10:21,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 90 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:10:21,751 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 188 flow [2024-01-26 15:10:21,752 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-26 15:10:21,752 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2024-01-26 15:10:21,753 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 188 flow [2024-01-26 15:10:21,753 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-26 15:10:21,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:21,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:10:21,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 15:10:21,753 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:21,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:21,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1884864004, now seen corresponding path program 1 times [2024-01-26 15:10:21,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:21,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766607608] [2024-01-26 15:10:21,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:21,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:21,820 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-26 15:10:21,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:21,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766607608] [2024-01-26 15:10:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766607608] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:21,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:21,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 15:10:21,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938603957] [2024-01-26 15:10:21,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:21,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:10:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:21,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:10:21,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:10:21,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 102 [2024-01-26 15:10:21,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-26 15:10:21,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:21,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 102 [2024-01-26 15:10:21,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:21,940 INFO L124 PetriNetUnfolderBase]: 412/1186 cut-off events. [2024-01-26 15:10:21,941 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-26 15:10:21,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 1186 events. 412/1186 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7877 event pairs, 203 based on Foata normal form. 5/951 useless extension candidates. Maximal degree in co-relation 1932. Up to 724 conditions per place. [2024-01-26 15:10:21,946 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 42 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2024-01-26 15:10:21,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 95 transitions, 289 flow [2024-01-26 15:10:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:10:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:10:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2024-01-26 15:10:21,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7483660130718954 [2024-01-26 15:10:21,948 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 188 flow. Second operand 3 states and 229 transitions. [2024-01-26 15:10:21,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 95 transitions, 289 flow [2024-01-26 15:10:21,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 285 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:10:21,950 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 201 flow [2024-01-26 15:10:21,950 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-26 15:10:21,951 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -10 predicate places. [2024-01-26 15:10:21,951 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 201 flow [2024-01-26 15:10:21,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-26 15:10:21,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:21,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:10:21,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-26 15:10:21,952 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:21,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:21,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1121901276, now seen corresponding path program 1 times [2024-01-26 15:10:21,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:21,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375760197] [2024-01-26 15:10:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:21,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:21,975 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-26 15:10:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:21,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375760197] [2024-01-26 15:10:21,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375760197] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:21,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:21,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 15:10:21,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098496345] [2024-01-26 15:10:21,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:21,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:10:21,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:21,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:10:21,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:10:21,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 102 [2024-01-26 15:10:21,990 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.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-26 15:10:21,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:21,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 102 [2024-01-26 15:10:21,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:22,098 INFO L124 PetriNetUnfolderBase]: 240/783 cut-off events. [2024-01-26 15:10:22,098 INFO L125 PetriNetUnfolderBase]: For 44/66 co-relation queries the response was YES. [2024-01-26 15:10:22,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 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 4758 event pairs, 90 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 979. Up to 323 conditions per place. [2024-01-26 15:10:22,103 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 45 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2024-01-26 15:10:22,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 102 transitions, 326 flow [2024-01-26 15:10:22,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:10:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:10:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2024-01-26 15:10:22,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8006535947712419 [2024-01-26 15:10:22,104 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 201 flow. Second operand 3 states and 245 transitions. [2024-01-26 15:10:22,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 102 transitions, 326 flow [2024-01-26 15:10:22,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 102 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-26 15:10:22,106 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 213 flow [2024-01-26 15:10:22,106 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-26 15:10:22,107 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2024-01-26 15:10:22,107 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 213 flow [2024-01-26 15:10:22,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-26 15:10:22,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:22,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:10:22,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-26 15:10:22,108 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:22,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1332084932, now seen corresponding path program 1 times [2024-01-26 15:10:22,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:22,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916543007] [2024-01-26 15:10:22,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:22,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:22,192 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-26 15:10:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:22,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916543007] [2024-01-26 15:10:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916543007] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:22,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:22,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 15:10:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030433853] [2024-01-26 15:10:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:22,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-26 15:10:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:22,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-26 15:10:22,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-26 15:10:22,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-26 15:10:22,208 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-26 15:10:22,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:22,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-26 15:10:22,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:22,316 INFO L124 PetriNetUnfolderBase]: 213/865 cut-off events. [2024-01-26 15:10:22,316 INFO L125 PetriNetUnfolderBase]: For 83/93 co-relation queries the response was YES. [2024-01-26 15:10:22,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 865 events. 213/865 cut-off events. For 83/93 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5528 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-26 15:10:22,320 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 40 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-26 15:10:22,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 309 flow [2024-01-26 15:10:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 15:10:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-26 15:10:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 305 transitions. [2024-01-26 15:10:22,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7475490196078431 [2024-01-26 15:10:22,321 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 213 flow. Second operand 4 states and 305 transitions. [2024-01-26 15:10:22,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 309 flow [2024-01-26 15:10:22,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 94 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-26 15:10:22,323 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 200 flow [2024-01-26 15:10:22,323 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-26 15:10:22,324 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -14 predicate places. [2024-01-26 15:10:22,324 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 200 flow [2024-01-26 15:10:22,324 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-26 15:10:22,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:22,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:10:22,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-26 15:10:22,325 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:22,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash -234538837, now seen corresponding path program 1 times [2024-01-26 15:10:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:22,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835575832] [2024-01-26 15:10:22,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:22,385 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-26 15:10:22,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:22,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835575832] [2024-01-26 15:10:22,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835575832] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:22,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:22,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 15:10:22,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336474598] [2024-01-26 15:10:22,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:22,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-26 15:10:22,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:22,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-26 15:10:22,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-26 15:10:22,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 102 [2024-01-26 15:10:22,414 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-26 15:10:22,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:22,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 102 [2024-01-26 15:10:22,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:22,505 INFO L124 PetriNetUnfolderBase]: 213/654 cut-off events. [2024-01-26 15:10:22,505 INFO L125 PetriNetUnfolderBase]: For 74/90 co-relation queries the response was YES. [2024-01-26 15:10:22,506 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 33. Compared 3809 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-26 15:10:22,508 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 47 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-26 15:10:22,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 94 transitions, 327 flow [2024-01-26 15:10:22,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 15:10:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-26 15:10:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 312 transitions. [2024-01-26 15:10:22,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2024-01-26 15:10:22,509 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 200 flow. Second operand 4 states and 312 transitions. [2024-01-26 15:10:22,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 94 transitions, 327 flow [2024-01-26 15:10:22,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 94 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:10:22,511 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 187 flow [2024-01-26 15:10:22,511 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-26 15:10:22,512 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-26 15:10:22,512 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 187 flow [2024-01-26 15:10:22,512 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-26 15:10:22,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:22,513 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-26 15:10:22,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-26 15:10:22,513 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:22,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:22,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2070598463, now seen corresponding path program 1 times [2024-01-26 15:10:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:22,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17751225] [2024-01-26 15:10:22,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:22,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:22,547 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-26 15:10:22,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:22,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17751225] [2024-01-26 15:10:22,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17751225] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:22,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:22,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 15:10:22,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023515074] [2024-01-26 15:10:22,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:22,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-26 15:10:22,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:22,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-26 15:10:22,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-26 15:10:22,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 102 [2024-01-26 15:10:22,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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-26 15:10:22,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:22,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 102 [2024-01-26 15:10:22,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:22,652 INFO L124 PetriNetUnfolderBase]: 327/897 cut-off events. [2024-01-26 15:10:22,652 INFO L125 PetriNetUnfolderBase]: For 110/118 co-relation queries the response was YES. [2024-01-26 15:10:22,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 897 events. 327/897 cut-off events. For 110/118 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5117 event pairs, 133 based on Foata normal form. 62/901 useless extension candidates. Maximal degree in co-relation 1591. Up to 560 conditions per place. [2024-01-26 15:10:22,656 INFO L140 encePairwiseOnDemand]: 92/102 looper letters, 42 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2024-01-26 15:10:22,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 274 flow [2024-01-26 15:10:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 15:10:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-26 15:10:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2024-01-26 15:10:22,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6715686274509803 [2024-01-26 15:10:22,657 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 187 flow. Second operand 4 states and 274 transitions. [2024-01-26 15:10:22,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 274 flow [2024-01-26 15:10:22,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:10:22,659 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 172 flow [2024-01-26 15:10:22,659 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-26 15:10:22,660 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -26 predicate places. [2024-01-26 15:10:22,660 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 172 flow [2024-01-26 15:10:22,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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-26 15:10:22,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:22,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:10:22,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-26 15:10:22,661 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:22,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:22,661 INFO L85 PathProgramCache]: Analyzing trace with hash 922078032, now seen corresponding path program 1 times [2024-01-26 15:10:22,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:22,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277721755] [2024-01-26 15:10:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:22,696 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-26 15:10:22,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:22,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277721755] [2024-01-26 15:10:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277721755] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:22,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:22,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 15:10:22,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018230765] [2024-01-26 15:10:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:22,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-26 15:10:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:22,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-26 15:10:22,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-26 15:10:22,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2024-01-26 15:10:22,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 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-26 15:10:22,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:22,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2024-01-26 15:10:22,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:22,821 INFO L124 PetriNetUnfolderBase]: 327/889 cut-off events. [2024-01-26 15:10:22,822 INFO L125 PetriNetUnfolderBase]: For 121/129 co-relation queries the response was YES. [2024-01-26 15:10:22,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 889 events. 327/889 cut-off events. For 121/129 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4911 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-26 15:10:22,826 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 48 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-01-26 15:10:22,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 299 flow [2024-01-26 15:10:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 15:10:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-26 15:10:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2024-01-26 15:10:22,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.678921568627451 [2024-01-26 15:10:22,827 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 172 flow. Second operand 4 states and 277 transitions. [2024-01-26 15:10:22,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 299 flow [2024-01-26 15:10:22,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 81 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:10:22,830 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 172 flow [2024-01-26 15:10:22,830 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-26 15:10:22,832 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -26 predicate places. [2024-01-26 15:10:22,833 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 172 flow [2024-01-26 15:10:22,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 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-26 15:10:22,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:22,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:10:22,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-26 15:10:22,836 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:22,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:22,836 INFO L85 PathProgramCache]: Analyzing trace with hash 257875542, now seen corresponding path program 1 times [2024-01-26 15:10:22,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:22,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918075005] [2024-01-26 15:10:22,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:22,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:22,900 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-26 15:10:22,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:22,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918075005] [2024-01-26 15:10:22,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918075005] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:22,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:22,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 15:10:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532331885] [2024-01-26 15:10:22,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:22,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-26 15:10:22,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:22,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-26 15:10:22,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-26 15:10:22,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 102 [2024-01-26 15:10:22,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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-26 15:10:22,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:22,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 102 [2024-01-26 15:10:22,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:23,004 INFO L124 PetriNetUnfolderBase]: 221/602 cut-off events. [2024-01-26 15:10:23,005 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-01-26 15:10:23,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 602 events. 221/602 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3177 event pairs, 68 based on Foata normal form. 14/579 useless extension candidates. Maximal degree in co-relation 1114. Up to 148 conditions per place. [2024-01-26 15:10:23,007 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 53 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2024-01-26 15:10:23,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 90 transitions, 342 flow [2024-01-26 15:10:23,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 15:10:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-26 15:10:23,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 321 transitions. [2024-01-26 15:10:23,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7867647058823529 [2024-01-26 15:10:23,009 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 172 flow. Second operand 4 states and 321 transitions. [2024-01-26 15:10:23,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 90 transitions, 342 flow [2024-01-26 15:10:23,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 90 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:10:23,011 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 183 flow [2024-01-26 15:10:23,011 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-26 15:10:23,013 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -24 predicate places. [2024-01-26 15:10:23,013 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 183 flow [2024-01-26 15:10:23,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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-26 15:10:23,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:23,013 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-26 15:10:23,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-26 15:10:23,014 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:23,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1852287030, now seen corresponding path program 1 times [2024-01-26 15:10:23,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:23,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765707291] [2024-01-26 15:10:23,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:23,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:23,085 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-26 15:10:23,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:23,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765707291] [2024-01-26 15:10:23,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765707291] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:23,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:23,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 15:10:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453861904] [2024-01-26 15:10:23,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:23,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-26 15:10:23,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:23,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-26 15:10:23,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-26 15:10:23,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 102 [2024-01-26 15:10:23,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 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-26 15:10:23,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:23,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 102 [2024-01-26 15:10:23,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:23,195 INFO L124 PetriNetUnfolderBase]: 231/640 cut-off events. [2024-01-26 15:10:23,195 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-01-26 15:10:23,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 640 events. 231/640 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3425 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-26 15:10:23,198 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 52 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-01-26 15:10:23,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 92 transitions, 359 flow [2024-01-26 15:10:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 15:10:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-26 15:10:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 328 transitions. [2024-01-26 15:10:23,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2024-01-26 15:10:23,200 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 183 flow. Second operand 4 states and 328 transitions. [2024-01-26 15:10:23,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 92 transitions, 359 flow [2024-01-26 15:10:23,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 92 transitions, 350 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-26 15:10:23,202 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 218 flow [2024-01-26 15:10:23,202 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-26 15:10:23,203 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-26 15:10:23,203 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 218 flow [2024-01-26 15:10:23,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 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-26 15:10:23,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:23,203 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] [2024-01-26 15:10:23,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-26 15:10:23,204 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:23,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2030116320, now seen corresponding path program 1 times [2024-01-26 15:10:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628587867] [2024-01-26 15:10:23,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:23,266 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-26 15:10:23,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:23,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628587867] [2024-01-26 15:10:23,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628587867] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:23,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:23,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 15:10:23,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965773961] [2024-01-26 15:10:23,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:23,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:10:23,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:23,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:10:23,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:10:23,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 102 [2024-01-26 15:10:23,268 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-26 15:10:23,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:23,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 102 [2024-01-26 15:10:23,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:23,332 INFO L124 PetriNetUnfolderBase]: 116/492 cut-off events. [2024-01-26 15:10:23,332 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2024-01-26 15:10:23,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 492 events. 116/492 cut-off events. For 164/164 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-26 15:10:23,335 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 30 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2024-01-26 15:10:23,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 77 transitions, 302 flow [2024-01-26 15:10:23,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:10:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:10:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-01-26 15:10:23,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8398692810457516 [2024-01-26 15:10:23,336 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 218 flow. Second operand 3 states and 257 transitions. [2024-01-26 15:10:23,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 77 transitions, 302 flow [2024-01-26 15:10:23,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 77 transitions, 290 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-26 15:10:23,338 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 214 flow [2024-01-26 15:10:23,338 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-26 15:10:23,339 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-26 15:10:23,339 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 214 flow [2024-01-26 15:10:23,339 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-26 15:10:23,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:23,340 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] [2024-01-26 15:10:23,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-26 15:10:23,340 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:23,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash -144539053, now seen corresponding path program 1 times [2024-01-26 15:10:23,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:23,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155999269] [2024-01-26 15:10:23,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:23,412 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-26 15:10:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155999269] [2024-01-26 15:10:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155999269] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:23,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:23,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-26 15:10:23,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067046879] [2024-01-26 15:10:23,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:23,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-26 15:10:23,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:23,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-26 15:10:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-26 15:10:23,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 102 [2024-01-26 15:10:23,439 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.8) internal successors, (359), 5 states have internal predecessors, (359), 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-26 15:10:23,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:23,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 102 [2024-01-26 15:10:23,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:23,513 INFO L124 PetriNetUnfolderBase]: 120/453 cut-off events. [2024-01-26 15:10:23,513 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-01-26 15:10:23,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 453 events. 120/453 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2036 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-26 15:10:23,515 INFO L140 encePairwiseOnDemand]: 95/102 looper letters, 50 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2024-01-26 15:10:23,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 90 transitions, 390 flow [2024-01-26 15:10:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-26 15:10:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-26 15:10:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 392 transitions. [2024-01-26 15:10:23,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7686274509803922 [2024-01-26 15:10:23,517 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 214 flow. Second operand 5 states and 392 transitions. [2024-01-26 15:10:23,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 90 transitions, 390 flow [2024-01-26 15:10:23,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 364 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-26 15:10:23,519 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 206 flow [2024-01-26 15:10:23,519 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-26 15:10:23,519 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2024-01-26 15:10:23,520 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 206 flow [2024-01-26 15:10:23,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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-26 15:10:23,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:23,520 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-26 15:10:23,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-26 15:10:23,520 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:23,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:23,521 INFO L85 PathProgramCache]: Analyzing trace with hash 815837755, now seen corresponding path program 1 times [2024-01-26 15:10:23,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:23,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056549729] [2024-01-26 15:10:23,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:23,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:10:23,576 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-26 15:10:23,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:10:23,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056549729] [2024-01-26 15:10:23,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056549729] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:10:23,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:10:23,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-26 15:10:23,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675559960] [2024-01-26 15:10:23,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:10:23,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-26 15:10:23,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:10:23,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-26 15:10:23,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-26 15:10:23,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 102 [2024-01-26 15:10:23,603 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.8) internal successors, (359), 5 states have internal predecessors, (359), 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-26 15:10:23,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:10:23,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 102 [2024-01-26 15:10:23,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:10:23,671 INFO L124 PetriNetUnfolderBase]: 116/433 cut-off events. [2024-01-26 15:10:23,671 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2024-01-26 15:10:23,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 433 events. 116/433 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1964 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-26 15:10:23,674 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 46 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2024-01-26 15:10:23,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 341 flow [2024-01-26 15:10:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-26 15:10:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-26 15:10:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2024-01-26 15:10:23,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7529411764705882 [2024-01-26 15:10:23,675 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 206 flow. Second operand 5 states and 384 transitions. [2024-01-26 15:10:23,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 341 flow [2024-01-26 15:10:23,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 322 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-01-26 15:10:23,677 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 191 flow [2024-01-26 15:10:23,677 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-26 15:10:23,677 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -22 predicate places. [2024-01-26 15:10:23,678 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 191 flow [2024-01-26 15:10:23,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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-26 15:10:23,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:10:23,678 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-26 15:10:23,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-26 15:10:23,679 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-26 15:10:23,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:10:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1403162609, now seen corresponding path program 1 times [2024-01-26 15:10:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:10:23,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067464057] [2024-01-26 15:10:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:10:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:10:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 15:10:23,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-26 15:10:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 15:10:23,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-26 15:10:23,731 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-26 15:10:23,732 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (60 of 61 remaining) [2024-01-26 15:10:23,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 61 remaining) [2024-01-26 15:10:23,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 61 remaining) [2024-01-26 15:10:23,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 61 remaining) [2024-01-26 15:10:23,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 61 remaining) [2024-01-26 15:10:23,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 61 remaining) [2024-01-26 15:10:23,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 61 remaining) [2024-01-26 15:10:23,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 61 remaining) [2024-01-26 15:10:23,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 61 remaining) [2024-01-26 15:10:23,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 61 remaining) [2024-01-26 15:10:23,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 61 remaining) [2024-01-26 15:10:23,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 61 remaining) [2024-01-26 15:10:23,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 61 remaining) [2024-01-26 15:10:23,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 61 remaining) [2024-01-26 15:10:23,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 61 remaining) [2024-01-26 15:10:23,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 61 remaining) [2024-01-26 15:10:23,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 61 remaining) [2024-01-26 15:10:23,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 61 remaining) [2024-01-26 15:10:23,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 61 remaining) [2024-01-26 15:10:23,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 61 remaining) [2024-01-26 15:10:23,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 61 remaining) [2024-01-26 15:10:23,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 61 remaining) [2024-01-26 15:10:23,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 61 remaining) [2024-01-26 15:10:23,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 61 remaining) [2024-01-26 15:10:23,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 61 remaining) [2024-01-26 15:10:23,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 61 remaining) [2024-01-26 15:10:23,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 61 remaining) [2024-01-26 15:10:23,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 61 remaining) [2024-01-26 15:10:23,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 61 remaining) [2024-01-26 15:10:23,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 61 remaining) [2024-01-26 15:10:23,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 61 remaining) [2024-01-26 15:10:23,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 61 remaining) [2024-01-26 15:10:23,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 61 remaining) [2024-01-26 15:10:23,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 61 remaining) [2024-01-26 15:10:23,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 61 remaining) [2024-01-26 15:10:23,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2024-01-26 15:10:23,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2024-01-26 15:10:23,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 61 remaining) [2024-01-26 15:10:23,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 61 remaining) [2024-01-26 15:10:23,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 61 remaining) [2024-01-26 15:10:23,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 61 remaining) [2024-01-26 15:10:23,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 61 remaining) [2024-01-26 15:10:23,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 61 remaining) [2024-01-26 15:10:23,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 61 remaining) [2024-01-26 15:10:23,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 61 remaining) [2024-01-26 15:10:23,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 61 remaining) [2024-01-26 15:10:23,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 61 remaining) [2024-01-26 15:10:23,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 61 remaining) [2024-01-26 15:10:23,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 61 remaining) [2024-01-26 15:10:23,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 61 remaining) [2024-01-26 15:10:23,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 61 remaining) [2024-01-26 15:10:23,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 61 remaining) [2024-01-26 15:10:23,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 61 remaining) [2024-01-26 15:10:23,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 61 remaining) [2024-01-26 15:10:23,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 61 remaining) [2024-01-26 15:10:23,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 61 remaining) [2024-01-26 15:10:23,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 61 remaining) [2024-01-26 15:10:23,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 61 remaining) [2024-01-26 15:10:23,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 61 remaining) [2024-01-26 15:10:23,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 61 remaining) [2024-01-26 15:10:23,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 61 remaining) [2024-01-26 15:10:23,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-26 15:10:23,743 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:10:23,748 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 15:10:23,748 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 15:10:23,786 INFO L503 ceAbstractionStarter]: Automizer considered 34 witness invariants [2024-01-26 15:10:23,787 INFO L504 ceAbstractionStarter]: WitnessConsidered=34 [2024-01-26 15:10:23,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 03:10:23 BasicIcfg [2024-01-26 15:10:23,787 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 15:10:23,788 INFO L158 Benchmark]: Toolchain (without parser) took 4097.81ms. Allocated memory was 161.5MB in the beginning and 241.2MB in the end (delta: 79.7MB). Free memory was 130.5MB in the beginning and 81.9MB in the end (delta: 48.6MB). Peak memory consumption was 130.1MB. Max. memory is 16.1GB. [2024-01-26 15:10:23,788 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 98.6MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-26 15:10:23,788 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 161.5MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-26 15:10:23,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.72ms. Allocated memory is still 161.5MB. Free memory was 130.5MB in the beginning and 105.5MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-26 15:10:23,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.43ms. Allocated memory is still 161.5MB. Free memory was 105.5MB in the beginning and 103.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-26 15:10:23,789 INFO L158 Benchmark]: Boogie Preprocessor took 40.44ms. Allocated memory is still 161.5MB. Free memory was 103.4MB in the beginning and 100.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-26 15:10:23,789 INFO L158 Benchmark]: RCFGBuilder took 623.03ms. Allocated memory is still 161.5MB. Free memory was 100.9MB in the beginning and 67.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-01-26 15:10:23,789 INFO L158 Benchmark]: TraceAbstraction took 2936.97ms. Allocated memory was 161.5MB in the beginning and 241.2MB in the end (delta: 79.7MB). Free memory was 66.8MB in the beginning and 81.9MB in the end (delta: -15.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2024-01-26 15:10:23,790 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.15ms. Allocated memory is still 98.6MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 161.5MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.72ms. Allocated memory is still 161.5MB. Free memory was 130.5MB in the beginning and 105.5MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.43ms. Allocated memory is still 161.5MB. Free memory was 105.5MB in the beginning and 103.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.44ms. Allocated memory is still 161.5MB. Free memory was 103.4MB in the beginning and 100.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 623.03ms. Allocated memory is still 161.5MB. Free memory was 100.9MB in the beginning and 67.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2936.97ms. Allocated memory was 161.5MB in the beginning and 241.2MB in the end (delta: 79.7MB). Free memory was 66.8MB in the beginning and 81.9MB in the end (delta: -15.1MB). Peak memory consumption was 65.1MB. 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[data1],IntegerLiteral[10]]]] VAL [data1=10, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L720] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]] [L720] 0 data2 = 10 VAL [data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L721] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[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[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[data2]]]] VAL [arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L701] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L702] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L702] 1 return 0; [L722] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L706] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L707] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=11, data2=11, ma={3:0}, mb={4:0}] [L707] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]]] [L707] 2 data1+=5 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L708] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L708] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[15],IdentifierExpression[data1]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L709] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L723] 0 \read(t1) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L723] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L724] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L710] 2 CodeAnnotStmt[Assertion[BinaryExpression[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[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[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}] [L711] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L712] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L712] 2 return 0; [L724] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L725] COND TRUE 0 data1==16 && data2==5 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L727] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 172 locations, 61 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 825 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 561 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1192 IncrementalHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 67 mSDtfsCounter, 1192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=10, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 649 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-26 15:10:23,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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