./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/arithmetic_prog_bad.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/arithmetic_prog_bad.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-958ec4d-m [2024-02-07 14:55:15,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:55:15,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:55:15,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:55:15,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:55:15,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:55:15,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:55:15,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:55:15,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:55:15,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:55:15,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:55:15,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:55:15,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:55:15,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:55:15,854 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:55:15,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:55:15,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:55:15,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:55:15,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:55:15,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:55:15,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:55:15,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:55:15,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:55:15,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:55:15,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:55:15,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:55:15,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:55:15,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:55:15,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:55:15,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:55:15,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:55:15,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:55:15,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:55:15,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:55:15,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:55:15,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:55:15,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:55:15,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:55:15,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:55:15,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:55:15,862 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:55:15,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:55:15,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:55:15,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-07 14:55:16,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:55:16,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:55:16,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:55:16,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:55:16,174 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:55:16,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-02-07 14:55:17,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:55:17,531 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:55:17,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-02-07 14:55:17,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b90b5e7b/3b3422d218d54f878d99fb3ce5ba94a3/FLAG0e796a5b1 [2024-02-07 14:55:17,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b90b5e7b/3b3422d218d54f878d99fb3ce5ba94a3 [2024-02-07 14:55:17,593 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:55:17,594 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:55:17,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/arithmetic_prog_bad.yml/witness.yml [2024-02-07 14:55:17,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:55:17,688 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:55:17,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:55:17,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:55:17,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:55:17,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:55:17" (1/2) ... [2024-02-07 14:55:17,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ddfdc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:55:17, skipping insertion in model container [2024-02-07 14:55:17,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:55:17" (1/2) ... [2024-02-07 14:55:17,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@38d2114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:55:17, skipping insertion in model container [2024-02-07 14:55:17,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:55:17" (2/2) ... [2024-02-07 14:55:17,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ddfdc17 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:17, skipping insertion in model container [2024-02-07 14:55:17,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:55:17" (2/2) ... [2024-02-07 14:55:17,700 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:55:17,757 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:55:17,759 INFO L76 edCorrectnessWitness]: Location invariant before [L885-L885] (0 == i && i == 0) || (1 <= i && i <= 2) [2024-02-07 14:55:17,759 INFO L76 edCorrectnessWitness]: Location invariant before [L909-L909] num == 0 [2024-02-07 14:55:17,759 INFO L76 edCorrectnessWitness]: Location invariant before [L918-L918] ((0 <= flag) && (flag <= 1)) && (flag == 0 || flag == 1) [2024-02-07 14:55:17,760 INFO L76 edCorrectnessWitness]: Location invariant before [L883-L883] num == 1 [2024-02-07 14:55:17,760 INFO L76 edCorrectnessWitness]: Location invariant before [L898-L898] num == 0 [2024-02-07 14:55:17,761 INFO L76 edCorrectnessWitness]: Location invariant before [L917-L917] ((0 <= flag) && (flag <= 1)) && (flag == 0 || flag == 1) [2024-02-07 14:55:17,761 INFO L76 edCorrectnessWitness]: Location invariant before [L902-L902] j == 3 [2024-02-07 14:55:17,761 INFO L76 edCorrectnessWitness]: Location invariant before [L897-L897] num == 1 [2024-02-07 14:55:17,761 INFO L76 edCorrectnessWitness]: Location invariant before [L882-L882] num == 0 [2024-02-07 14:55:17,761 INFO L76 edCorrectnessWitness]: Location invariant before [L904-L904] ((0 <= flag) && (flag <= 1)) && (flag == 0 || flag == 1) [2024-02-07 14:55:17,761 INFO L76 edCorrectnessWitness]: Location invariant before [L900-L900] (0 == j && j == 0) || (1 <= j && j <= 2) [2024-02-07 14:55:17,762 INFO L76 edCorrectnessWitness]: Location invariant before [L896-L896] (0 == j && j == 0) || (1 <= j && j <= 2) [2024-02-07 14:55:17,762 INFO L76 edCorrectnessWitness]: Location invariant before [L910-L910] total == 0UL [2024-02-07 14:55:17,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:55:18,204 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-deagle/arithmetic_prog_bad.i[39758,39771] [2024-02-07 14:55:18,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:55:18,226 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 14:55:18,303 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-deagle/arithmetic_prog_bad.i[39758,39771] [2024-02-07 14:55:18,304 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:55:18,350 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:55:18,350 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18 WrapperNode [2024-02-07 14:55:18,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:55:18,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:55:18,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:55:18,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:55:18,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (1/1) ... [2024-02-07 14:55:18,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (1/1) ... [2024-02-07 14:55:18,392 INFO L138 Inliner]: procedures = 244, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 84 [2024-02-07 14:55:18,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:55:18,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:55:18,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:55:18,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:55:18,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (1/1) ... [2024-02-07 14:55:18,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (1/1) ... [2024-02-07 14:55:18,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (1/1) ... [2024-02-07 14:55:18,420 INFO L175 MemorySlicer]: Split 31 memory accesses to 7 slices as follows [2, 1, 8, 8, 8, 2, 2]. 26 percent of accesses are in the largest equivalence class. The 27 initializations are split as follows [2, 1, 8, 8, 8, 0, 0]. The 2 writes are split as follows [0, 0, 0, 0, 0, 1, 1]. [2024-02-07 14:55:18,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (1/1) ... [2024-02-07 14:55:18,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (1/1) ... [2024-02-07 14:55:18,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (1/1) ... [2024-02-07 14:55:18,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (1/1) ... [2024-02-07 14:55:18,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (1/1) ... [2024-02-07 14:55:18,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (1/1) ... [2024-02-07 14:55:18,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:55:18,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:55:18,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:55:18,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:55:18,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (1/1) ... [2024-02-07 14:55:18,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:55:18,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:55:18,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-07 14:55:18,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-07 14:55:18,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:55:18,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:55:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-02-07 14:55:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-02-07 14:55:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-02-07 14:55:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-02-07 14:55:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-02-07 14:55:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-02-07 14:55:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-02-07 14:55:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-07 14:55:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 14:55:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 14:55:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 14:55:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 14:55:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 14:55:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-07 14:55:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-02-07 14:55:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 14:55:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 14:55:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 14:55:18,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 14:55:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:55:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:55:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:55:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:55:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 14:55:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-07 14:55:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-02-07 14:55:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-07 14:55:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:55:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:55:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:55:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:55:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:55:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 14:55:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-07 14:55:18,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-02-07 14:55:18,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:55:18,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:55:18,539 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:55:18,732 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:55:18,734 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:55:18,941 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:55:18,942 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:55:19,151 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:55:19,152 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-07 14:55:19,153 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:55:19 BoogieIcfgContainer [2024-02-07 14:55:19,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:55:19,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:55:19,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:55:19,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:55:19,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:55:17" (1/4) ... [2024-02-07 14:55:19,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abef561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:55:19, skipping insertion in model container [2024-02-07 14:55:19,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:55:17" (2/4) ... [2024-02-07 14:55:19,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abef561 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:55:19, skipping insertion in model container [2024-02-07 14:55:19,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:55:18" (3/4) ... [2024-02-07 14:55:19,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abef561 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:55:19, skipping insertion in model container [2024-02-07 14:55:19,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:55:19" (4/4) ... [2024-02-07 14:55:19,162 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-02-07 14:55:19,178 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:55:19,178 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-02-07 14:55:19,178 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:55:19,237 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-07 14:55:19,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 66 transitions, 146 flow [2024-02-07 14:55:19,312 INFO L124 PetriNetUnfolderBase]: 6/64 cut-off events. [2024-02-07 14:55:19,312 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-07 14:55:19,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 6/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2024-02-07 14:55:19,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 66 transitions, 146 flow [2024-02-07 14:55:19,324 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 60 transitions, 132 flow [2024-02-07 14:55:19,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:55:19,351 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;@61f35a0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:55:19,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-02-07 14:55:19,355 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:55:19,356 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 14:55:19,356 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:55:19,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:55:19,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 14:55:19,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 14:55:19,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:55:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash 12501, now seen corresponding path program 1 times [2024-02-07 14:55:19,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:55:19,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807476169] [2024-02-07 14:55:19,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:19,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:55:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:19,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:55:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807476169] [2024-02-07 14:55:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807476169] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:55:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:55:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:55:19,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197575856] [2024-02-07 14:55:19,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:55:19,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:55:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:55:19,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:55:19,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:55:19,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-02-07 14:55:19,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:19,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:55:19,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-02-07 14:55:19,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:55:20,073 INFO L124 PetriNetUnfolderBase]: 971/1918 cut-off events. [2024-02-07 14:55:20,074 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-02-07 14:55:20,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3599 conditions, 1918 events. 971/1918 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 10277 event pairs, 314 based on Foata normal form. 22/1786 useless extension candidates. Maximal degree in co-relation 3307. Up to 886 conditions per place. [2024-02-07 14:55:20,092 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 57 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2024-02-07 14:55:20,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 313 flow [2024-02-07 14:55:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:55:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:55:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-02-07 14:55:20,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2024-02-07 14:55:20,110 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 132 flow. Second operand 3 states and 146 transitions. [2024-02-07 14:55:20,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 313 flow [2024-02-07 14:55:20,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 299 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-07 14:55:20,123 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 164 flow [2024-02-07 14:55:20,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2024-02-07 14:55:20,128 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2024-02-07 14:55:20,129 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 164 flow [2024-02-07 14:55:20,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:20,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:55:20,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-07 14:55:20,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:55:20,130 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 14:55:20,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:55:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash 387898, now seen corresponding path program 1 times [2024-02-07 14:55:20,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:55:20,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208185270] [2024-02-07 14:55:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:55:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:20,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:55:20,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208185270] [2024-02-07 14:55:20,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208185270] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:55:20,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:55:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:55:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136839736] [2024-02-07 14:55:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:55:20,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:55:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:55:20,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:55:20,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:55:20,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2024-02-07 14:55:20,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:20,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:55:20,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2024-02-07 14:55:20,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:55:20,551 INFO L124 PetriNetUnfolderBase]: 1113/2373 cut-off events. [2024-02-07 14:55:20,552 INFO L125 PetriNetUnfolderBase]: For 287/304 co-relation queries the response was YES. [2024-02-07 14:55:20,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4654 conditions, 2373 events. 1113/2373 cut-off events. For 287/304 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 14005 event pairs, 397 based on Foata normal form. 2/2306 useless extension candidates. Maximal degree in co-relation 1636. Up to 1069 conditions per place. [2024-02-07 14:55:20,563 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 50 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2024-02-07 14:55:20,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 81 transitions, 317 flow [2024-02-07 14:55:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:55:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:55:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2024-02-07 14:55:20,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7323232323232324 [2024-02-07 14:55:20,570 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 164 flow. Second operand 3 states and 145 transitions. [2024-02-07 14:55:20,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 81 transitions, 317 flow [2024-02-07 14:55:20,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:55:20,577 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 169 flow [2024-02-07 14:55:20,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2024-02-07 14:55:20,578 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2024-02-07 14:55:20,579 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 169 flow [2024-02-07 14:55:20,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:20,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:55:20,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:55:20,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:55:20,580 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 14:55:20,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:55:20,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1473600151, now seen corresponding path program 1 times [2024-02-07 14:55:20,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:55:20,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81956088] [2024-02-07 14:55:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:20,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:55:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:20,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:55:20,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81956088] [2024-02-07 14:55:20,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81956088] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:55:20,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:55:20,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:55:20,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429755388] [2024-02-07 14:55:20,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:55:20,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:55:20,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:55:20,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:55:20,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:55:20,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2024-02-07 14:55:20,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:20,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:55:20,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2024-02-07 14:55:20,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:55:20,943 INFO L124 PetriNetUnfolderBase]: 1276/2737 cut-off events. [2024-02-07 14:55:20,944 INFO L125 PetriNetUnfolderBase]: For 148/170 co-relation queries the response was YES. [2024-02-07 14:55:20,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5382 conditions, 2737 events. 1276/2737 cut-off events. For 148/170 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 15911 event pairs, 653 based on Foata normal form. 48/2669 useless extension candidates. Maximal degree in co-relation 1971. Up to 1351 conditions per place. [2024-02-07 14:55:20,957 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 53 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2024-02-07 14:55:20,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 323 flow [2024-02-07 14:55:20,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:55:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:55:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-02-07 14:55:20,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7525252525252525 [2024-02-07 14:55:20,960 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 169 flow. Second operand 3 states and 149 transitions. [2024-02-07 14:55:20,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 323 flow [2024-02-07 14:55:20,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 82 transitions, 319 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 14:55:20,965 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 176 flow [2024-02-07 14:55:20,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2024-02-07 14:55:20,966 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2024-02-07 14:55:20,967 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 176 flow [2024-02-07 14:55:20,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:20,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:55:20,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:55:20,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:55:20,967 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 14:55:20,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:55:20,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2041387914, now seen corresponding path program 1 times [2024-02-07 14:55:20,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:55:20,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870259766] [2024-02-07 14:55:20,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:20,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:55:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:21,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:55:21,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870259766] [2024-02-07 14:55:21,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870259766] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:55:21,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:55:21,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:55:21,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615503144] [2024-02-07 14:55:21,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:55:21,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:55:21,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:55:21,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:55:21,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:55:21,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-02-07 14:55:21,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:21,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:55:21,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-02-07 14:55:21,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:55:21,428 INFO L124 PetriNetUnfolderBase]: 1199/2450 cut-off events. [2024-02-07 14:55:21,428 INFO L125 PetriNetUnfolderBase]: For 421/435 co-relation queries the response was YES. [2024-02-07 14:55:21,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5230 conditions, 2450 events. 1199/2450 cut-off events. For 421/435 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 13296 event pairs, 475 based on Foata normal form. 164/2607 useless extension candidates. Maximal degree in co-relation 1842. Up to 1175 conditions per place. [2024-02-07 14:55:21,440 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 58 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2024-02-07 14:55:21,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 80 transitions, 337 flow [2024-02-07 14:55:21,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:55:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:55:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-02-07 14:55:21,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2024-02-07 14:55:21,442 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 176 flow. Second operand 4 states and 159 transitions. [2024-02-07 14:55:21,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 80 transitions, 337 flow [2024-02-07 14:55:21,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 80 transitions, 333 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:55:21,444 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 168 flow [2024-02-07 14:55:21,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2024-02-07 14:55:21,446 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2024-02-07 14:55:21,446 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 168 flow [2024-02-07 14:55:21,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:21,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:55:21,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:55:21,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:55:21,447 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 14:55:21,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:55:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1749994396, now seen corresponding path program 1 times [2024-02-07 14:55:21,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:55:21,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996011354] [2024-02-07 14:55:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:55:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:21,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:55:21,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996011354] [2024-02-07 14:55:21,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996011354] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:55:21,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:55:21,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:55:21,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607574004] [2024-02-07 14:55:21,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:55:21,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:55:21,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:55:21,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:55:21,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:55:21,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2024-02-07 14:55:21,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:21,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:55:21,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2024-02-07 14:55:21,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:55:21,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([416] L895-6-->L894-2: Formula: (not (= v_~num~0_In_1 0)) InVars {~num~0=v_~num~0_In_1} OutVars{~num~0=v_~num~0_In_1} AuxVars[] AssignedVars[][41], [42#L894-2true, 88#true, 77#(= ~total~0 0), 12#L915-1true, Black: 72#(= ~num~0 0), 86#(= ~num~0 1), 81#(= thread2Thread1of1ForFork0_~j~0 0), 10#L881true]) [2024-02-07 14:55:21,622 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-07 14:55:21,622 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-07 14:55:21,623 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-02-07 14:55:21,623 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-02-07 14:55:21,748 INFO L124 PetriNetUnfolderBase]: 1002/2188 cut-off events. [2024-02-07 14:55:21,749 INFO L125 PetriNetUnfolderBase]: For 453/471 co-relation queries the response was YES. [2024-02-07 14:55:21,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4645 conditions, 2188 events. 1002/2188 cut-off events. For 453/471 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12459 event pairs, 516 based on Foata normal form. 10/2098 useless extension candidates. Maximal degree in co-relation 2143. Up to 1459 conditions per place. [2024-02-07 14:55:21,763 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 52 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-02-07 14:55:21,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 339 flow [2024-02-07 14:55:21,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:55:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:55:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2024-02-07 14:55:21,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2024-02-07 14:55:21,766 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 168 flow. Second operand 3 states and 150 transitions. [2024-02-07 14:55:21,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 339 flow [2024-02-07 14:55:21,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 329 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 14:55:21,769 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 176 flow [2024-02-07 14:55:21,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-02-07 14:55:21,770 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2024-02-07 14:55:21,770 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 176 flow [2024-02-07 14:55:21,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:21,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:55:21,771 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-02-07 14:55:21,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:55:21,772 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 14:55:21,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:55:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1260589313, now seen corresponding path program 1 times [2024-02-07 14:55:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:55:21,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514522146] [2024-02-07 14:55:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:55:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:21,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:55:21,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514522146] [2024-02-07 14:55:21,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514522146] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:55:21,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:55:21,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:55:21,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599128079] [2024-02-07 14:55:21,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:55:21,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:55:21,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:55:21,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:55:21,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:55:21,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2024-02-07 14:55:21,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:21,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:55:21,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2024-02-07 14:55:21,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:55:22,054 INFO L124 PetriNetUnfolderBase]: 477/1159 cut-off events. [2024-02-07 14:55:22,054 INFO L125 PetriNetUnfolderBase]: For 291/332 co-relation queries the response was YES. [2024-02-07 14:55:22,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2546 conditions, 1159 events. 477/1159 cut-off events. For 291/332 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5707 event pairs, 184 based on Foata normal form. 70/1208 useless extension candidates. Maximal degree in co-relation 1943. Up to 449 conditions per place. [2024-02-07 14:55:22,061 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 41 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2024-02-07 14:55:22,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 316 flow [2024-02-07 14:55:22,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:55:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:55:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2024-02-07 14:55:22,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7424242424242424 [2024-02-07 14:55:22,062 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 176 flow. Second operand 3 states and 147 transitions. [2024-02-07 14:55:22,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 316 flow [2024-02-07 14:55:22,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 308 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-02-07 14:55:22,065 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 178 flow [2024-02-07 14:55:22,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-02-07 14:55:22,066 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2024-02-07 14:55:22,066 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 178 flow [2024-02-07 14:55:22,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:22,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:55:22,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:55:22,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:55:22,067 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 14:55:22,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:55:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2001813093, now seen corresponding path program 1 times [2024-02-07 14:55:22,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:55:22,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779759474] [2024-02-07 14:55:22,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:22,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:55:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:22,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:55:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779759474] [2024-02-07 14:55:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779759474] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:55:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612904742] [2024-02-07 14:55:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:22,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:55:22,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:55:22,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:55:22,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-07 14:55:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:22,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 14:55:22,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:55:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:22,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:55:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:22,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612904742] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:55:22,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:55:22,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-07 14:55:22,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138554065] [2024-02-07 14:55:22,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:55:22,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:55:22,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:55:22,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:55:22,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:55:22,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2024-02-07 14:55:22,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:22,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:55:22,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2024-02-07 14:55:22,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:55:22,620 INFO L124 PetriNetUnfolderBase]: 889/1932 cut-off events. [2024-02-07 14:55:22,620 INFO L125 PetriNetUnfolderBase]: For 766/820 co-relation queries the response was YES. [2024-02-07 14:55:22,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4633 conditions, 1932 events. 889/1932 cut-off events. For 766/820 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8840 event pairs, 165 based on Foata normal form. 64/1930 useless extension candidates. Maximal degree in co-relation 1574. Up to 400 conditions per place. [2024-02-07 14:55:22,631 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 94 selfloop transitions, 9 changer transitions 0/123 dead transitions. [2024-02-07 14:55:22,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 123 transitions, 628 flow [2024-02-07 14:55:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:55:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:55:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 282 transitions. [2024-02-07 14:55:22,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2024-02-07 14:55:22,633 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 178 flow. Second operand 6 states and 282 transitions. [2024-02-07 14:55:22,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 123 transitions, 628 flow [2024-02-07 14:55:22,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 123 transitions, 596 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:55:22,637 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 220 flow [2024-02-07 14:55:22,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2024-02-07 14:55:22,637 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 8 predicate places. [2024-02-07 14:55:22,638 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 220 flow [2024-02-07 14:55:22,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:22,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:55:22,638 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:55:22,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-07 14:55:22,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:55:22,854 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 14:55:22,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:55:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash 468669487, now seen corresponding path program 1 times [2024-02-07 14:55:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:55:22,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028464755] [2024-02-07 14:55:22,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:22,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:55:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:55:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028464755] [2024-02-07 14:55:22,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028464755] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:55:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541907991] [2024-02-07 14:55:22,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:22,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:55:22,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:55:22,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:55:23,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-07 14:55:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:23,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-07 14:55:23,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:55:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:23,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-07 14:55:23,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541907991] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:55:23,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-07 14:55:23,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-02-07 14:55:23,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652036001] [2024-02-07 14:55:23,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:55:23,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:55:23,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:55:23,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:55:23,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:55:23,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2024-02-07 14:55:23,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:23,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:55:23,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2024-02-07 14:55:23,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:55:23,440 INFO L124 PetriNetUnfolderBase]: 848/1870 cut-off events. [2024-02-07 14:55:23,440 INFO L125 PetriNetUnfolderBase]: For 1162/1180 co-relation queries the response was YES. [2024-02-07 14:55:23,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4623 conditions, 1870 events. 848/1870 cut-off events. For 1162/1180 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8635 event pairs, 164 based on Foata normal form. 0/1862 useless extension candidates. Maximal degree in co-relation 2294. Up to 750 conditions per place. [2024-02-07 14:55:23,451 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 74 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2024-02-07 14:55:23,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 102 transitions, 536 flow [2024-02-07 14:55:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:55:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:55:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-02-07 14:55:23,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-02-07 14:55:23,452 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 220 flow. Second operand 5 states and 228 transitions. [2024-02-07 14:55:23,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 102 transitions, 536 flow [2024-02-07 14:55:23,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 102 transitions, 513 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-02-07 14:55:23,456 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 217 flow [2024-02-07 14:55:23,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2024-02-07 14:55:23,457 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 11 predicate places. [2024-02-07 14:55:23,457 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 217 flow [2024-02-07 14:55:23,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:23,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:55:23,457 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:55:23,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-07 14:55:23,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-02-07 14:55:23,675 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 14:55:23,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:55:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash -449739508, now seen corresponding path program 1 times [2024-02-07 14:55:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:55:23,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214069200] [2024-02-07 14:55:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:55:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:23,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:55:23,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214069200] [2024-02-07 14:55:23,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214069200] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:55:23,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900296935] [2024-02-07 14:55:23,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:23,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:55:23,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:55:23,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:55:23,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-07 14:55:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:23,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-07 14:55:23,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:55:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:55:23,944 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-07 14:55:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900296935] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:55:23,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-07 14:55:23,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-02-07 14:55:23,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693633264] [2024-02-07 14:55:23,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:55:23,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:55:23,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:55:23,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:55:23,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:55:23,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2024-02-07 14:55:23,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:23,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:55:23,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2024-02-07 14:55:23,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:55:24,201 INFO L124 PetriNetUnfolderBase]: 793/1784 cut-off events. [2024-02-07 14:55:24,201 INFO L125 PetriNetUnfolderBase]: For 1511/1511 co-relation queries the response was YES. [2024-02-07 14:55:24,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4423 conditions, 1784 events. 793/1784 cut-off events. For 1511/1511 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8192 event pairs, 115 based on Foata normal form. 76/1850 useless extension candidates. Maximal degree in co-relation 2268. Up to 620 conditions per place. [2024-02-07 14:55:24,209 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 68 selfloop transitions, 6 changer transitions 6/100 dead transitions. [2024-02-07 14:55:24,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 519 flow [2024-02-07 14:55:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:55:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:55:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-02-07 14:55:24,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6878787878787879 [2024-02-07 14:55:24,214 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 217 flow. Second operand 5 states and 227 transitions. [2024-02-07 14:55:24,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 519 flow [2024-02-07 14:55:24,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 505 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-07 14:55:24,219 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 215 flow [2024-02-07 14:55:24,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2024-02-07 14:55:24,220 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 11 predicate places. [2024-02-07 14:55:24,220 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 215 flow [2024-02-07 14:55:24,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:24,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:55:24,221 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:55:24,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-07 14:55:24,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:55:24,435 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 14:55:24,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:55:24,435 INFO L85 PathProgramCache]: Analyzing trace with hash -190814271, now seen corresponding path program 1 times [2024-02-07 14:55:24,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:55:24,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266968786] [2024-02-07 14:55:24,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:24,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:55:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-02-07 14:55:24,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:55:24,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266968786] [2024-02-07 14:55:24,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266968786] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:55:24,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:55:24,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:55:24,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520724311] [2024-02-07 14:55:24,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:55:24,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:55:24,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:55:24,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:55:24,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:55:24,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2024-02-07 14:55:24,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:24,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:55:24,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2024-02-07 14:55:24,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:55:24,787 INFO L124 PetriNetUnfolderBase]: 811/1774 cut-off events. [2024-02-07 14:55:24,787 INFO L125 PetriNetUnfolderBase]: For 1713/1717 co-relation queries the response was YES. [2024-02-07 14:55:24,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4720 conditions, 1774 events. 811/1774 cut-off events. For 1713/1717 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7815 event pairs, 147 based on Foata normal form. 0/1762 useless extension candidates. Maximal degree in co-relation 2390. Up to 934 conditions per place. [2024-02-07 14:55:24,799 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 63 selfloop transitions, 7 changer transitions 3/92 dead transitions. [2024-02-07 14:55:24,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 92 transitions, 481 flow [2024-02-07 14:55:24,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:55:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:55:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2024-02-07 14:55:24,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6757575757575758 [2024-02-07 14:55:24,801 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 215 flow. Second operand 5 states and 223 transitions. [2024-02-07 14:55:24,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 92 transitions, 481 flow [2024-02-07 14:55:24,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 92 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:55:24,805 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 224 flow [2024-02-07 14:55:24,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2024-02-07 14:55:24,807 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 12 predicate places. [2024-02-07 14:55:24,807 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 224 flow [2024-02-07 14:55:24,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:24,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:55:24,808 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:55:24,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:55:24,808 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 14:55:24,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:55:24,809 INFO L85 PathProgramCache]: Analyzing trace with hash -693579335, now seen corresponding path program 1 times [2024-02-07 14:55:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:55:24,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443086340] [2024-02-07 14:55:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:55:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:55:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-02-07 14:55:24,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:55:24,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443086340] [2024-02-07 14:55:24,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443086340] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:55:24,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:55:24,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:55:24,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753460375] [2024-02-07 14:55:24,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:55:24,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:55:24,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:55:24,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:55:24,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:55:24,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2024-02-07 14:55:24,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:24,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:55:24,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2024-02-07 14:55:24,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:55:25,159 INFO L124 PetriNetUnfolderBase]: 658/1533 cut-off events. [2024-02-07 14:55:25,159 INFO L125 PetriNetUnfolderBase]: For 2001/2001 co-relation queries the response was YES. [2024-02-07 14:55:25,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4046 conditions, 1533 events. 658/1533 cut-off events. For 2001/2001 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6941 event pairs, 458 based on Foata normal form. 4/1533 useless extension candidates. Maximal degree in co-relation 2044. Up to 1058 conditions per place. [2024-02-07 14:55:25,169 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 44 selfloop transitions, 1 changer transitions 1/65 dead transitions. [2024-02-07 14:55:25,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 65 transitions, 347 flow [2024-02-07 14:55:25,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:55:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:55:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2024-02-07 14:55:25,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-07 14:55:25,170 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 224 flow. Second operand 3 states and 132 transitions. [2024-02-07 14:55:25,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 65 transitions, 347 flow [2024-02-07 14:55:25,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 65 transitions, 331 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-02-07 14:55:25,174 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 204 flow [2024-02-07 14:55:25,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2024-02-07 14:55:25,175 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 7 predicate places. [2024-02-07 14:55:25,175 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 204 flow [2024-02-07 14:55:25,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:55:25,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:55:25,176 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:55:25,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 14:55:25,176 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 22 more)] === [2024-02-07 14:55:25,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:55:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1220197263, now seen corresponding path program 1 times [2024-02-07 14:55:25,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:55:25,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188722691] [2024-02-07 14:55:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:55:25,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:55:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:55:25,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:55:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:55:25,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:55:25,292 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:55:25,293 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (24 of 25 remaining) [2024-02-07 14:55:25,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 25 remaining) [2024-02-07 14:55:25,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 25 remaining) [2024-02-07 14:55:25,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 25 remaining) [2024-02-07 14:55:25,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 25 remaining) [2024-02-07 14:55:25,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 25 remaining) [2024-02-07 14:55:25,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 25 remaining) [2024-02-07 14:55:25,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 25 remaining) [2024-02-07 14:55:25,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 25 remaining) [2024-02-07 14:55:25,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 25 remaining) [2024-02-07 14:55:25,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 25 remaining) [2024-02-07 14:55:25,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 25 remaining) [2024-02-07 14:55:25,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 25 remaining) [2024-02-07 14:55:25,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 25 remaining) [2024-02-07 14:55:25,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 25 remaining) [2024-02-07 14:55:25,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 25 remaining) [2024-02-07 14:55:25,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 25 remaining) [2024-02-07 14:55:25,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 25 remaining) [2024-02-07 14:55:25,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 25 remaining) [2024-02-07 14:55:25,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 25 remaining) [2024-02-07 14:55:25,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 25 remaining) [2024-02-07 14:55:25,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 25 remaining) [2024-02-07 14:55:25,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 25 remaining) [2024-02-07 14:55:25,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 25 remaining) [2024-02-07 14:55:25,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 25 remaining) [2024-02-07 14:55:25,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 14:55:25,299 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:55:25,304 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:55:25,304 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:55:25,396 INFO L503 ceAbstractionStarter]: Automizer considered 13 witness invariants [2024-02-07 14:55:25,397 INFO L504 ceAbstractionStarter]: WitnessConsidered=13 [2024-02-07 14:55:25,397 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:55:25 BasicIcfg [2024-02-07 14:55:25,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:55:25,398 INFO L158 Benchmark]: Toolchain (without parser) took 7710.53ms. Allocated memory was 132.1MB in the beginning and 270.5MB in the end (delta: 138.4MB). Free memory was 103.3MB in the beginning and 113.6MB in the end (delta: -10.3MB). Peak memory consumption was 127.7MB. Max. memory is 16.1GB. [2024-02-07 14:55:25,398 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 132.1MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:55:25,399 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 132.1MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:55:25,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 661.85ms. Allocated memory is still 132.1MB. Free memory was 103.3MB in the beginning and 68.7MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-02-07 14:55:25,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.24ms. Allocated memory is still 132.1MB. Free memory was 68.7MB in the beginning and 66.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:55:25,399 INFO L158 Benchmark]: Boogie Preprocessor took 45.42ms. Allocated memory is still 132.1MB. Free memory was 66.0MB in the beginning and 63.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:55:25,400 INFO L158 Benchmark]: RCFGBuilder took 713.20ms. Allocated memory is still 132.1MB. Free memory was 63.0MB in the beginning and 53.5MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-02-07 14:55:25,400 INFO L158 Benchmark]: TraceAbstraction took 6242.25ms. Allocated memory was 132.1MB in the beginning and 270.5MB in the end (delta: 138.4MB). Free memory was 53.0MB in the beginning and 113.6MB in the end (delta: -60.6MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2024-02-07 14:55:25,401 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 132.1MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.18ms. Allocated memory is still 132.1MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 661.85ms. Allocated memory is still 132.1MB. Free memory was 103.3MB in the beginning and 68.7MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.24ms. Allocated memory is still 132.1MB. Free memory was 68.7MB in the beginning and 66.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.42ms. Allocated memory is still 132.1MB. Free memory was 66.0MB in the beginning and 63.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 713.20ms. Allocated memory is still 132.1MB. Free memory was 63.0MB in the beginning and 53.5MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6242.25ms. Allocated memory was 132.1MB in the beginning and 270.5MB in the end (delta: 138.4MB). Free memory was 53.0MB in the beginning and 113.6MB in the end (delta: -60.6MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=0] [L909] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] [L909] 0 total = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=0] [L910] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[total],IntegerLiteral[0UL]]]] [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=0] [L915] 0 \read(t1) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L882] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L883] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L896] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L897] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]]]] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L898] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L883] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L896] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=1] [L897] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]]]] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L898] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L883] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]]]] VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2]]]]]] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, t1={6:0}, t2={7:0}, total=1] [L916] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L896] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]] [L896] 2 total = total + j VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=3] [L897] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[1]]]] [L897] 2 num-- VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L898] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[num],IntegerLiteral[0]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[j]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]],BinaryExpression[COMPLEQ,IdentifierExpression[j],IntegerLiteral[2]]]]]] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L902] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[3]]]] [L902] 2 total = total + j [L903] 2 flag = 1 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L904] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[flag]],BinaryExpression[COMPLEQ,IdentifierExpression[flag],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[1]]]]]] [L904] 2 return ((void *)0); [L916] 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}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] [L917] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[flag]],BinaryExpression[COMPLEQ,IdentifierExpression[flag],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[1]]]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] [L917] COND TRUE 0 \read(flag) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] [L918] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[flag]],BinaryExpression[COMPLEQ,IdentifierExpression[flag],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[flag],IntegerLiteral[1]]]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] - UnprovableResult [Line: 882]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 883]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 896]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 897]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 898]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 900]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 909]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 910]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 914]: 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: 913]: 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, 101 locations, 25 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.0s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 471 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 415 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1159 IncrementalHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 20 mSDtfsCounter, 1159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=10, InterpolantAutomatonStates: 43, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 402 ConstructedInterpolants, 0 QuantifiedInterpolants, 894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 133/157 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 14:55:25,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE