./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.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/singleton.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d25acf6 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.2023-12-19_14-39-08.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-3d25acf-m [2024-01-30 14:26:47,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:26:48,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:26:48,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:26:48,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:26:48,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:26:48,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:26:48,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:26:48,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:26:48,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:26:48,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:26:48,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:26:48,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:26:48,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:26:48,032 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:26:48,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:26:48,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:26:48,033 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:26:48,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:26:48,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:26:48,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:26:48,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:26:48,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:26:48,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:26:48,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:26:48,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:26:48,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:26:48,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:26:48,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:26:48,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:26:48,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:26:48,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:26:48,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:26:48,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:26:48,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:26:48,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:26:48,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:26:48,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:26:48,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:26:48,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:26:48,037 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:26:48,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:26:48,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:26:48,038 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-30 14:26:48,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:26:48,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:26:48,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:26:48,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:26:48,204 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:26:48,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2024-01-30 14:26:49,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:26:49,507 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:26:49,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2024-01-30 14:26:49,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f688909f/3ab9b6867d7748c3ae809d8fc60b253b/FLAGf3d39ec37 [2024-01-30 14:26:49,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f688909f/3ab9b6867d7748c3ae809d8fc60b253b [2024-01-30 14:26:49,531 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:26:49,532 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:26:49,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/singleton.yml/witness.yml [2024-01-30 14:26:49,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:26:49,606 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:26:49,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:26:49,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:26:49,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:26:49,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:26:49" (1/2) ... [2024-01-30 14:26:49,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@792ba691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:26:49, skipping insertion in model container [2024-01-30 14:26:49,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:26:49" (1/2) ... [2024-01-30 14:26:49,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@739c7b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:26:49, skipping insertion in model container [2024-01-30 14:26:49,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:26:49" (2/2) ... [2024-01-30 14:26:49,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@792ba691 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:49, skipping insertion in model container [2024-01-30 14:26:49,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:26:49" (2/2) ... [2024-01-30 14:26:49,614 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:26:49,658 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:26:49,659 INFO L98 nessWitnessExtractor]: Location invariant before [L1153-L1153] (unsigned long )arg == 0UL [2024-01-30 14:26:49,659 INFO L98 nessWitnessExtractor]: Location invariant before [L1147-L1147] (unsigned long )arg == 0UL [2024-01-30 14:26:49,659 INFO L98 nessWitnessExtractor]: Location invariant before [L1149-L1149] (unsigned long )arg == 0UL [2024-01-30 14:26:49,659 INFO L98 nessWitnessExtractor]: Location invariant before [L1154-L1154] (unsigned long )arg == 0UL [2024-01-30 14:26:49,659 INFO L98 nessWitnessExtractor]: Location invariant before [L1139-L1139] (unsigned long )arg == 0UL [2024-01-30 14:26:49,659 INFO L98 nessWitnessExtractor]: Location invariant before [L1134-L1134] (unsigned long )arg == 0UL [2024-01-30 14:26:49,659 INFO L98 nessWitnessExtractor]: Location invariant before [L1156-L1156] (unsigned long )arg == 0UL [2024-01-30 14:26:49,660 INFO L98 nessWitnessExtractor]: Location invariant before [L1127-L1127] (unsigned long )arg == 0UL [2024-01-30 14:26:49,660 INFO L98 nessWitnessExtractor]: Location invariant before [L1152-L1152] (unsigned long )arg == 0UL [2024-01-30 14:26:49,660 INFO L98 nessWitnessExtractor]: Location invariant before [L1141-L1141] (unsigned long )arg == 0UL [2024-01-30 14:26:49,660 INFO L98 nessWitnessExtractor]: Location invariant before [L1132-L1132] (unsigned long )arg == 0UL [2024-01-30 14:26:49,660 INFO L98 nessWitnessExtractor]: Location invariant before [L1148-L1148] (unsigned long )arg == 0UL [2024-01-30 14:26:49,660 INFO L98 nessWitnessExtractor]: Location invariant before [L1157-L1157] (unsigned long )arg == 0UL [2024-01-30 14:26:49,660 INFO L98 nessWitnessExtractor]: Location invariant before [L1135-L1135] (unsigned long )arg == 0UL [2024-01-30 14:26:49,660 INFO L98 nessWitnessExtractor]: Location invariant before [L1162-L1162] v == 0 [2024-01-30 14:26:49,661 INFO L98 nessWitnessExtractor]: Location invariant before [L1133-L1133] (unsigned long )arg == 0UL [2024-01-30 14:26:49,661 INFO L98 nessWitnessExtractor]: Location invariant before [L1123-L1123] ((((expression == 1) && (expression == 0)) && (0 <= expression)) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-01-30 14:26:49,661 INFO L98 nessWitnessExtractor]: Location invariant before [L1128-L1128] (unsigned long )arg == 0UL [2024-01-30 14:26:49,661 INFO L98 nessWitnessExtractor]: Location invariant before [L1140-L1140] (unsigned long )arg == 0UL [2024-01-30 14:26:49,661 INFO L98 nessWitnessExtractor]: Location invariant before [L1150-L1150] (unsigned long )arg == 0UL [2024-01-30 14:26:49,661 INFO L98 nessWitnessExtractor]: Location invariant before [L1142-L1142] (unsigned long )arg == 0UL [2024-01-30 14:26:49,662 INFO L98 nessWitnessExtractor]: Location invariant before [L1151-L1151] (unsigned long )arg == 0UL [2024-01-30 14:26:49,662 INFO L98 nessWitnessExtractor]: Location invariant before [L1155-L1155] (unsigned long )arg == 0UL [2024-01-30 14:26:49,691 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:26:49,973 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-01-30 14:26:49,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:26:50,008 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:26:50,039 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-01-30 14:26:50,039 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int expression) { if (!expression) { ERROR: {reach_error();abort();}}; return; } 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-01-30 14:26:50,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:26:50,112 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:26:50,112 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:50 WrapperNode [2024-01-30 14:26:50,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:26:50,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:26:50,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:26:50,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:26:50,118 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 30.01 02:26:50" (1/1) ... [2024-01-30 14:26:50,134 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 30.01 02:26:50" (1/1) ... [2024-01-30 14:26:50,148 INFO L138 Inliner]: procedures = 324, calls = 51, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2024-01-30 14:26:50,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:26:50,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:26:50,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:26:50,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:26:50,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:50" (1/1) ... [2024-01-30 14:26:50,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:50" (1/1) ... [2024-01-30 14:26:50,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:50" (1/1) ... [2024-01-30 14:26:50,172 INFO L175 MemorySlicer]: Split 17 memory accesses to 8 slices as follows [2, 2, 2, 2, 2, 2, 2, 3]. 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, 1, 1, 1, 1, 1, 1, 2]. [2024-01-30 14:26:50,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:50" (1/1) ... [2024-01-30 14:26:50,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:50" (1/1) ... [2024-01-30 14:26:50,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:50" (1/1) ... [2024-01-30 14:26:50,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:50" (1/1) ... [2024-01-30 14:26:50,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:50" (1/1) ... [2024-01-30 14:26:50,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:50" (1/1) ... [2024-01-30 14:26:50,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:26:50,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:26:50,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:26:50,207 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:26:50,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:50" (1/1) ... [2024-01-30 14:26:50,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:26:50,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:26:50,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-30 14:26:50,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-30 14:26:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-30 14:26:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:26:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:26:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-30 14:26:50,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:26:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:26:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:26:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-30 14:26:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-30 14:26:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-30 14:26:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-01-30 14:26:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-01-30 14:26:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2024-01-30 14:26:50,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2024-01-30 14:26:50,269 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-30 14:26:50,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-30 14:26:50,269 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-30 14:26:50,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-30 14:26:50,269 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-30 14:26:50,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-30 14:26:50,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:26:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:26:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:26:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:26:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-30 14:26:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-30 14:26:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-01-30 14:26:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-01-30 14:26:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-30 14:26:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:26:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:26:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:26:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:26:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:26:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-30 14:26:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-30 14:26:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-01-30 14:26:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-01-30 14:26:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:26:50,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:26:50,273 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:26:50,379 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:26:50,389 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:26:50,571 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:26:50,571 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:26:50,694 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:26:50,694 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-30 14:26:50,695 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:26:50 BoogieIcfgContainer [2024-01-30 14:26:50,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:26:50,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:26:50,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:26:50,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:26:50,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:26:49" (1/4) ... [2024-01-30 14:26:50,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1108c8d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:26:50, skipping insertion in model container [2024-01-30 14:26:50,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:26:49" (2/4) ... [2024-01-30 14:26:50,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1108c8d4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:26:50, skipping insertion in model container [2024-01-30 14:26:50,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:26:50" (3/4) ... [2024-01-30 14:26:50,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1108c8d4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:26:50, skipping insertion in model container [2024-01-30 14:26:50,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:26:50" (4/4) ... [2024-01-30 14:26:50,701 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton.i [2024-01-30 14:26:50,713 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:26:50,714 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-01-30 14:26:50,714 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:26:50,826 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-01-30 14:26:50,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 389 flow [2024-01-30 14:26:50,916 INFO L124 PetriNetUnfolderBase]: 6/97 cut-off events. [2024-01-30 14:26:50,916 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-30 14:26:50,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 97 events. 6/97 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 135 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 106. Up to 3 conditions per place. [2024-01-30 14:26:50,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 146 transitions, 389 flow [2024-01-30 14:26:50,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 94 transitions, 239 flow [2024-01-30 14:26:50,932 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:26:50,937 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;@28233842, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:26:50,938 INFO L358 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2024-01-30 14:26:50,940 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:26:50,941 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:26:50,941 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:26:50,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:26:50,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:26:50,942 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-30 14:26:50,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:26:50,947 INFO L85 PathProgramCache]: Analyzing trace with hash 10028, now seen corresponding path program 1 times [2024-01-30 14:26:50,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:26:50,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347206577] [2024-01-30 14:26:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:26:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:26:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:26:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:26:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:26:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347206577] [2024-01-30 14:26:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347206577] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:26:51,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:26:51,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:26:51,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133107094] [2024-01-30 14:26:51,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:26:51,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:26:51,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:26:51,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:26:51,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:26:51,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 148 [2024-01-30 14:26:51,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 94 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:51,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:26:51,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 148 [2024-01-30 14:26:51,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:26:52,406 INFO L124 PetriNetUnfolderBase]: 7191/10961 cut-off events. [2024-01-30 14:26:52,424 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2024-01-30 14:26:52,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21263 conditions, 10961 events. 7191/10961 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 74041 event pairs, 5813 based on Foata normal form. 0/8343 useless extension candidates. Maximal degree in co-relation 21240. Up to 9585 conditions per place. [2024-01-30 14:26:52,531 INFO L140 encePairwiseOnDemand]: 141/148 looper letters, 53 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-01-30 14:26:52,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 92 transitions, 345 flow [2024-01-30 14:26:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:26:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:26:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2024-01-30 14:26:52,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5540540540540541 [2024-01-30 14:26:52,544 INFO L175 Difference]: Start difference. First operand has 108 places, 94 transitions, 239 flow. Second operand 3 states and 246 transitions. [2024-01-30 14:26:52,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 92 transitions, 345 flow [2024-01-30 14:26:52,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 311 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-01-30 14:26:52,573 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 199 flow [2024-01-30 14:26:52,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2024-01-30 14:26:52,578 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -15 predicate places. [2024-01-30 14:26:52,579 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 199 flow [2024-01-30 14:26:52,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:52,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:26:52,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-30 14:26:52,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:26:52,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-30 14:26:52,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:26:52,585 INFO L85 PathProgramCache]: Analyzing trace with hash 299191131, now seen corresponding path program 1 times [2024-01-30 14:26:52,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:26:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385773346] [2024-01-30 14:26:52,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:26:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:26:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:26:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:26:52,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:26:52,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385773346] [2024-01-30 14:26:52,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385773346] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:26:52,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:26:52,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:26:52,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555613215] [2024-01-30 14:26:52,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:26:52,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:26:52,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:26:52,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:26:52,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:26:52,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 148 [2024-01-30 14:26:52,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:52,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:26:52,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 148 [2024-01-30 14:26:52,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:26:53,543 INFO L124 PetriNetUnfolderBase]: 7191/10295 cut-off events. [2024-01-30 14:26:53,543 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-01-30 14:26:53,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20081 conditions, 10295 events. 7191/10295 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 63283 event pairs, 5816 based on Foata normal form. 0/7677 useless extension candidates. Maximal degree in co-relation 11202. Up to 9599 conditions per place. [2024-01-30 14:26:53,595 INFO L140 encePairwiseOnDemand]: 135/148 looper letters, 51 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-01-30 14:26:53,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 79 transitions, 285 flow [2024-01-30 14:26:53,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:26:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:26:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2024-01-30 14:26:53,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-01-30 14:26:53,600 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 199 flow. Second operand 4 states and 272 transitions. [2024-01-30 14:26:53,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 79 transitions, 285 flow [2024-01-30 14:26:53,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 79 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:26:53,603 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 177 flow [2024-01-30 14:26:53,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2024-01-30 14:26:53,603 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -25 predicate places. [2024-01-30 14:26:53,604 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 177 flow [2024-01-30 14:26:53,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:53,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:26:53,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:26:53,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:26:53,604 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-30 14:26:53,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:26:53,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1146296624, now seen corresponding path program 1 times [2024-01-30 14:26:53,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:26:53,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252599306] [2024-01-30 14:26:53,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:26:53,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:26:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:26:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:26:53,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:26:53,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252599306] [2024-01-30 14:26:53,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252599306] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:26:53,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:26:53,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:26:53,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164556662] [2024-01-30 14:26:53,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:26:53,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:26:53,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:26:53,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:26:53,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:26:53,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 148 [2024-01-30 14:26:53,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:53,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:26:53,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 148 [2024-01-30 14:26:53,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:26:54,526 INFO L124 PetriNetUnfolderBase]: 7198/10302 cut-off events. [2024-01-30 14:26:54,526 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-30 14:26:54,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20097 conditions, 10302 events. 7198/10302 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 63320 event pairs, 5810 based on Foata normal form. 0/7686 useless extension candidates. Maximal degree in co-relation 20078. Up to 9597 conditions per place. [2024-01-30 14:26:54,576 INFO L140 encePairwiseOnDemand]: 144/148 looper letters, 55 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2024-01-30 14:26:54,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 80 transitions, 295 flow [2024-01-30 14:26:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:26:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:26:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 299 transitions. [2024-01-30 14:26:54,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050675675675675 [2024-01-30 14:26:54,578 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 177 flow. Second operand 4 states and 299 transitions. [2024-01-30 14:26:54,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 80 transitions, 295 flow [2024-01-30 14:26:54,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:26:54,580 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 174 flow [2024-01-30 14:26:54,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=79, 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=174, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2024-01-30 14:26:54,580 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -26 predicate places. [2024-01-30 14:26:54,581 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 174 flow [2024-01-30 14:26:54,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:54,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:26:54,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:26:54,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:26:54,581 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-30 14:26:54,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:26:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash -584594441, now seen corresponding path program 1 times [2024-01-30 14:26:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:26:54,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452884304] [2024-01-30 14:26:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:26:54,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:26:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:26:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:26:54,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:26:54,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452884304] [2024-01-30 14:26:54,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452884304] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:26:54,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:26:54,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:26:54,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903927490] [2024-01-30 14:26:54,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:26:54,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:26:54,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:26:54,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:26:54,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:26:54,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 148 [2024-01-30 14:26:54,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:54,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:26:54,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 148 [2024-01-30 14:26:54,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:26:55,325 INFO L124 PetriNetUnfolderBase]: 7191/10405 cut-off events. [2024-01-30 14:26:55,325 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-01-30 14:26:55,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20190 conditions, 10405 events. 7191/10405 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 60967 event pairs, 4197 based on Foata normal form. 510/9055 useless extension candidates. Maximal degree in co-relation 11286. Up to 7885 conditions per place. [2024-01-30 14:26:55,376 INFO L140 encePairwiseOnDemand]: 143/148 looper letters, 72 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-01-30 14:26:55,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 95 transitions, 363 flow [2024-01-30 14:26:55,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:26:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:26:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2024-01-30 14:26:55,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535472972972973 [2024-01-30 14:26:55,378 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 174 flow. Second operand 4 states and 317 transitions. [2024-01-30 14:26:55,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 95 transitions, 363 flow [2024-01-30 14:26:55,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 95 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:26:55,379 INFO L231 Difference]: Finished difference. Result has 80 places, 73 transitions, 169 flow [2024-01-30 14:26:55,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=77, 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=169, PETRI_PLACES=80, PETRI_TRANSITIONS=73} [2024-01-30 14:26:55,380 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -28 predicate places. [2024-01-30 14:26:55,380 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 73 transitions, 169 flow [2024-01-30 14:26:55,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:55,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:26:55,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:26:55,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:26:55,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-30 14:26:55,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:26:55,381 INFO L85 PathProgramCache]: Analyzing trace with hash -74460360, now seen corresponding path program 1 times [2024-01-30 14:26:55,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:26:55,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545952980] [2024-01-30 14:26:55,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:26:55,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:26:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:26:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:26:55,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:26:55,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545952980] [2024-01-30 14:26:55,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545952980] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:26:55,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:26:55,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:26:55,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415517355] [2024-01-30 14:26:55,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:26:55,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:26:55,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:26:55,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:26:55,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:26:55,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 148 [2024-01-30 14:26:55,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 73 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:55,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:26:55,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 148 [2024-01-30 14:26:55,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:26:55,969 INFO L124 PetriNetUnfolderBase]: 5528/8052 cut-off events. [2024-01-30 14:26:55,969 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-01-30 14:26:55,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15624 conditions, 8052 events. 5528/8052 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 49289 event pairs, 530 based on Foata normal form. 442/7416 useless extension candidates. Maximal degree in co-relation 8748. Up to 5903 conditions per place. [2024-01-30 14:26:56,014 INFO L140 encePairwiseOnDemand]: 143/148 looper letters, 72 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-30 14:26:56,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 93 transitions, 361 flow [2024-01-30 14:26:56,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:26:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:26:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2024-01-30 14:26:56,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535472972972973 [2024-01-30 14:26:56,016 INFO L175 Difference]: Start difference. First operand has 80 places, 73 transitions, 169 flow. Second operand 4 states and 317 transitions. [2024-01-30 14:26:56,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 93 transitions, 361 flow [2024-01-30 14:26:56,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 93 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:26:56,018 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 164 flow [2024-01-30 14:26:56,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=75, 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=164, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2024-01-30 14:26:56,019 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -30 predicate places. [2024-01-30 14:26:56,019 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 164 flow [2024-01-30 14:26:56,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:56,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:26:56,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:26:56,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:26:56,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-30 14:26:56,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:26:56,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2098387367, now seen corresponding path program 1 times [2024-01-30 14:26:56,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:26:56,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070471139] [2024-01-30 14:26:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:26:56,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:26:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:26:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:26:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:26:56,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070471139] [2024-01-30 14:26:56,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070471139] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:26:56,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:26:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:26:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928946326] [2024-01-30 14:26:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:26:56,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:26:56,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:26:56,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:26:56,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:26:56,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 148 [2024-01-30 14:26:56,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:56,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:26:56,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 148 [2024-01-30 14:26:56,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:26:56,470 INFO L124 PetriNetUnfolderBase]: 4095/6005 cut-off events. [2024-01-30 14:26:56,470 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-01-30 14:26:56,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11680 conditions, 6005 events. 4095/6005 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 32847 event pairs, 823 based on Foata normal form. 334/5845 useless extension candidates. Maximal degree in co-relation 6555. Up to 4245 conditions per place. [2024-01-30 14:26:56,496 INFO L140 encePairwiseOnDemand]: 143/148 looper letters, 72 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-01-30 14:26:56,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 91 transitions, 359 flow [2024-01-30 14:26:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:26:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:26:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2024-01-30 14:26:56,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535472972972973 [2024-01-30 14:26:56,497 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 164 flow. Second operand 4 states and 317 transitions. [2024-01-30 14:26:56,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 91 transitions, 359 flow [2024-01-30 14:26:56,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:26:56,499 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 159 flow [2024-01-30 14:26:56,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2024-01-30 14:26:56,501 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -32 predicate places. [2024-01-30 14:26:56,501 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 159 flow [2024-01-30 14:26:56,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:56,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:26:56,502 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-01-30 14:26:56,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:26:56,502 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-30 14:26:56,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:26:56,503 INFO L85 PathProgramCache]: Analyzing trace with hash 164710810, now seen corresponding path program 1 times [2024-01-30 14:26:56,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:26:56,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726901619] [2024-01-30 14:26:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:26:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:26:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:26:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:26:56,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:26:56,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726901619] [2024-01-30 14:26:56,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726901619] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:26:56,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:26:56,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:26:56,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188919557] [2024-01-30 14:26:56,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:26:56,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:26:56,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:26:56,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:26:56,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:26:56,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 148 [2024-01-30 14:26:56,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:56,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:26:56,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 148 [2024-01-30 14:26:56,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:26:56,889 INFO L124 PetriNetUnfolderBase]: 3032/4442 cut-off events. [2024-01-30 14:26:56,890 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-01-30 14:26:56,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8726 conditions, 4442 events. 3032/4442 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 23554 event pairs, 494 based on Foata normal form. 214/4514 useless extension candidates. Maximal degree in co-relation 4911. Up to 2671 conditions per place. [2024-01-30 14:26:56,910 INFO L140 encePairwiseOnDemand]: 143/148 looper letters, 72 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-01-30 14:26:56,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 357 flow [2024-01-30 14:26:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:26:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:26:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2024-01-30 14:26:56,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535472972972973 [2024-01-30 14:26:56,912 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 159 flow. Second operand 4 states and 317 transitions. [2024-01-30 14:26:56,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 357 flow [2024-01-30 14:26:56,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 89 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:26:56,913 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 154 flow [2024-01-30 14:26:56,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2024-01-30 14:26:56,914 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -34 predicate places. [2024-01-30 14:26:56,914 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 154 flow [2024-01-30 14:26:56,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:56,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:26:56,915 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] [2024-01-30 14:26:56,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:26:56,915 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-30 14:26:56,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:26:56,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1102324195, now seen corresponding path program 1 times [2024-01-30 14:26:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:26:56,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391117586] [2024-01-30 14:26:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:26:56,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:26:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:26:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:26:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:26:57,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391117586] [2024-01-30 14:26:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391117586] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:26:57,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:26:57,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:26:57,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858626736] [2024-01-30 14:26:57,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:26:57,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:26:57,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:26:57,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:26:57,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:26:57,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 148 [2024-01-30 14:26:57,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:57,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:26:57,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 148 [2024-01-30 14:26:57,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:26:57,476 INFO L124 PetriNetUnfolderBase]: 3743/5425 cut-off events. [2024-01-30 14:26:57,476 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-01-30 14:26:57,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10905 conditions, 5425 events. 3743/5425 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 27127 event pairs, 1249 based on Foata normal form. 1/5170 useless extension candidates. Maximal degree in co-relation 6169. Up to 3255 conditions per place. [2024-01-30 14:26:57,493 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 66 selfloop transitions, 4 changer transitions 13/98 dead transitions. [2024-01-30 14:26:57,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 98 transitions, 402 flow [2024-01-30 14:26:57,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:26:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:26:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 328 transitions. [2024-01-30 14:26:57,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5540540540540541 [2024-01-30 14:26:57,494 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 154 flow. Second operand 4 states and 328 transitions. [2024-01-30 14:26:57,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 98 transitions, 402 flow [2024-01-30 14:26:57,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 98 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:26:57,497 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 183 flow [2024-01-30 14:26:57,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2024-01-30 14:26:57,498 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -30 predicate places. [2024-01-30 14:26:57,498 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 183 flow [2024-01-30 14:26:57,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:57,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:26:57,498 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] [2024-01-30 14:26:57,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:26:57,498 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-30 14:26:57,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:26:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash -224447279, now seen corresponding path program 2 times [2024-01-30 14:26:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:26:57,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026389693] [2024-01-30 14:26:57,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:26:57,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:26:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:26:57,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:26:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:26:57,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:26:57,582 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:26:57,583 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (62 of 63 remaining) [2024-01-30 14:26:57,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 63 remaining) [2024-01-30 14:26:57,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 63 remaining) [2024-01-30 14:26:57,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 63 remaining) [2024-01-30 14:26:57,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 63 remaining) [2024-01-30 14:26:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 63 remaining) [2024-01-30 14:26:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 63 remaining) [2024-01-30 14:26:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 63 remaining) [2024-01-30 14:26:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 63 remaining) [2024-01-30 14:26:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 63 remaining) [2024-01-30 14:26:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 63 remaining) [2024-01-30 14:26:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 63 remaining) [2024-01-30 14:26:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 63 remaining) [2024-01-30 14:26:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 63 remaining) [2024-01-30 14:26:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 63 remaining) [2024-01-30 14:26:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 63 remaining) [2024-01-30 14:26:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 63 remaining) [2024-01-30 14:26:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 63 remaining) [2024-01-30 14:26:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 63 remaining) [2024-01-30 14:26:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 63 remaining) [2024-01-30 14:26:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 63 remaining) [2024-01-30 14:26:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 63 remaining) [2024-01-30 14:26:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 63 remaining) [2024-01-30 14:26:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 63 remaining) [2024-01-30 14:26:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 63 remaining) [2024-01-30 14:26:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 63 remaining) [2024-01-30 14:26:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 63 remaining) [2024-01-30 14:26:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 63 remaining) [2024-01-30 14:26:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 63 remaining) [2024-01-30 14:26:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 63 remaining) [2024-01-30 14:26:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 63 remaining) [2024-01-30 14:26:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 63 remaining) [2024-01-30 14:26:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 63 remaining) [2024-01-30 14:26:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 63 remaining) [2024-01-30 14:26:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 63 remaining) [2024-01-30 14:26:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 63 remaining) [2024-01-30 14:26:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 63 remaining) [2024-01-30 14:26:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 63 remaining) [2024-01-30 14:26:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 63 remaining) [2024-01-30 14:26:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 63 remaining) [2024-01-30 14:26:57,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 63 remaining) [2024-01-30 14:26:57,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 63 remaining) [2024-01-30 14:26:57,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 63 remaining) [2024-01-30 14:26:57,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 63 remaining) [2024-01-30 14:26:57,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 63 remaining) [2024-01-30 14:26:57,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 63 remaining) [2024-01-30 14:26:57,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 63 remaining) [2024-01-30 14:26:57,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 63 remaining) [2024-01-30 14:26:57,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 63 remaining) [2024-01-30 14:26:57,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 63 remaining) [2024-01-30 14:26:57,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 63 remaining) [2024-01-30 14:26:57,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 63 remaining) [2024-01-30 14:26:57,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 63 remaining) [2024-01-30 14:26:57,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 63 remaining) [2024-01-30 14:26:57,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 63 remaining) [2024-01-30 14:26:57,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 63 remaining) [2024-01-30 14:26:57,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 63 remaining) [2024-01-30 14:26:57,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 63 remaining) [2024-01-30 14:26:57,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 63 remaining) [2024-01-30 14:26:57,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 63 remaining) [2024-01-30 14:26:57,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 63 remaining) [2024-01-30 14:26:57,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 63 remaining) [2024-01-30 14:26:57,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 63 remaining) [2024-01-30 14:26:57,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-30 14:26:57,590 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:26:57,595 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:26:57,595 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:26:57,670 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-01-30 14:26:57,670 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-01-30 14:26:57,671 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:26:57 BasicIcfg [2024-01-30 14:26:57,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:26:57,672 INFO L158 Benchmark]: Toolchain (without parser) took 8065.81ms. Allocated memory was 182.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 146.7MB in the beginning and 1.1GB in the end (delta: -921.8MB). Peak memory consumption was 991.8MB. Max. memory is 16.1GB. [2024-01-30 14:26:57,672 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:26:57,672 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:26:57,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.14ms. Allocated memory is still 182.5MB. Free memory was 146.0MB in the beginning and 108.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-01-30 14:26:57,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.50ms. Allocated memory is still 182.5MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:26:57,674 INFO L158 Benchmark]: Boogie Preprocessor took 56.19ms. Allocated memory is still 182.5MB. Free memory was 106.2MB in the beginning and 103.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:26:57,674 INFO L158 Benchmark]: RCFGBuilder took 488.28ms. Allocated memory is still 182.5MB. Free memory was 103.5MB in the beginning and 125.0MB in the end (delta: -21.5MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-01-30 14:26:57,675 INFO L158 Benchmark]: TraceAbstraction took 6975.80ms. Allocated memory was 182.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 124.0MB in the beginning and 1.1GB in the end (delta: -944.5MB). Peak memory consumption was 968.1MB. Max. memory is 16.1GB. [2024-01-30 14:26:57,676 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 125.8MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.14ms. Allocated memory is still 182.5MB. Free memory was 146.0MB in the beginning and 108.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.50ms. Allocated memory is still 182.5MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.19ms. Allocated memory is still 182.5MB. Free memory was 106.2MB in the beginning and 103.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 488.28ms. Allocated memory is still 182.5MB. Free memory was 103.5MB in the beginning and 125.0MB in the end (delta: -21.5MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6975.80ms. Allocated memory was 182.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 124.0MB in the beginning and 1.1GB in the end (delta: -944.5MB). Peak memory consumption was 968.1MB. 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}] [L1163] 0 \read(t) VAL [arg={0: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}] [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={-6: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={-6: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={-6: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}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-6: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}, 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={-6: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}, 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={-6:0}] [L1132] 6 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}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-6:0}] [L1132] 5 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}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-6: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}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-6:0}] [L1153] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1153] 1 \read(t2) 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={-6: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}, arg={0:0}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-6:0}] [L1135] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1135] 3 return 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}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-6:0}] [L1135] 5 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L1135] 5 return 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}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-6: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}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-6: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}, t1={7:0}, t2={8:0}, t3={3:0}, t4={9:0}, t5={6:0}, v={-6:0}] [L1139] 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={-6: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={-6: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={-6: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={-6: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={-6: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={-6: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={-6: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={-6:0}] [L1164] EXPR 0 v[0] [L1164] CALL 0 __VERIFIER_assert(v[0] == 'X') [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={-6: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={-6: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: 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: 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: 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: 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: 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: 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: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 177 locations, 63 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 548 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 527 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 991 IncrementalHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 1 mSDtfsCounter, 991 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=0, InterpolantAutomatonStates: 31, 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, 0.8s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-30 14:26:57,712 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