./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 fced0e87 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-wip.fs.extract-columns-fced0e8-m [2024-01-31 16:13:07,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:13:07,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:13:07,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:13:07,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:13:07,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:13:07,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:13:07,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:13:07,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:13:07,598 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:13:07,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:13:07,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:13:07,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:13:07,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:13:07,601 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:13:07,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:13:07,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:13:07,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:13:07,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:13:07,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:13:07,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:13:07,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:13:07,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:13:07,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:13:07,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:13:07,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:13:07,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:13:07,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:13:07,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:13:07,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:13:07,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:13:07,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:13:07,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:13:07,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:13:07,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:13:07,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:13:07,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:13:07,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:13:07,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:13:07,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:13:07,607 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:13:07,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:13:07,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:13:07,608 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-31 16:13:07,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:13:07,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:13:07,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:13:07,885 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:13:07,886 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:13:07,887 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-31 16:13:07,969 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:13:07,970 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:13:07,970 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-31 16:13:09,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:13:09,285 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:13:09,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stateful01-1.i [2024-01-31 16:13:09,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8953e3d/b652799e741d432b9e25f728c643ccd3/FLAG99c3606c9 [2024-01-31 16:13:09,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8953e3d/b652799e741d432b9e25f728c643ccd3 [2024-01-31 16:13:09,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:13:09,315 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:13:09,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:13:09,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:13:09,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:13:09,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:13:07" (1/2) ... [2024-01-31 16:13:09,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b42ff61 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:13:09, skipping insertion in model container [2024-01-31 16:13:09,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:13:07" (1/2) ... [2024-01-31 16:13:09,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7a44448 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:13:09, skipping insertion in model container [2024-01-31 16:13:09,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:13:09" (2/2) ... [2024-01-31 16:13:09,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b42ff61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09, skipping insertion in model container [2024-01-31 16:13:09,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:13:09" (2/2) ... [2024-01-31 16:13:09,327 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:13:09,385 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:13:09,386 INFO L98 nessWitnessExtractor]: Location invariant before [L718-L718] (data1 == 0) && (data2 == 0) [2024-01-31 16:13:09,386 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] (unsigned long )arg == 0UL [2024-01-31 16:13:09,386 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (10 <= data1) && ((unsigned long )arg == 0UL) [2024-01-31 16:13:09,386 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L712] (unsigned long )arg == 0UL [2024-01-31 16:13:09,386 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] ((-2147483647 <= data2) && (10 <= data1)) && ((unsigned long )arg == 0UL) [2024-01-31 16:13:09,387 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] (10 <= data1) && ((unsigned long )arg == 0UL) [2024-01-31 16:13:09,387 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] (10 <= data1) && ((unsigned long )arg == 0UL) [2024-01-31 16:13:09,387 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (unsigned long )arg == 0UL [2024-01-31 16:13:09,387 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (unsigned long )arg == 0UL [2024-01-31 16:13:09,387 INFO L98 nessWitnessExtractor]: Location invariant before [L711-L711] ((10 <= data1) && (data2 <= 2147483641)) && ((unsigned long )arg == 0UL) [2024-01-31 16:13:09,387 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] (data1 == 0) && (data2 == 0) [2024-01-31 16:13:09,388 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] (unsigned long )arg == 0UL [2024-01-31 16:13:09,388 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] (unsigned long )arg == 0UL [2024-01-31 16:13:09,388 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] (data1 == 0) && (data2 == 0) [2024-01-31 16:13:09,388 INFO L98 nessWitnessExtractor]: Location invariant before [L721-L721] (data1 == 10) && (data2 == 10) [2024-01-31 16:13:09,388 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (15 <= data1) && ((unsigned long )arg == 0UL) [2024-01-31 16:13:09,389 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] (11 <= data1) && ((unsigned long )arg == 0UL) [2024-01-31 16:13:09,389 INFO L98 nessWitnessExtractor]: Location invariant before [L720-L720] (data1 == 10) && (data2 == 0) [2024-01-31 16:13:09,389 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] (10 <= data1) && ((unsigned long )arg == 0UL) [2024-01-31 16:13:09,430 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:13:09,709 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-31 16:13:09,712 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:13:09,721 INFO L204 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 [2024-01-31 16:13:09,813 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-31 16:13:09,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:13:09,843 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:13:09,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09 WrapperNode [2024-01-31 16:13:09,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:13:09,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:13:09,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:13:09,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:13:09,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (1/1) ... [2024-01-31 16:13:09,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (1/1) ... [2024-01-31 16:13:09,884 INFO L138 Inliner]: procedures = 169, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2024-01-31 16:13:09,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:13:09,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:13:09,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:13:09,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:13:09,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (1/1) ... [2024-01-31 16:13:09,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (1/1) ... [2024-01-31 16:13:09,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (1/1) ... [2024-01-31 16:13:09,921 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-31 16:13:09,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (1/1) ... [2024-01-31 16:13:09,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (1/1) ... [2024-01-31 16:13:09,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (1/1) ... [2024-01-31 16:13:09,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (1/1) ... [2024-01-31 16:13:09,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (1/1) ... [2024-01-31 16:13:09,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (1/1) ... [2024-01-31 16:13:09,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:13:09,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:13:09,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:13:09,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:13:09,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (1/1) ... [2024-01-31 16:13:09,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:13:10,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:13:10,028 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-31 16:13:10,036 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-31 16:13:10,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:13:10,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:13:10,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:13:10,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 16:13:10,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-31 16:13:10,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:13:10,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:13:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:13:10,080 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:13:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:13:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:13:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:13:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 16:13:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 16:13:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-31 16:13:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:13:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:13:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:13:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:13:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:13:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:13:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 16:13:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 16:13:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-31 16:13:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:13:10,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:13:10,086 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 16:13:10,192 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:13:10,193 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:13:10,439 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:13:10,441 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:13:10,547 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:13:10,547 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 16:13:10,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:13:10 BoogieIcfgContainer [2024-01-31 16:13:10,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:13:10,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:13:10,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:13:10,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:13:10,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:13:07" (1/4) ... [2024-01-31 16:13:10,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399f1b70 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:13:10, skipping insertion in model container [2024-01-31 16:13:10,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:13:09" (2/4) ... [2024-01-31 16:13:10,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399f1b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:13:10, skipping insertion in model container [2024-01-31 16:13:10,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:13:09" (3/4) ... [2024-01-31 16:13:10,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399f1b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:13:10, skipping insertion in model container [2024-01-31 16:13:10,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:13:10" (4/4) ... [2024-01-31 16:13:10,556 INFO L112 eAbstractionObserver]: Analyzing ICFG stateful01-1.i [2024-01-31 16:13:10,569 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:13:10,569 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-01-31 16:13:10,569 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:13:10,632 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-31 16:13:10,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 72 transitions, 158 flow [2024-01-31 16:13:10,700 INFO L124 PetriNetUnfolderBase]: 1/70 cut-off events. [2024-01-31 16:13:10,700 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-31 16:13:10,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 70 events. 1/70 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-01-31 16:13:10,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 72 transitions, 158 flow [2024-01-31 16:13:10,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 67 transitions, 146 flow [2024-01-31 16:13:10,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:13:10,724 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;@3a7bfefa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:13:10,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-01-31 16:13:10,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:13:10,727 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:13:10,728 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:13:10,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:10,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:13:10,731 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:10,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:10,735 INFO L85 PathProgramCache]: Analyzing trace with hash 9449, now seen corresponding path program 1 times [2024-01-31 16:13:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:10,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225180591] [2024-01-31 16:13:10,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:10,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:10,929 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-31 16:13:10,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:10,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225180591] [2024-01-31 16:13:10,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225180591] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:10,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:10,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:13:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734951484] [2024-01-31 16:13:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:10,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:13:10,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:10,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:13:10,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:13:10,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 72 [2024-01-31 16:13:11,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-31 16:13:11,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:11,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 72 [2024-01-31 16:13:11,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:11,206 INFO L124 PetriNetUnfolderBase]: 297/777 cut-off events. [2024-01-31 16:13:11,206 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-01-31 16:13:11,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 777 events. 297/777 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4301 event pairs, 297 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 1244. Up to 543 conditions per place. [2024-01-31 16:13:11,213 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 30 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-01-31 16:13:11,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 204 flow [2024-01-31 16:13:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:13:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:13:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2024-01-31 16:13:11,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-01-31 16:13:11,225 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 146 flow. Second operand 3 states and 140 transitions. [2024-01-31 16:13:11,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 204 flow [2024-01-31 16:13:11,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 16:13:11,233 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 136 flow [2024-01-31 16:13:11,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-01-31 16:13:11,237 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2024-01-31 16:13:11,238 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 136 flow [2024-01-31 16:13:11,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-31 16:13:11,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:11,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-31 16:13:11,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:13:11,239 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:11,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:11,239 INFO L85 PathProgramCache]: Analyzing trace with hash 281774487, now seen corresponding path program 1 times [2024-01-31 16:13:11,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:11,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675383861] [2024-01-31 16:13:11,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:11,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:11,330 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-31 16:13:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675383861] [2024-01-31 16:13:11,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675383861] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:11,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:11,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:13:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531163414] [2024-01-31 16:13:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:11,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:13:11,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:11,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:13:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:13:11,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 72 [2024-01-31 16:13:11,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-31 16:13:11,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:11,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 72 [2024-01-31 16:13:11,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:11,499 INFO L124 PetriNetUnfolderBase]: 240/707 cut-off events. [2024-01-31 16:13:11,499 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-31 16:13:11,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 707 events. 240/707 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4085 event pairs, 240 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 1155. Up to 443 conditions per place. [2024-01-31 16:13:11,503 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 27 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2024-01-31 16:13:11,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 194 flow [2024-01-31 16:13:11,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:13:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:13:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2024-01-31 16:13:11,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6493055555555556 [2024-01-31 16:13:11,505 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 136 flow. Second operand 4 states and 187 transitions. [2024-01-31 16:13:11,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 194 flow [2024-01-31 16:13:11,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:13:11,507 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 136 flow [2024-01-31 16:13:11,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2024-01-31 16:13:11,508 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2024-01-31 16:13:11,508 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 136 flow [2024-01-31 16:13:11,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-31 16:13:11,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:11,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 16:13:11,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:13:11,509 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:11,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash 145074782, now seen corresponding path program 1 times [2024-01-31 16:13:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:11,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326867634] [2024-01-31 16:13:11,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:11,548 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-31 16:13:11,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:11,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326867634] [2024-01-31 16:13:11,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326867634] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:11,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:11,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:13:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996185243] [2024-01-31 16:13:11,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:11,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:13:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:11,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:13:11,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:13:11,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 72 [2024-01-31 16:13:11,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 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-31 16:13:11,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:11,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 72 [2024-01-31 16:13:11,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:11,694 INFO L124 PetriNetUnfolderBase]: 240/703 cut-off events. [2024-01-31 16:13:11,695 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-31 16:13:11,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 703 events. 240/703 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4033 event pairs, 105 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 1149. Up to 425 conditions per place. [2024-01-31 16:13:11,699 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 33 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-01-31 16:13:11,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 223 flow [2024-01-31 16:13:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:13:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:13:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2024-01-31 16:13:11,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6736111111111112 [2024-01-31 16:13:11,702 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 136 flow. Second operand 4 states and 194 transitions. [2024-01-31 16:13:11,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 223 flow [2024-01-31 16:13:11,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 69 transitions, 217 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:13:11,704 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 147 flow [2024-01-31 16:13:11,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-01-31 16:13:11,705 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2024-01-31 16:13:11,705 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 147 flow [2024-01-31 16:13:11,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 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-31 16:13:11,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:11,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:13:11,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:13:11,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:11,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:11,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1186100666, now seen corresponding path program 1 times [2024-01-31 16:13:11,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:11,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682907927] [2024-01-31 16:13:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:11,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:11,827 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-31 16:13:11,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:11,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682907927] [2024-01-31 16:13:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682907927] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:11,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:11,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:13:11,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579067384] [2024-01-31 16:13:11,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:11,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:13:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:11,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:13:11,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:13:11,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 72 [2024-01-31 16:13:11,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-31 16:13:11,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:11,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 72 [2024-01-31 16:13:11,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:11,936 INFO L124 PetriNetUnfolderBase]: 213/673 cut-off events. [2024-01-31 16:13:11,936 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2024-01-31 16:13:11,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 673 events. 213/673 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3871 event pairs, 107 based on Foata normal form. 36/640 useless extension candidates. Maximal degree in co-relation 408. Up to 367 conditions per place. [2024-01-31 16:13:11,938 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 38 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-01-31 16:13:11,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 245 flow [2024-01-31 16:13:11,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:13:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:13:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2024-01-31 16:13:11,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6840277777777778 [2024-01-31 16:13:11,940 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 147 flow. Second operand 4 states and 197 transitions. [2024-01-31 16:13:11,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 245 flow [2024-01-31 16:13:11,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:13:11,941 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 140 flow [2024-01-31 16:13:11,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-01-31 16:13:11,942 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2024-01-31 16:13:11,942 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 140 flow [2024-01-31 16:13:11,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-31 16:13:11,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:11,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:13:11,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:13:11,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:11,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:11,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1675956508, now seen corresponding path program 1 times [2024-01-31 16:13:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:11,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851098625] [2024-01-31 16:13:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:11,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:12,017 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-31 16:13:12,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:12,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851098625] [2024-01-31 16:13:12,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851098625] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:12,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:12,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:13:12,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376459887] [2024-01-31 16:13:12,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:12,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:13:12,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:12,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:13:12,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:13:12,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 72 [2024-01-31 16:13:12,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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-31 16:13:12,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:12,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 72 [2024-01-31 16:13:12,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:12,122 INFO L124 PetriNetUnfolderBase]: 213/640 cut-off events. [2024-01-31 16:13:12,123 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-01-31 16:13:12,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 640 events. 213/640 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3711 event pairs, 11 based on Foata normal form. 36/629 useless extension candidates. Maximal degree in co-relation 1069. Up to 337 conditions per place. [2024-01-31 16:13:12,125 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 45 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2024-01-31 16:13:12,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 267 flow [2024-01-31 16:13:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:13:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:13:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2024-01-31 16:13:12,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2024-01-31 16:13:12,126 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 140 flow. Second operand 4 states and 204 transitions. [2024-01-31 16:13:12,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 267 flow [2024-01-31 16:13:12,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:13:12,128 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 135 flow [2024-01-31 16:13:12,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2024-01-31 16:13:12,128 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2024-01-31 16:13:12,128 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 135 flow [2024-01-31 16:13:12,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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-31 16:13:12,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:12,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:13:12,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:13:12,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:12,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:12,130 INFO L85 PathProgramCache]: Analyzing trace with hash 429324338, now seen corresponding path program 1 times [2024-01-31 16:13:12,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:12,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859308924] [2024-01-31 16:13:12,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:12,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:12,167 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-31 16:13:12,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:12,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859308924] [2024-01-31 16:13:12,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859308924] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:12,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:12,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:13:12,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337540228] [2024-01-31 16:13:12,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:12,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:13:12,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:12,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:13:12,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:13:12,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2024-01-31 16:13:12,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-31 16:13:12,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:12,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2024-01-31 16:13:12,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:12,308 INFO L124 PetriNetUnfolderBase]: 387/889 cut-off events. [2024-01-31 16:13:12,308 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-01-31 16:13:12,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1696 conditions, 889 events. 387/889 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4588 event pairs, 183 based on Foata normal form. 22/901 useless extension candidates. Maximal degree in co-relation 1475. Up to 612 conditions per place. [2024-01-31 16:13:12,312 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 47 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-01-31 16:13:12,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 68 transitions, 258 flow [2024-01-31 16:13:12,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:13:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:13:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2024-01-31 16:13:12,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5868055555555556 [2024-01-31 16:13:12,313 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 135 flow. Second operand 4 states and 169 transitions. [2024-01-31 16:13:12,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 68 transitions, 258 flow [2024-01-31 16:13:12,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 68 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:13:12,316 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 132 flow [2024-01-31 16:13:12,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-01-31 16:13:12,318 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2024-01-31 16:13:12,319 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 132 flow [2024-01-31 16:13:12,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-31 16:13:12,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:12,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:13:12,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:13:12,319 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:12,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:12,320 INFO L85 PathProgramCache]: Analyzing trace with hash 424152925, now seen corresponding path program 1 times [2024-01-31 16:13:12,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:12,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873100160] [2024-01-31 16:13:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:12,434 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-31 16:13:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873100160] [2024-01-31 16:13:12,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873100160] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:12,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:12,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:13:12,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676338575] [2024-01-31 16:13:12,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:12,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:13:12,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:12,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:13:12,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:13:12,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-01-31 16:13:12,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-31 16:13:12,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:12,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-01-31 16:13:12,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:12,625 INFO L124 PetriNetUnfolderBase]: 431/987 cut-off events. [2024-01-31 16:13:12,625 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-01-31 16:13:12,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 987 events. 431/987 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5277 event pairs, 183 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1675. Up to 592 conditions per place. [2024-01-31 16:13:12,629 INFO L140 encePairwiseOnDemand]: 66/72 looper letters, 56 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2024-01-31 16:13:12,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 310 flow [2024-01-31 16:13:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:13:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:13:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2024-01-31 16:13:12,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.575 [2024-01-31 16:13:12,631 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 132 flow. Second operand 5 states and 207 transitions. [2024-01-31 16:13:12,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 310 flow [2024-01-31 16:13:12,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 80 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:13:12,633 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 160 flow [2024-01-31 16:13:12,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2024-01-31 16:13:12,634 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2024-01-31 16:13:12,634 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 160 flow [2024-01-31 16:13:12,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-31 16:13:12,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:12,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:13:12,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:13:12,635 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:12,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash -574135609, now seen corresponding path program 1 times [2024-01-31 16:13:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:12,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007232680] [2024-01-31 16:13:12,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:12,677 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-31 16:13:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:12,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007232680] [2024-01-31 16:13:12,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007232680] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:12,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:12,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:13:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099096656] [2024-01-31 16:13:12,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:12,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:13:12,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:12,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:13:12,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:13:12,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2024-01-31 16:13:12,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:13:12,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:12,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2024-01-31 16:13:12,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:12,817 INFO L124 PetriNetUnfolderBase]: 441/984 cut-off events. [2024-01-31 16:13:12,817 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-01-31 16:13:12,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2012 conditions, 984 events. 441/984 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5227 event pairs, 71 based on Foata normal form. 22/999 useless extension candidates. Maximal degree in co-relation 1988. Up to 664 conditions per place. [2024-01-31 16:13:12,822 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 50 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-01-31 16:13:12,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 290 flow [2024-01-31 16:13:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:13:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:13:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2024-01-31 16:13:12,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5868055555555556 [2024-01-31 16:13:12,823 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 160 flow. Second operand 4 states and 169 transitions. [2024-01-31 16:13:12,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 290 flow [2024-01-31 16:13:12,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:13:12,825 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 157 flow [2024-01-31 16:13:12,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2024-01-31 16:13:12,826 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2024-01-31 16:13:12,826 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 157 flow [2024-01-31 16:13:12,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:13:12,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:12,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:13:12,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:13:12,827 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:12,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:12,827 INFO L85 PathProgramCache]: Analyzing trace with hash -618334337, now seen corresponding path program 1 times [2024-01-31 16:13:12,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:12,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640833328] [2024-01-31 16:13:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:12,891 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-31 16:13:12,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:12,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640833328] [2024-01-31 16:13:12,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640833328] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:12,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:12,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:13:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048642893] [2024-01-31 16:13:12,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:12,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:13:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:12,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:13:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:13:12,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-01-31 16:13:12,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-31 16:13:12,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:12,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-01-31 16:13:12,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:13,051 INFO L124 PetriNetUnfolderBase]: 441/960 cut-off events. [2024-01-31 16:13:13,052 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2024-01-31 16:13:13,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2010 conditions, 960 events. 441/960 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4947 event pairs, 71 based on Foata normal form. 26/979 useless extension candidates. Maximal degree in co-relation 1986. Up to 560 conditions per place. [2024-01-31 16:13:13,056 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 58 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-01-31 16:13:13,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 78 transitions, 334 flow [2024-01-31 16:13:13,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:13:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:13:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2024-01-31 16:13:13,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-01-31 16:13:13,057 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 157 flow. Second operand 5 states and 205 transitions. [2024-01-31 16:13:13,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 78 transitions, 334 flow [2024-01-31 16:13:13,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:13:13,059 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 162 flow [2024-01-31 16:13:13,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-01-31 16:13:13,059 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2024-01-31 16:13:13,060 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 162 flow [2024-01-31 16:13:13,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-31 16:13:13,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:13,060 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-31 16:13:13,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 16:13:13,060 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:13,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:13,061 INFO L85 PathProgramCache]: Analyzing trace with hash 346957208, now seen corresponding path program 1 times [2024-01-31 16:13:13,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:13,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259443268] [2024-01-31 16:13:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:13,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:13,131 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-31 16:13:13,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:13,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259443268] [2024-01-31 16:13:13,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259443268] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:13,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:13,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:13:13,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166028436] [2024-01-31 16:13:13,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:13,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:13:13,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:13,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:13:13,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:13:13,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-01-31 16:13:13,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 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-31 16:13:13,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:13,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-01-31 16:13:13,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:13,389 INFO L124 PetriNetUnfolderBase]: 393/911 cut-off events. [2024-01-31 16:13:13,390 INFO L125 PetriNetUnfolderBase]: For 234/237 co-relation queries the response was YES. [2024-01-31 16:13:13,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 911 events. 393/911 cut-off events. For 234/237 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4704 event pairs, 59 based on Foata normal form. 2/867 useless extension candidates. Maximal degree in co-relation 1685. Up to 251 conditions per place. [2024-01-31 16:13:13,394 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 70 selfloop transitions, 11 changer transitions 0/96 dead transitions. [2024-01-31 16:13:13,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 431 flow [2024-01-31 16:13:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:13:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:13:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 254 transitions. [2024-01-31 16:13:13,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5879629629629629 [2024-01-31 16:13:13,395 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 162 flow. Second operand 6 states and 254 transitions. [2024-01-31 16:13:13,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 431 flow [2024-01-31 16:13:13,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 96 transitions, 423 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 16:13:13,397 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 222 flow [2024-01-31 16:13:13,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2024-01-31 16:13:13,398 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -2 predicate places. [2024-01-31 16:13:13,398 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 222 flow [2024-01-31 16:13:13,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 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-31 16:13:13,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:13,399 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-31 16:13:13,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 16:13:13,399 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:13,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1994266963, now seen corresponding path program 1 times [2024-01-31 16:13:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:13,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172976129] [2024-01-31 16:13:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:13,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:13,478 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-31 16:13:13,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:13,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172976129] [2024-01-31 16:13:13,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172976129] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:13,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:13,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:13:13,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103393230] [2024-01-31 16:13:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:13,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:13:13,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:13,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:13:13,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:13:13,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2024-01-31 16:13:13,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 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-31 16:13:13,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:13,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2024-01-31 16:13:13,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:13,700 INFO L124 PetriNetUnfolderBase]: 406/897 cut-off events. [2024-01-31 16:13:13,700 INFO L125 PetriNetUnfolderBase]: For 485/485 co-relation queries the response was YES. [2024-01-31 16:13:13,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 897 events. 406/897 cut-off events. For 485/485 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4587 event pairs, 61 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 2068. Up to 262 conditions per place. [2024-01-31 16:13:13,704 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 70 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2024-01-31 16:13:13,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 100 transitions, 497 flow [2024-01-31 16:13:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:13:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:13:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 258 transitions. [2024-01-31 16:13:13,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2024-01-31 16:13:13,706 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 222 flow. Second operand 6 states and 258 transitions. [2024-01-31 16:13:13,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 100 transitions, 497 flow [2024-01-31 16:13:13,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 492 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:13:13,708 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 301 flow [2024-01-31 16:13:13,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2024-01-31 16:13:13,709 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2024-01-31 16:13:13,709 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 301 flow [2024-01-31 16:13:13,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 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-31 16:13:13,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:13,709 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] [2024-01-31 16:13:13,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 16:13:13,709 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:13,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:13,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2142017965, now seen corresponding path program 1 times [2024-01-31 16:13:13,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:13,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823860113] [2024-01-31 16:13:13,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:13,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:13,766 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-31 16:13:13,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:13,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823860113] [2024-01-31 16:13:13,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823860113] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:13,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:13,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:13:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484942735] [2024-01-31 16:13:13,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:13,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:13:13,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:13,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:13:13,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:13:13,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 72 [2024-01-31 16:13:13,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-31 16:13:13,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:13,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 72 [2024-01-31 16:13:13,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:13,846 INFO L124 PetriNetUnfolderBase]: 146/475 cut-off events. [2024-01-31 16:13:13,846 INFO L125 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2024-01-31 16:13:13,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 475 events. 146/475 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2280 event pairs, 46 based on Foata normal form. 41/502 useless extension candidates. Maximal degree in co-relation 1053. Up to 176 conditions per place. [2024-01-31 16:13:13,848 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 38 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2024-01-31 16:13:13,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 409 flow [2024-01-31 16:13:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:13:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:13:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2024-01-31 16:13:13,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7731481481481481 [2024-01-31 16:13:13,850 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 301 flow. Second operand 3 states and 167 transitions. [2024-01-31 16:13:13,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 409 flow [2024-01-31 16:13:13,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 73 transitions, 389 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-31 16:13:13,852 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 297 flow [2024-01-31 16:13:13,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2024-01-31 16:13:13,853 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2024-01-31 16:13:13,853 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 297 flow [2024-01-31 16:13:13,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-31 16:13:13,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:13,853 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] [2024-01-31 16:13:13,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 16:13:13,854 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:13,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2032871053, now seen corresponding path program 1 times [2024-01-31 16:13:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:13,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119141458] [2024-01-31 16:13:13,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:13,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:13,953 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-31 16:13:13,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:13,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119141458] [2024-01-31 16:13:13,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119141458] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:13,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:13,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:13:13,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194726787] [2024-01-31 16:13:13,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:13,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:13:13,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:13,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:13:13,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:13:14,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2024-01-31 16:13:14,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 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-31 16:13:14,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:14,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2024-01-31 16:13:14,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:14,220 INFO L124 PetriNetUnfolderBase]: 278/727 cut-off events. [2024-01-31 16:13:14,221 INFO L125 PetriNetUnfolderBase]: For 483/485 co-relation queries the response was YES. [2024-01-31 16:13:14,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1802 conditions, 727 events. 278/727 cut-off events. For 483/485 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3705 event pairs, 89 based on Foata normal form. 6/726 useless extension candidates. Maximal degree in co-relation 1769. Up to 195 conditions per place. [2024-01-31 16:13:14,225 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 79 selfloop transitions, 15 changer transitions 0/111 dead transitions. [2024-01-31 16:13:14,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 634 flow [2024-01-31 16:13:14,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:13:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:13:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 298 transitions. [2024-01-31 16:13:14,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5912698412698413 [2024-01-31 16:13:14,226 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 297 flow. Second operand 7 states and 298 transitions. [2024-01-31 16:13:14,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 634 flow [2024-01-31 16:13:14,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 111 transitions, 610 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:13:14,229 INFO L231 Difference]: Finished difference. Result has 89 places, 68 transitions, 347 flow [2024-01-31 16:13:14,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=347, PETRI_PLACES=89, PETRI_TRANSITIONS=68} [2024-01-31 16:13:14,230 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2024-01-31 16:13:14,230 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 68 transitions, 347 flow [2024-01-31 16:13:14,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 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-31 16:13:14,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:14,230 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] [2024-01-31 16:13:14,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 16:13:14,230 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:14,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:14,231 INFO L85 PathProgramCache]: Analyzing trace with hash 713933860, now seen corresponding path program 1 times [2024-01-31 16:13:14,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:14,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92355269] [2024-01-31 16:13:14,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:14,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:14,350 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-31 16:13:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92355269] [2024-01-31 16:13:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92355269] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:14,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:14,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:13:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278512968] [2024-01-31 16:13:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:14,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:13:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:13:14,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:13:14,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-01-31 16:13:14,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 68 transitions, 347 flow. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:13:14,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:14,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-01-31 16:13:14,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:14,655 INFO L124 PetriNetUnfolderBase]: 347/963 cut-off events. [2024-01-31 16:13:14,655 INFO L125 PetriNetUnfolderBase]: For 945/959 co-relation queries the response was YES. [2024-01-31 16:13:14,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 963 events. 347/963 cut-off events. For 945/959 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5489 event pairs, 67 based on Foata normal form. 10/966 useless extension candidates. Maximal degree in co-relation 2027. Up to 190 conditions per place. [2024-01-31 16:13:14,661 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 95 selfloop transitions, 16 changer transitions 0/127 dead transitions. [2024-01-31 16:13:14,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 127 transitions, 758 flow [2024-01-31 16:13:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:13:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:13:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 304 transitions. [2024-01-31 16:13:14,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2024-01-31 16:13:14,663 INFO L175 Difference]: Start difference. First operand has 89 places, 68 transitions, 347 flow. Second operand 7 states and 304 transitions. [2024-01-31 16:13:14,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 127 transitions, 758 flow [2024-01-31 16:13:14,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 127 transitions, 706 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-01-31 16:13:14,668 INFO L231 Difference]: Finished difference. Result has 91 places, 72 transitions, 380 flow [2024-01-31 16:13:14,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=380, PETRI_PLACES=91, PETRI_TRANSITIONS=72} [2024-01-31 16:13:14,670 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2024-01-31 16:13:14,670 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 72 transitions, 380 flow [2024-01-31 16:13:14,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:13:14,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:14,671 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] [2024-01-31 16:13:14,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 16:13:14,671 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:14,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1735046634, now seen corresponding path program 2 times [2024-01-31 16:13:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:14,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399475278] [2024-01-31 16:13:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:14,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:13:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:14,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399475278] [2024-01-31 16:13:14,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399475278] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:14,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:14,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:13:14,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176845437] [2024-01-31 16:13:14,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:14,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:13:14,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:14,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:13:14,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:13:14,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-01-31 16:13:14,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 72 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:13:14,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:14,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-01-31 16:13:14,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:15,176 INFO L124 PetriNetUnfolderBase]: 373/1031 cut-off events. [2024-01-31 16:13:15,176 INFO L125 PetriNetUnfolderBase]: For 995/1009 co-relation queries the response was YES. [2024-01-31 16:13:15,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2441 conditions, 1031 events. 373/1031 cut-off events. For 995/1009 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 6055 event pairs, 97 based on Foata normal form. 10/1033 useless extension candidates. Maximal degree in co-relation 2281. Up to 282 conditions per place. [2024-01-31 16:13:15,181 INFO L140 encePairwiseOnDemand]: 63/72 looper letters, 87 selfloop transitions, 18 changer transitions 0/121 dead transitions. [2024-01-31 16:13:15,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 121 transitions, 725 flow [2024-01-31 16:13:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:13:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:13:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 298 transitions. [2024-01-31 16:13:15,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5912698412698413 [2024-01-31 16:13:15,183 INFO L175 Difference]: Start difference. First operand has 91 places, 72 transitions, 380 flow. Second operand 7 states and 298 transitions. [2024-01-31 16:13:15,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 121 transitions, 725 flow [2024-01-31 16:13:15,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 121 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:13:15,187 INFO L231 Difference]: Finished difference. Result has 97 places, 73 transitions, 434 flow [2024-01-31 16:13:15,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=434, PETRI_PLACES=97, PETRI_TRANSITIONS=73} [2024-01-31 16:13:15,187 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 23 predicate places. [2024-01-31 16:13:15,187 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 73 transitions, 434 flow [2024-01-31 16:13:15,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:13:15,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:15,188 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] [2024-01-31 16:13:15,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-31 16:13:15,188 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:15,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1403748165, now seen corresponding path program 2 times [2024-01-31 16:13:15,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:15,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175998898] [2024-01-31 16:13:15,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:15,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:15,281 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-31 16:13:15,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:15,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175998898] [2024-01-31 16:13:15,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175998898] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:15,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:15,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:13:15,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911087414] [2024-01-31 16:13:15,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:15,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:13:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:15,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:13:15,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:13:15,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2024-01-31 16:13:15,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 73 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 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-31 16:13:15,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:15,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2024-01-31 16:13:15,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:15,609 INFO L124 PetriNetUnfolderBase]: 436/1185 cut-off events. [2024-01-31 16:13:15,609 INFO L125 PetriNetUnfolderBase]: For 1599/1603 co-relation queries the response was YES. [2024-01-31 16:13:15,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 1185 events. 436/1185 cut-off events. For 1599/1603 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 7426 event pairs, 117 based on Foata normal form. 6/1184 useless extension candidates. Maximal degree in co-relation 2813. Up to 281 conditions per place. [2024-01-31 16:13:15,614 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 89 selfloop transitions, 21 changer transitions 0/127 dead transitions. [2024-01-31 16:13:15,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 127 transitions, 837 flow [2024-01-31 16:13:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 16:13:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 16:13:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 337 transitions. [2024-01-31 16:13:15,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5850694444444444 [2024-01-31 16:13:15,616 INFO L175 Difference]: Start difference. First operand has 97 places, 73 transitions, 434 flow. Second operand 8 states and 337 transitions. [2024-01-31 16:13:15,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 127 transitions, 837 flow [2024-01-31 16:13:15,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 127 transitions, 805 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-01-31 16:13:15,621 INFO L231 Difference]: Finished difference. Result has 103 places, 76 transitions, 511 flow [2024-01-31 16:13:15,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=511, PETRI_PLACES=103, PETRI_TRANSITIONS=76} [2024-01-31 16:13:15,622 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 29 predicate places. [2024-01-31 16:13:15,622 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 76 transitions, 511 flow [2024-01-31 16:13:15,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 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-31 16:13:15,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:15,623 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] [2024-01-31 16:13:15,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-31 16:13:15,623 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:15,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:15,623 INFO L85 PathProgramCache]: Analyzing trace with hash -647895063, now seen corresponding path program 3 times [2024-01-31 16:13:15,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:15,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678003980] [2024-01-31 16:13:15,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:15,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:15,716 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-31 16:13:15,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:15,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678003980] [2024-01-31 16:13:15,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678003980] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:15,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:15,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:13:15,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612219844] [2024-01-31 16:13:15,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:15,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:13:15,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:15,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:13:15,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:13:15,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 72 [2024-01-31 16:13:15,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 76 transitions, 511 flow. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 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-31 16:13:15,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:15,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 72 [2024-01-31 16:13:15,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:16,003 INFO L124 PetriNetUnfolderBase]: 430/1175 cut-off events. [2024-01-31 16:13:16,003 INFO L125 PetriNetUnfolderBase]: For 2037/2041 co-relation queries the response was YES. [2024-01-31 16:13:16,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 1175 events. 430/1175 cut-off events. For 2037/2041 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7398 event pairs, 67 based on Foata normal form. 6/1174 useless extension candidates. Maximal degree in co-relation 2884. Up to 331 conditions per place. [2024-01-31 16:13:16,009 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 77 selfloop transitions, 23 changer transitions 0/117 dead transitions. [2024-01-31 16:13:16,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 117 transitions, 825 flow [2024-01-31 16:13:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-31 16:13:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-31 16:13:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 354 transitions. [2024-01-31 16:13:16,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-01-31 16:13:16,011 INFO L175 Difference]: Start difference. First operand has 103 places, 76 transitions, 511 flow. Second operand 9 states and 354 transitions. [2024-01-31 16:13:16,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 117 transitions, 825 flow [2024-01-31 16:13:16,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 117 transitions, 765 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-01-31 16:13:16,018 INFO L231 Difference]: Finished difference. Result has 104 places, 75 transitions, 491 flow [2024-01-31 16:13:16,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=491, PETRI_PLACES=104, PETRI_TRANSITIONS=75} [2024-01-31 16:13:16,019 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 30 predicate places. [2024-01-31 16:13:16,019 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 75 transitions, 491 flow [2024-01-31 16:13:16,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 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-31 16:13:16,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:16,019 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] [2024-01-31 16:13:16,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-31 16:13:16,019 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:16,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:16,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2112930640, now seen corresponding path program 3 times [2024-01-31 16:13:16,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:16,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745265667] [2024-01-31 16:13:16,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:16,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:16,111 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-31 16:13:16,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:16,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745265667] [2024-01-31 16:13:16,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745265667] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:16,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:16,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:13:16,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444139831] [2024-01-31 16:13:16,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:16,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:13:16,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:16,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:13:16,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:13:16,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-01-31 16:13:16,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 75 transitions, 491 flow. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:13:16,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:16,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-01-31 16:13:16,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:16,420 INFO L124 PetriNetUnfolderBase]: 463/1265 cut-off events. [2024-01-31 16:13:16,420 INFO L125 PetriNetUnfolderBase]: For 1859/1873 co-relation queries the response was YES. [2024-01-31 16:13:16,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 1265 events. 463/1265 cut-off events. For 1859/1873 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8038 event pairs, 123 based on Foata normal form. 10/1264 useless extension candidates. Maximal degree in co-relation 2859. Up to 342 conditions per place. [2024-01-31 16:13:16,429 INFO L140 encePairwiseOnDemand]: 63/72 looper letters, 92 selfloop transitions, 22 changer transitions 0/129 dead transitions. [2024-01-31 16:13:16,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 129 transitions, 875 flow [2024-01-31 16:13:16,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 16:13:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 16:13:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 332 transitions. [2024-01-31 16:13:16,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2024-01-31 16:13:16,430 INFO L175 Difference]: Start difference. First operand has 104 places, 75 transitions, 491 flow. Second operand 8 states and 332 transitions. [2024-01-31 16:13:16,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 129 transitions, 875 flow [2024-01-31 16:13:16,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 129 transitions, 812 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-01-31 16:13:16,437 INFO L231 Difference]: Finished difference. Result has 106 places, 77 transitions, 520 flow [2024-01-31 16:13:16,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=520, PETRI_PLACES=106, PETRI_TRANSITIONS=77} [2024-01-31 16:13:16,438 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 32 predicate places. [2024-01-31 16:13:16,438 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 77 transitions, 520 flow [2024-01-31 16:13:16,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:13:16,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:16,438 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] [2024-01-31 16:13:16,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-31 16:13:16,438 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:16,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:16,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2091662366, now seen corresponding path program 4 times [2024-01-31 16:13:16,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:16,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795238809] [2024-01-31 16:13:16,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:16,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:13:16,538 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-31 16:13:16,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:13:16,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795238809] [2024-01-31 16:13:16,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795238809] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:13:16,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:13:16,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:13:16,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223268147] [2024-01-31 16:13:16,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:13:16,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 16:13:16,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:13:16,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 16:13:16,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-01-31 16:13:16,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 72 [2024-01-31 16:13:16,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 77 transitions, 520 flow. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:13:16,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:13:16,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 72 [2024-01-31 16:13:16,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:13:16,836 INFO L124 PetriNetUnfolderBase]: 462/1254 cut-off events. [2024-01-31 16:13:16,836 INFO L125 PetriNetUnfolderBase]: For 2176/2190 co-relation queries the response was YES. [2024-01-31 16:13:16,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 1254 events. 462/1254 cut-off events. For 2176/2190 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7933 event pairs, 95 based on Foata normal form. 10/1255 useless extension candidates. Maximal degree in co-relation 2835. Up to 342 conditions per place. [2024-01-31 16:13:16,845 INFO L140 encePairwiseOnDemand]: 63/72 looper letters, 76 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2024-01-31 16:13:16,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 116 transitions, 820 flow [2024-01-31 16:13:16,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-31 16:13:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-31 16:13:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 346 transitions. [2024-01-31 16:13:16,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339506172839507 [2024-01-31 16:13:16,847 INFO L175 Difference]: Start difference. First operand has 106 places, 77 transitions, 520 flow. Second operand 9 states and 346 transitions. [2024-01-31 16:13:16,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 116 transitions, 820 flow [2024-01-31 16:13:16,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 116 transitions, 773 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-01-31 16:13:16,852 INFO L231 Difference]: Finished difference. Result has 106 places, 76 transitions, 515 flow [2024-01-31 16:13:16,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=515, PETRI_PLACES=106, PETRI_TRANSITIONS=76} [2024-01-31 16:13:16,853 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 32 predicate places. [2024-01-31 16:13:16,853 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 76 transitions, 515 flow [2024-01-31 16:13:16,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:13:16,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:13:16,853 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] [2024-01-31 16:13:16,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-31 16:13:16,853 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-31 16:13:16,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:13:16,854 INFO L85 PathProgramCache]: Analyzing trace with hash 429941126, now seen corresponding path program 1 times [2024-01-31 16:13:16,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:13:16,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086270123] [2024-01-31 16:13:16,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:13:16,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:13:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:13:16,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 16:13:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 16:13:16,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 16:13:16,927 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 16:13:16,927 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (35 of 36 remaining) [2024-01-31 16:13:16,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 36 remaining) [2024-01-31 16:13:16,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 36 remaining) [2024-01-31 16:13:16,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 36 remaining) [2024-01-31 16:13:16,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 36 remaining) [2024-01-31 16:13:16,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 36 remaining) [2024-01-31 16:13:16,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 36 remaining) [2024-01-31 16:13:16,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 36 remaining) [2024-01-31 16:13:16,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 36 remaining) [2024-01-31 16:13:16,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 36 remaining) [2024-01-31 16:13:16,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 36 remaining) [2024-01-31 16:13:16,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 36 remaining) [2024-01-31 16:13:16,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 36 remaining) [2024-01-31 16:13:16,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 36 remaining) [2024-01-31 16:13:16,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 36 remaining) [2024-01-31 16:13:16,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 36 remaining) [2024-01-31 16:13:16,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 36 remaining) [2024-01-31 16:13:16,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 36 remaining) [2024-01-31 16:13:16,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 36 remaining) [2024-01-31 16:13:16,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 36 remaining) [2024-01-31 16:13:16,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 36 remaining) [2024-01-31 16:13:16,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 36 remaining) [2024-01-31 16:13:16,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 36 remaining) [2024-01-31 16:13:16,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 36 remaining) [2024-01-31 16:13:16,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 36 remaining) [2024-01-31 16:13:16,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 36 remaining) [2024-01-31 16:13:16,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 36 remaining) [2024-01-31 16:13:16,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 36 remaining) [2024-01-31 16:13:16,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 36 remaining) [2024-01-31 16:13:16,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 36 remaining) [2024-01-31 16:13:16,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 36 remaining) [2024-01-31 16:13:16,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 36 remaining) [2024-01-31 16:13:16,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 36 remaining) [2024-01-31 16:13:16,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 36 remaining) [2024-01-31 16:13:16,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 36 remaining) [2024-01-31 16:13:16,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 36 remaining) [2024-01-31 16:13:16,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-31 16:13:16,935 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:13:16,940 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 16:13:16,940 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 16:13:16,999 INFO L503 ceAbstractionStarter]: Automizer considered 19 witness invariants [2024-01-31 16:13:17,000 INFO L504 ceAbstractionStarter]: WitnessConsidered=19 [2024-01-31 16:13:17,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:13:17 BasicIcfg [2024-01-31 16:13:17,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 16:13:17,002 INFO L158 Benchmark]: Toolchain (without parser) took 7686.70ms. Allocated memory was 142.6MB in the beginning and 316.7MB in the end (delta: 174.1MB). Free memory was 104.3MB in the beginning and 239.4MB in the end (delta: -135.1MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-01-31 16:13:17,002 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:13:17,002 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory was 77.3MB in the beginning and 77.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 16:13:17,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.57ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 75.9MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-31 16:13:17,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.32ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 73.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 16:13:17,003 INFO L158 Benchmark]: Boogie Preprocessor took 59.73ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 16:13:17,003 INFO L158 Benchmark]: RCFGBuilder took 603.32ms. Allocated memory is still 142.6MB. Free memory was 71.7MB in the beginning and 81.1MB in the end (delta: -9.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-01-31 16:13:17,004 INFO L158 Benchmark]: TraceAbstraction took 6451.17ms. Allocated memory was 142.6MB in the beginning and 316.7MB in the end (delta: 174.1MB). Free memory was 79.8MB in the beginning and 239.4MB in the end (delta: -159.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-01-31 16:13:17,004 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 109.1MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory was 77.3MB in the beginning and 77.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.57ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 75.9MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.32ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 73.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.73ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 603.32ms. Allocated memory is still 142.6MB. Free memory was 71.7MB in the beginning and 81.1MB in the end (delta: -9.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6451.17ms. Allocated memory was 142.6MB in the beginning and 316.7MB in the end (delta: 174.1MB). Free memory was 79.8MB in the beginning and 239.4MB in the end (delta: -159.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 727]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L692] 0 pthread_mutex_t ma, mb; [L693] 0 int data1, data2; [L716] 0 pthread_t t1, t2; VAL [data1=0, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L717] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]]] [L718] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]]] [L719] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[0]]]]] [L719] 0 data1 = 10 VAL [data1=10, data2=0, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L720] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[10]],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[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[data1],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[data2],IntegerLiteral[10]]]]] [L721] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}, t1={5:0}, t2={6:0}] [L722] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, data1=10, data2=10, 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 [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=10, data2=10, ma={3:0}, mb={4:0}] [L707] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L707] 2 data1+=5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=15, data2=10, ma={3:0}, mb={4:0}] [L723] 0 \read(t1) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=15, data2=10, ma={3:0}, mb={4:0}] [L708] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[15],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=15, data2=10, ma={3:0}, mb={4:0}] [L696] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=15, data2=10, ma={3:0}, mb={4:0}] [L697] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L697] 1 data1++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=10, ma={3:0}, mb={4:0}] [L698] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[11],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, 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}, arg={0:0}, arg={0:0}, data1=16, data2=10, ma={3:0}, mb={4:0}] [L700] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L700] 1 data2++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L701] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,UnaryExpression[MINUS,IntegerLiteral[2147483647]],IdentifierExpression[data2]],BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=11, ma={3:0}, mb={4:0}] [L702] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L702] 1 return 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] 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[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L710] 2 data2-=6 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data1=16, data2=5, ma={3:0}, mb={4:0}] [L711] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[10],IdentifierExpression[data1]],BinaryExpression[COMPLEQ,IdentifierExpression[data2],IntegerLiteral[2147483641]]],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: 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: 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: 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: 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: 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: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 122 locations, 36 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: 6.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2226 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1680 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 239 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4067 IncrementalHoareTripleChecker+Invalid, 4306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 239 mSolverCounterUnsat, 89 mSDtfsCounter, 4067 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=520occurred in iteration=18, InterpolantAutomatonStates: 107, 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, 1.4s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 3198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-31 16:13:17,042 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