./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/singleton.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/singleton.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d8006e4b 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/singleton.i ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/singleton.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-d8006e4-m [2024-02-05 10:37:39,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-05 10:37:39,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-05 10:37:39,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-05 10:37:39,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-05 10:37:39,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-05 10:37:39,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-05 10:37:39,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-05 10:37:39,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-05 10:37:39,704 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-05 10:37:39,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-05 10:37:39,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-05 10:37:39,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-05 10:37:39,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-05 10:37:39,707 INFO L153 SettingsManager]: * Use SBE=true [2024-02-05 10:37:39,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-05 10:37:39,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-05 10:37:39,707 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-05 10:37:39,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-05 10:37:39,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-05 10:37:39,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-05 10:37:39,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-05 10:37:39,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-05 10:37:39,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-05 10:37:39,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-05 10:37:39,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-05 10:37:39,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-05 10:37:39,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-05 10:37:39,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-05 10:37:39,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-05 10:37:39,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-05 10:37:39,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-05 10:37:39,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:37:39,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-05 10:37:39,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-05 10:37:39,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-05 10:37:39,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-05 10:37:39,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-05 10:37:39,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-05 10:37:39,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-05 10:37:39,713 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-05 10:37:39,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-05 10:37:39,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-05 10:37:39,714 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-05 10:37:39,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-05 10:37:39,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-05 10:37:39,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-05 10:37:39,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-05 10:37:39,942 INFO L274 PluginConnector]: CDTParser initialized [2024-02-05 10:37:39,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2024-02-05 10:37:40,988 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-05 10:37:41,245 INFO L384 CDTParser]: Found 1 translation units. [2024-02-05 10:37:41,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2024-02-05 10:37:41,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d835eb08/58a8ba1281dc4680a2c79869c661db1d/FLAGfd1142adc [2024-02-05 10:37:41,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d835eb08/58a8ba1281dc4680a2c79869c661db1d [2024-02-05 10:37:41,283 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-05 10:37:41,283 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-05 10:37:41,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/singleton.yml/witness.yml [2024-02-05 10:37:41,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-05 10:37:41,349 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-05 10:37:41,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-05 10:37:41,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-05 10:37:41,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-05 10:37:41,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:37:41" (1/2) ... [2024-02-05 10:37:41,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf8db05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:41, skipping insertion in model container [2024-02-05 10:37:41,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:37:41" (1/2) ... [2024-02-05 10:37:41,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7f0ee7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:37:41, skipping insertion in model container [2024-02-05 10:37:41,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:37:41" (2/2) ... [2024-02-05 10:37:41,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf8db05 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:41, skipping insertion in model container [2024-02-05 10:37:41,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:37:41" (2/2) ... [2024-02-05 10:37:41,359 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-05 10:37:41,423 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-05 10:37:41,424 INFO L101 nessWitnessExtractor]: Location invariant before [L1162-L1162] v == 0 [2024-02-05 10:37:41,424 INFO L101 nessWitnessExtractor]: Location invariant before [L1135-L1135] (unsigned long )arg == 0UL [2024-02-05 10:37:41,424 INFO L101 nessWitnessExtractor]: Location invariant before [L1155-L1155] (unsigned long )arg == 0UL [2024-02-05 10:37:41,425 INFO L101 nessWitnessExtractor]: Location invariant before [L1123-L1123] expression == 1 [2024-02-05 10:37:41,425 INFO L101 nessWitnessExtractor]: Location invariant before [L1154-L1154] (unsigned long )arg == 0UL [2024-02-05 10:37:41,425 INFO L101 nessWitnessExtractor]: Location invariant after [L1123-L1123] expression == 0 [2024-02-05 10:37:41,425 INFO L101 nessWitnessExtractor]: Location invariant before [L1147-L1147] (unsigned long )arg == 0UL [2024-02-05 10:37:41,425 INFO L101 nessWitnessExtractor]: Location invariant before [L1152-L1152] (unsigned long )arg == 0UL [2024-02-05 10:37:41,425 INFO L101 nessWitnessExtractor]: Location invariant before [L1153-L1153] (unsigned long )arg == 0UL [2024-02-05 10:37:41,425 INFO L101 nessWitnessExtractor]: Location invariant before [L1151-L1151] (unsigned long )arg == 0UL [2024-02-05 10:37:41,426 INFO L101 nessWitnessExtractor]: Location invariant after [L1123-L1123] expression == 1 [2024-02-05 10:37:41,426 INFO L101 nessWitnessExtractor]: Location invariant before [L1123-L1123] expression == 0 [2024-02-05 10:37:41,426 INFO L101 nessWitnessExtractor]: Location invariant before [L1141-L1141] (unsigned long )arg == 0UL [2024-02-05 10:37:41,426 INFO L101 nessWitnessExtractor]: Location invariant before [L1134-L1134] (unsigned long )arg == 0UL [2024-02-05 10:37:41,426 INFO L101 nessWitnessExtractor]: Location invariant before [L1140-L1140] (unsigned long )arg == 0UL [2024-02-05 10:37:41,426 INFO L101 nessWitnessExtractor]: Location invariant after [L1123-L1123] expression == 1 [2024-02-05 10:37:41,426 INFO L101 nessWitnessExtractor]: Location invariant before [L1123-L1123] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-05 10:37:41,426 INFO L101 nessWitnessExtractor]: Location invariant before [L1133-L1133] (unsigned long )arg == 0UL [2024-02-05 10:37:41,427 INFO L101 nessWitnessExtractor]: Location invariant before [L1127-L1127] (unsigned long )arg == 0UL [2024-02-05 10:37:41,427 INFO L101 nessWitnessExtractor]: Location invariant before [L1128-L1128] (unsigned long )arg == 0UL [2024-02-05 10:37:41,427 INFO L101 nessWitnessExtractor]: Location invariant before [L1132-L1132] (unsigned long )arg == 0UL [2024-02-05 10:37:41,427 INFO L101 nessWitnessExtractor]: Location invariant before [L1150-L1150] (unsigned long )arg == 0UL [2024-02-05 10:37:41,428 INFO L101 nessWitnessExtractor]: Location invariant before [L1157-L1157] (unsigned long )arg == 0UL [2024-02-05 10:37:41,428 INFO L101 nessWitnessExtractor]: Location invariant before [L1139-L1139] (unsigned long )arg == 0UL [2024-02-05 10:37:41,428 INFO L101 nessWitnessExtractor]: Location invariant before [L1156-L1156] (unsigned long )arg == 0UL [2024-02-05 10:37:41,428 INFO L101 nessWitnessExtractor]: Location invariant before [L1148-L1148] (unsigned long )arg == 0UL [2024-02-05 10:37:41,428 INFO L101 nessWitnessExtractor]: Location invariant before [L1142-L1142] (unsigned long )arg == 0UL [2024-02-05 10:37:41,429 INFO L101 nessWitnessExtractor]: Location invariant before [L1149-L1149] (unsigned long )arg == 0UL [2024-02-05 10:37:41,556 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-02-05 10:37:42,004 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/singleton.i[55547,55560] [2024-02-05 10:37:42,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:37:42,034 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-05 10:37:42,085 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/singleton.i[55547,55560] Start Parsing Local Start Parsing Local [2024-02-05 10:37:42,087 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-05 10:37:42,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:37:42,168 INFO L208 MainTranslator]: Completed translation [2024-02-05 10:37:42,169 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:42 WrapperNode [2024-02-05 10:37:42,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-05 10:37:42,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-05 10:37:42,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-05 10:37:42,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-05 10:37:42,175 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 05.02 10:37:42" (1/1) ... [2024-02-05 10:37:42,208 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 05.02 10:37:42" (1/1) ... [2024-02-05 10:37:42,222 INFO L138 Inliner]: procedures = 324, calls = 51, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2024-02-05 10:37:42,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-05 10:37:42,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-05 10:37:42,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-05 10:37:42,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-05 10:37:42,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:42" (1/1) ... [2024-02-05 10:37:42,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:42" (1/1) ... [2024-02-05 10:37:42,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:42" (1/1) ... [2024-02-05 10:37:42,265 INFO L175 MemorySlicer]: Split 17 memory accesses to 8 slices as follows [2, 3, 2, 2, 2, 2, 2, 2]. 18 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0]. The 8 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1]. [2024-02-05 10:37:42,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:42" (1/1) ... [2024-02-05 10:37:42,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:42" (1/1) ... [2024-02-05 10:37:42,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:42" (1/1) ... [2024-02-05 10:37:42,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:42" (1/1) ... [2024-02-05 10:37:42,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:42" (1/1) ... [2024-02-05 10:37:42,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:42" (1/1) ... [2024-02-05 10:37:42,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-05 10:37:42,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-05 10:37:42,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-05 10:37:42,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-05 10:37:42,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:42" (1/1) ... [2024-02-05 10:37:42,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:37:42,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:37:42,346 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-05 10:37:42,367 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-05 10:37:42,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-05 10:37:42,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-05 10:37:42,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-05 10:37:42,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-05 10:37:42,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-05 10:37:42,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-05 10:37:42,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-05 10:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-05 10:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-05 10:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-05 10:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-02-05 10:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-02-05 10:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2024-02-05 10:37:42,384 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2024-02-05 10:37:42,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-05 10:37:42,385 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-05 10:37:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-05 10:37:42,385 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-05 10:37:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-05 10:37:42,385 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-05 10:37:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-05 10:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-05 10:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-05 10:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-05 10:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-05 10:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-05 10:37:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-02-05 10:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-02-05 10:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-05 10:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-05 10:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-05 10:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-05 10:37:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-05 10:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-05 10:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-05 10:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-05 10:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-02-05 10:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-02-05 10:37:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-05 10:37:42,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-05 10:37:42,392 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-05 10:37:42,550 INFO L244 CfgBuilder]: Building ICFG [2024-02-05 10:37:42,552 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-05 10:37:42,794 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-05 10:37:42,795 INFO L293 CfgBuilder]: Performing block encoding [2024-02-05 10:37:42,914 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-05 10:37:42,914 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-05 10:37:42,914 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:37:42 BoogieIcfgContainer [2024-02-05 10:37:42,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-05 10:37:42,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-05 10:37:42,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-05 10:37:42,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-05 10:37:42,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:37:41" (1/4) ... [2024-02-05 10:37:42,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58086466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:37:42, skipping insertion in model container [2024-02-05 10:37:42,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:37:41" (2/4) ... [2024-02-05 10:37:42,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58086466 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:37:42, skipping insertion in model container [2024-02-05 10:37:42,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:37:42" (3/4) ... [2024-02-05 10:37:42,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58086466 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:37:42, skipping insertion in model container [2024-02-05 10:37:42,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:37:42" (4/4) ... [2024-02-05 10:37:42,923 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton.i [2024-02-05 10:37:42,936 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-05 10:37:42,936 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-02-05 10:37:42,937 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-05 10:37:43,067 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-02-05 10:37:43,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 399 flow [2024-02-05 10:37:43,167 INFO L124 PetriNetUnfolderBase]: 6/102 cut-off events. [2024-02-05 10:37:43,168 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-05 10:37:43,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 102 events. 6/102 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 145 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 106. Up to 3 conditions per place. [2024-02-05 10:37:43,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 151 transitions, 399 flow [2024-02-05 10:37:43,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 101 transitions, 253 flow [2024-02-05 10:37:43,188 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-05 10:37:43,194 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;@200e463, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-05 10:37:43,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2024-02-05 10:37:43,196 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-05 10:37:43,196 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-05 10:37:43,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:37:43,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:43,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-05 10:37:43,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-05 10:37:43,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash 10285, now seen corresponding path program 1 times [2024-02-05 10:37:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:43,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852598636] [2024-02-05 10:37:43,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:43,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:43,384 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-05 10:37:43,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:43,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852598636] [2024-02-05 10:37:43,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852598636] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:43,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:43,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:37:43,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853966518] [2024-02-05 10:37:43,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:43,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:37:43,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:43,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:37:43,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:37:43,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 153 [2024-02-05 10:37:43,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 101 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-05 10:37:43,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:43,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 153 [2024-02-05 10:37:43,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:44,603 INFO L124 PetriNetUnfolderBase]: 7191/10960 cut-off events. [2024-02-05 10:37:44,603 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2024-02-05 10:37:44,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21262 conditions, 10960 events. 7191/10960 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 73656 event pairs, 5813 based on Foata normal form. 1/8338 useless extension candidates. Maximal degree in co-relation 21233. Up to 9585 conditions per place. [2024-02-05 10:37:44,676 INFO L140 encePairwiseOnDemand]: 145/153 looper letters, 53 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2024-02-05 10:37:44,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 98 transitions, 357 flow [2024-02-05 10:37:44,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:37:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:37:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2024-02-05 10:37:44,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5708061002178649 [2024-02-05 10:37:44,688 INFO L175 Difference]: Start difference. First operand has 114 places, 101 transitions, 253 flow. Second operand 3 states and 262 transitions. [2024-02-05 10:37:44,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 98 transitions, 357 flow [2024-02-05 10:37:44,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 98 transitions, 323 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-02-05 10:37:44,702 INFO L231 Difference]: Finished difference. Result has 99 places, 95 transitions, 211 flow [2024-02-05 10:37:44,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=99, PETRI_TRANSITIONS=95} [2024-02-05 10:37:44,706 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -15 predicate places. [2024-02-05 10:37:44,706 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 95 transitions, 211 flow [2024-02-05 10:37:44,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-05 10:37:44,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:44,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-05 10:37:44,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-05 10:37:44,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-05 10:37:44,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash 306859334, now seen corresponding path program 1 times [2024-02-05 10:37:44,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:44,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297839429] [2024-02-05 10:37:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:44,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:37:44,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297839429] [2024-02-05 10:37:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297839429] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:44,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:44,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:44,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44591973] [2024-02-05 10:37:44,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:44,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:44,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:44,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:44,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:44,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 153 [2024-02-05 10:37:44,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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-05 10:37:44,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:44,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 153 [2024-02-05 10:37:44,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:45,619 INFO L124 PetriNetUnfolderBase]: 7191/10301 cut-off events. [2024-02-05 10:37:45,620 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-02-05 10:37:45,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20087 conditions, 10301 events. 7191/10301 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 62962 event pairs, 5816 based on Foata normal form. 0/7678 useless extension candidates. Maximal degree in co-relation 11202. Up to 9599 conditions per place. [2024-02-05 10:37:45,719 INFO L140 encePairwiseOnDemand]: 140/153 looper letters, 51 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2024-02-05 10:37:45,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 297 flow [2024-02-05 10:37:45,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 292 transitions. [2024-02-05 10:37:45,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477124183006536 [2024-02-05 10:37:45,725 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 211 flow. Second operand 4 states and 292 transitions. [2024-02-05 10:37:45,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 297 flow [2024-02-05 10:37:45,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 85 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:37:45,727 INFO L231 Difference]: Finished difference. Result has 89 places, 84 transitions, 189 flow [2024-02-05 10:37:45,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=89, PETRI_TRANSITIONS=84} [2024-02-05 10:37:45,728 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -25 predicate places. [2024-02-05 10:37:45,728 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 84 transitions, 189 flow [2024-02-05 10:37:45,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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-05 10:37:45,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:45,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:37:45,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-05 10:37:45,729 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-05 10:37:45,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1956477425, now seen corresponding path program 1 times [2024-02-05 10:37:45,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:45,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051189184] [2024-02-05 10:37:45,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:45,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:45,837 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-05 10:37:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051189184] [2024-02-05 10:37:45,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051189184] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:45,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:45,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:45,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722381127] [2024-02-05 10:37:45,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:45,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:45,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:45,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:45,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:45,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2024-02-05 10:37:45,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-05 10:37:45,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:45,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2024-02-05 10:37:45,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:46,492 INFO L124 PetriNetUnfolderBase]: 7198/10308 cut-off events. [2024-02-05 10:37:46,492 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-02-05 10:37:46,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20103 conditions, 10308 events. 7198/10308 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 62939 event pairs, 5810 based on Foata normal form. 0/7687 useless extension candidates. Maximal degree in co-relation 20084. Up to 9597 conditions per place. [2024-02-05 10:37:46,545 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 55 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2024-02-05 10:37:46,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 86 transitions, 307 flow [2024-02-05 10:37:46,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2024-02-05 10:37:46,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212418300653595 [2024-02-05 10:37:46,546 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 189 flow. Second operand 4 states and 319 transitions. [2024-02-05 10:37:46,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 86 transitions, 307 flow [2024-02-05 10:37:46,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:37:46,550 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 186 flow [2024-02-05 10:37:46,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2024-02-05 10:37:46,551 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -26 predicate places. [2024-02-05 10:37:46,551 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 186 flow [2024-02-05 10:37:46,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-05 10:37:46,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:46,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:37:46,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-05 10:37:46,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-05 10:37:46,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:46,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2006888034, now seen corresponding path program 1 times [2024-02-05 10:37:46,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:46,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076440742] [2024-02-05 10:37:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:46,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:46,661 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-05 10:37:46,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:46,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076440742] [2024-02-05 10:37:46,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076440742] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:46,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:46,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:46,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838466918] [2024-02-05 10:37:46,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:46,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:46,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:46,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:46,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2024-02-05 10:37:46,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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-05 10:37:46,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:46,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2024-02-05 10:37:46,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:47,278 INFO L124 PetriNetUnfolderBase]: 7191/10423 cut-off events. [2024-02-05 10:37:47,278 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:37:47,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20208 conditions, 10423 events. 7191/10423 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 66330 event pairs, 921 based on Foata normal form. 510/9036 useless extension candidates. Maximal degree in co-relation 20190. Up to 7885 conditions per place. [2024-02-05 10:37:47,327 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 72 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-02-05 10:37:47,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 101 transitions, 375 flow [2024-02-05 10:37:47,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-02-05 10:37:47,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2024-02-05 10:37:47,335 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 186 flow. Second operand 4 states and 337 transitions. [2024-02-05 10:37:47,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 101 transitions, 375 flow [2024-02-05 10:37:47,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 101 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:37:47,337 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 181 flow [2024-02-05 10:37:47,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2024-02-05 10:37:47,339 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -28 predicate places. [2024-02-05 10:37:47,339 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 181 flow [2024-02-05 10:37:47,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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-05 10:37:47,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:47,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:37:47,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-05 10:37:47,340 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-05 10:37:47,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash 742818681, now seen corresponding path program 1 times [2024-02-05 10:37:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:47,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854065770] [2024-02-05 10:37:47,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:47,469 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-05 10:37:47,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:47,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854065770] [2024-02-05 10:37:47,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854065770] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:47,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:47,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:47,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797750274] [2024-02-05 10:37:47,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:47,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:47,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:47,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:47,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:47,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2024-02-05 10:37:47,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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-05 10:37:47,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:47,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2024-02-05 10:37:47,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:47,944 INFO L124 PetriNetUnfolderBase]: 5528/8020 cut-off events. [2024-02-05 10:37:47,944 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-02-05 10:37:47,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15592 conditions, 8020 events. 5528/8020 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 44817 event pairs, 2094 based on Foata normal form. 442/7397 useless extension candidates. Maximal degree in co-relation 15574. Up to 5903 conditions per place. [2024-02-05 10:37:47,979 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 72 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2024-02-05 10:37:47,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 99 transitions, 373 flow [2024-02-05 10:37:47,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-02-05 10:37:47,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2024-02-05 10:37:47,981 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 181 flow. Second operand 4 states and 337 transitions. [2024-02-05 10:37:47,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 99 transitions, 373 flow [2024-02-05 10:37:47,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 99 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:37:47,983 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 176 flow [2024-02-05 10:37:47,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2024-02-05 10:37:47,984 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -30 predicate places. [2024-02-05 10:37:47,984 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 176 flow [2024-02-05 10:37:47,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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-05 10:37:47,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:47,984 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] [2024-02-05 10:37:47,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-05 10:37:47,985 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-05 10:37:47,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:47,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1586901252, now seen corresponding path program 1 times [2024-02-05 10:37:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:47,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029883679] [2024-02-05 10:37:47,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:47,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:48,069 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-05 10:37:48,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:48,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029883679] [2024-02-05 10:37:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029883679] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:48,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:48,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:48,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102389740] [2024-02-05 10:37:48,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:48,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:48,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:48,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:48,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:48,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2024-02-05 10:37:48,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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-05 10:37:48,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:48,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2024-02-05 10:37:48,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:48,429 INFO L124 PetriNetUnfolderBase]: 4095/6027 cut-off events. [2024-02-05 10:37:48,430 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-02-05 10:37:48,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11702 conditions, 6027 events. 4095/6027 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 35010 event pairs, 281 based on Foata normal form. 334/5868 useless extension candidates. Maximal degree in co-relation 11684. Up to 4245 conditions per place. [2024-02-05 10:37:48,500 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 72 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2024-02-05 10:37:48,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 97 transitions, 371 flow [2024-02-05 10:37:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-02-05 10:37:48,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2024-02-05 10:37:48,502 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 176 flow. Second operand 4 states and 337 transitions. [2024-02-05 10:37:48,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 97 transitions, 371 flow [2024-02-05 10:37:48,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 97 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:37:48,504 INFO L231 Difference]: Finished difference. Result has 82 places, 73 transitions, 171 flow [2024-02-05 10:37:48,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=82, PETRI_TRANSITIONS=73} [2024-02-05 10:37:48,505 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -32 predicate places. [2024-02-05 10:37:48,505 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 171 flow [2024-02-05 10:37:48,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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-05 10:37:48,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:48,506 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] [2024-02-05 10:37:48,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-05 10:37:48,506 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-05 10:37:48,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash 643951003, now seen corresponding path program 1 times [2024-02-05 10:37:48,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:48,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099401387] [2024-02-05 10:37:48,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:48,602 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-05 10:37:48,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:48,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099401387] [2024-02-05 10:37:48,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099401387] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:48,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:48,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:48,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61839438] [2024-02-05 10:37:48,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:48,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:48,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:48,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:48,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2024-02-05 10:37:48,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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-05 10:37:48,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:48,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2024-02-05 10:37:48,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:48,982 INFO L124 PetriNetUnfolderBase]: 3032/4448 cut-off events. [2024-02-05 10:37:48,982 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-02-05 10:37:48,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8732 conditions, 4448 events. 3032/4448 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 23568 event pairs, 494 based on Foata normal form. 214/4515 useless extension candidates. Maximal degree in co-relation 8714. Up to 2671 conditions per place. [2024-02-05 10:37:49,002 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 72 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-02-05 10:37:49,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 95 transitions, 369 flow [2024-02-05 10:37:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-02-05 10:37:49,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2024-02-05 10:37:49,004 INFO L175 Difference]: Start difference. First operand has 82 places, 73 transitions, 171 flow. Second operand 4 states and 337 transitions. [2024-02-05 10:37:49,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 95 transitions, 369 flow [2024-02-05 10:37:49,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 95 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:37:49,006 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 166 flow [2024-02-05 10:37:49,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2024-02-05 10:37:49,007 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -34 predicate places. [2024-02-05 10:37:49,008 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 166 flow [2024-02-05 10:37:49,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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-05 10:37:49,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:49,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:37:49,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-05 10:37:49,008 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-05 10:37:49,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1270670161, now seen corresponding path program 1 times [2024-02-05 10:37:49,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:49,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907434433] [2024-02-05 10:37:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:49,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:37:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:49,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907434433] [2024-02-05 10:37:49,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907434433] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:49,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:49,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:49,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189637455] [2024-02-05 10:37:49,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:49,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:49,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:49,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:49,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:49,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 153 [2024-02-05 10:37:49,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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-05 10:37:49,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:49,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 153 [2024-02-05 10:37:49,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:49,768 INFO L124 PetriNetUnfolderBase]: 3743/5433 cut-off events. [2024-02-05 10:37:49,768 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-02-05 10:37:49,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10916 conditions, 5433 events. 3743/5433 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 27097 event pairs, 1249 based on Foata normal form. 3/5230 useless extension candidates. Maximal degree in co-relation 10898. Up to 3255 conditions per place. [2024-02-05 10:37:49,781 INFO L140 encePairwiseOnDemand]: 145/153 looper letters, 69 selfloop transitions, 4 changer transitions 13/104 dead transitions. [2024-02-05 10:37:49,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 420 flow [2024-02-05 10:37:49,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 345 transitions. [2024-02-05 10:37:49,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5637254901960784 [2024-02-05 10:37:49,783 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 166 flow. Second operand 4 states and 345 transitions. [2024-02-05 10:37:49,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 420 flow [2024-02-05 10:37:49,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:37:49,786 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 199 flow [2024-02-05 10:37:49,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2024-02-05 10:37:49,789 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -30 predicate places. [2024-02-05 10:37:49,789 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 199 flow [2024-02-05 10:37:49,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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-05 10:37:49,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:49,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:37:49,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-05 10:37:49,790 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-05 10:37:49,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:49,790 INFO L85 PathProgramCache]: Analyzing trace with hash -618533663, now seen corresponding path program 2 times [2024-02-05 10:37:49,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:49,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808483493] [2024-02-05 10:37:49,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:37:50,059 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-05 10:37:50,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:37:50,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808483493] [2024-02-05 10:37:50,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808483493] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:37:50,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:37:50,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:37:50,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909183387] [2024-02-05 10:37:50,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:37:50,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:37:50,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:37:50,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:37:50,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:37:50,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 153 [2024-02-05 10:37:50,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 73 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 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-05 10:37:50,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:37:50,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 153 [2024-02-05 10:37:50,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:37:50,440 INFO L124 PetriNetUnfolderBase]: 3197/4626 cut-off events. [2024-02-05 10:37:50,440 INFO L125 PetriNetUnfolderBase]: For 1917/1917 co-relation queries the response was YES. [2024-02-05 10:37:50,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11036 conditions, 4626 events. 3197/4626 cut-off events. For 1917/1917 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 22753 event pairs, 1269 based on Foata normal form. 2/4422 useless extension candidates. Maximal degree in co-relation 11025. Up to 2693 conditions per place. [2024-02-05 10:37:50,453 INFO L140 encePairwiseOnDemand]: 145/153 looper letters, 60 selfloop transitions, 2 changer transitions 20/98 dead transitions. [2024-02-05 10:37:50,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 98 transitions, 432 flow [2024-02-05 10:37:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:37:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:37:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2024-02-05 10:37:50,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.545751633986928 [2024-02-05 10:37:50,455 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 199 flow. Second operand 4 states and 334 transitions. [2024-02-05 10:37:50,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 98 transitions, 432 flow [2024-02-05 10:37:50,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 98 transitions, 416 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-02-05 10:37:50,459 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 189 flow [2024-02-05 10:37:50,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2024-02-05 10:37:50,460 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -34 predicate places. [2024-02-05 10:37:50,460 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 189 flow [2024-02-05 10:37:50,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 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-05 10:37:50,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:37:50,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:37:50,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-05 10:37:50,461 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 63 more)] === [2024-02-05 10:37:50,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:37:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash -955877365, now seen corresponding path program 1 times [2024-02-05 10:37:50,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:37:50,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826235571] [2024-02-05 10:37:50,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:37:50,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:37:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-05 10:37:50,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-05 10:37:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-05 10:37:50,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-05 10:37:50,574 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-05 10:37:50,575 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (65 of 66 remaining) [2024-02-05 10:37:50,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 66 remaining) [2024-02-05 10:37:50,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 66 remaining) [2024-02-05 10:37:50,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 66 remaining) [2024-02-05 10:37:50,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 66 remaining) [2024-02-05 10:37:50,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 66 remaining) [2024-02-05 10:37:50,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 66 remaining) [2024-02-05 10:37:50,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 66 remaining) [2024-02-05 10:37:50,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 66 remaining) [2024-02-05 10:37:50,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 66 remaining) [2024-02-05 10:37:50,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 66 remaining) [2024-02-05 10:37:50,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 66 remaining) [2024-02-05 10:37:50,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 66 remaining) [2024-02-05 10:37:50,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 66 remaining) [2024-02-05 10:37:50,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 66 remaining) [2024-02-05 10:37:50,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 66 remaining) [2024-02-05 10:37:50,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 66 remaining) [2024-02-05 10:37:50,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 66 remaining) [2024-02-05 10:37:50,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 66 remaining) [2024-02-05 10:37:50,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 66 remaining) [2024-02-05 10:37:50,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 66 remaining) [2024-02-05 10:37:50,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 66 remaining) [2024-02-05 10:37:50,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 66 remaining) [2024-02-05 10:37:50,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 66 remaining) [2024-02-05 10:37:50,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 66 remaining) [2024-02-05 10:37:50,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 66 remaining) [2024-02-05 10:37:50,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 66 remaining) [2024-02-05 10:37:50,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 66 remaining) [2024-02-05 10:37:50,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 66 remaining) [2024-02-05 10:37:50,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 66 remaining) [2024-02-05 10:37:50,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 66 remaining) [2024-02-05 10:37:50,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 66 remaining) [2024-02-05 10:37:50,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 66 remaining) [2024-02-05 10:37:50,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 66 remaining) [2024-02-05 10:37:50,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 66 remaining) [2024-02-05 10:37:50,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 66 remaining) [2024-02-05 10:37:50,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 66 remaining) [2024-02-05 10:37:50,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 66 remaining) [2024-02-05 10:37:50,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 66 remaining) [2024-02-05 10:37:50,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 66 remaining) [2024-02-05 10:37:50,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 66 remaining) [2024-02-05 10:37:50,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 66 remaining) [2024-02-05 10:37:50,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 66 remaining) [2024-02-05 10:37:50,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 66 remaining) [2024-02-05 10:37:50,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 66 remaining) [2024-02-05 10:37:50,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 66 remaining) [2024-02-05 10:37:50,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 66 remaining) [2024-02-05 10:37:50,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 66 remaining) [2024-02-05 10:37:50,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 66 remaining) [2024-02-05 10:37:50,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 66 remaining) [2024-02-05 10:37:50,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 66 remaining) [2024-02-05 10:37:50,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 66 remaining) [2024-02-05 10:37:50,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 66 remaining) [2024-02-05 10:37:50,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 66 remaining) [2024-02-05 10:37:50,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 66 remaining) [2024-02-05 10:37:50,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 66 remaining) [2024-02-05 10:37:50,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 66 remaining) [2024-02-05 10:37:50,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 66 remaining) [2024-02-05 10:37:50,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 66 remaining) [2024-02-05 10:37:50,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 66 remaining) [2024-02-05 10:37:50,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 66 remaining) [2024-02-05 10:37:50,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 66 remaining) [2024-02-05 10:37:50,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 66 remaining) [2024-02-05 10:37:50,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 66 remaining) [2024-02-05 10:37:50,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 66 remaining) [2024-02-05 10:37:50,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 66 remaining) [2024-02-05 10:37:50,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-05 10:37:50,587 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:37:50,593 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-05 10:37:50,593 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-05 10:37:50,676 INFO L503 ceAbstractionStarter]: Automizer considered 25 witness invariants [2024-02-05 10:37:50,676 INFO L504 ceAbstractionStarter]: WitnessConsidered=25 [2024-02-05 10:37:50,677 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:37:50 BasicIcfg [2024-02-05 10:37:50,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-05 10:37:50,678 INFO L158 Benchmark]: Toolchain (without parser) took 9328.87ms. Allocated memory was 132.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 70.6MB in the beginning and 493.9MB in the end (delta: -423.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-02-05 10:37:50,679 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:37:50,679 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:37:50,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 819.37ms. Allocated memory is still 132.1MB. Free memory was 70.4MB in the beginning and 68.4MB in the end (delta: 2.0MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-02-05 10:37:50,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.97ms. Allocated memory is still 132.1MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-05 10:37:50,680 INFO L158 Benchmark]: Boogie Preprocessor took 77.25ms. Allocated memory is still 132.1MB. Free memory was 65.8MB in the beginning and 63.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-05 10:37:50,680 INFO L158 Benchmark]: RCFGBuilder took 612.48ms. Allocated memory was 132.1MB in the beginning and 209.7MB in the end (delta: 77.6MB). Free memory was 63.1MB in the beginning and 165.1MB in the end (delta: -102.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-02-05 10:37:50,680 INFO L158 Benchmark]: TraceAbstraction took 7761.33ms. Allocated memory was 209.7MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 164.0MB in the beginning and 493.9MB in the end (delta: -329.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-02-05 10:37:50,681 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.16ms. Allocated memory is still 132.1MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 819.37ms. Allocated memory is still 132.1MB. Free memory was 70.4MB in the beginning and 68.4MB in the end (delta: 2.0MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.97ms. Allocated memory is still 132.1MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.25ms. Allocated memory is still 132.1MB. Free memory was 65.8MB in the beginning and 63.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 612.48ms. Allocated memory was 132.1MB in the beginning and 209.7MB in the end (delta: 77.6MB). Free memory was 63.1MB in the beginning and 165.1MB in the end (delta: -102.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7761.33ms. Allocated memory was 209.7MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 164.0MB in the beginning and 493.9MB in the end (delta: -329.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; VAL [t={5:0}, v={0:0}] [L1162] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[v],IntegerLiteral[0]]]] [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, t={5:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={0:0}] [L1163] 0 \read(t) VAL [arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={0:0}] [L1147] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={0:0}] [L1127] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1127] 2 v = malloc(sizeof(char)) [L1148] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1148] 1 \read(t1) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1128] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1128] 2 return 0; [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1149] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1132] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1133] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1133] 3 v[0] = 'X' [L1134] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1150] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1139] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1135] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1135] 3 return 0; [L1151] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1132] 5 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1133] 5 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1133] 5 v[0] = 'X' [L1134] 5 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1152] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1132] 6 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1133] 6 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1133] 6 v[0] = 'X' [L1134] 6 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1135] 5 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1135] 5 return 0; [L1153] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1153] 1 \read(t2) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1135] 6 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1135] 6 return 0; [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1154] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1154] 1 \read(t3) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1140] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1140] 4 v[0] = 'Y' [L1141] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1142] 4 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1142] 4 return 0; [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1155] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1155] 1 \read(t4) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1156] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1156] 1 \read(t5) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-5:0}] [L1157] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t={5:0}, v={-5:0}] [L1164] EXPR 0 v[0] [L1164] CALL 0 __VERIFIER_assert(v[0] == 'X') [L1123] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[expression]],BinaryExpression[COMPLEQ,IdentifierExpression[expression],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[1]]]]]] VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, v={-5:0}] [L1123] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, v={-5:0}] [L1123] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, v={-5:0}] [L1123] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, v={-5:0}] - UnprovableResult [Line: 1147]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1148]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1149]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1150]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1151]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1152]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1153]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1154]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1155]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1156]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1157]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1147]: 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: 1151]: 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: 1152]: 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: 1150]: 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: 1149]: 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: 1127]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1128]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1132]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1133]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1134]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1135]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1139]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1140]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1141]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1142]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1162]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1123]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1123]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1123]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1162]: 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: 1152]: 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: 1149]: 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: 1150]: 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: 1147]: 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: 1151]: 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 11 procedures, 182 locations, 66 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: 7.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 587 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 555 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1178 IncrementalHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 15 mSDtfsCounter, 1178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-05 10:37:50,748 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