./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 a340643f 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-a340643-m [2024-01-27 14:53:39,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 14:53:39,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 14:53:39,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 14:53:39,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 14:53:39,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 14:53:39,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 14:53:39,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 14:53:39,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 14:53:39,262 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 14:53:39,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 14:53:39,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 14:53:39,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 14:53:39,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 14:53:39,276 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 14:53:39,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 14:53:39,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 14:53:39,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 14:53:39,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 14:53:39,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 14:53:39,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 14:53:39,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 14:53:39,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 14:53:39,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 14:53:39,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 14:53:39,279 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 14:53:39,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 14:53:39,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 14:53:39,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 14:53:39,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 14:53:39,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 14:53:39,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 14:53:39,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:53:39,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 14:53:39,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 14:53:39,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 14:53:39,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 14:53:39,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 14:53:39,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 14:53:39,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 14:53:39,284 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 14:53:39,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 14:53:39,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 14:53:39,285 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-27 14:53:39,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 14:53:39,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 14:53:39,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 14:53:39,520 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 14:53:39,521 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 14:53:39,521 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-27 14:53:39,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 14:53:39,611 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 14:53:39,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2024-01-27 14:53:40,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 14:53:41,008 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 14:53:41,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2024-01-27 14:53:41,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237279d1e/26880727b4c84273bae2e9438a7aa6b3/FLAGc40d840d3 [2024-01-27 14:53:41,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237279d1e/26880727b4c84273bae2e9438a7aa6b3 [2024-01-27 14:53:41,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 14:53:41,044 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 14:53:41,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 14:53:41,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 14:53:41,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 14:53:41,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:53:39" (1/2) ... [2024-01-27 14:53:41,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5190b3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:53:41, skipping insertion in model container [2024-01-27 14:53:41,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:53:39" (1/2) ... [2024-01-27 14:53:41,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@78135458 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:53:41, skipping insertion in model container [2024-01-27 14:53:41,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:53:41" (2/2) ... [2024-01-27 14:53:41,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5190b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41, skipping insertion in model container [2024-01-27 14:53:41,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:53:41" (2/2) ... [2024-01-27 14:53:41,061 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 14:53:41,111 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 14:53:41,113 INFO L98 nessWitnessExtractor]: Location invariant before [L1123-L1123] expression == 0 [2024-01-27 14:53:41,113 INFO L98 nessWitnessExtractor]: Location invariant before [L1123-L1123] expression <= 1 [2024-01-27 14:53:41,113 INFO L98 nessWitnessExtractor]: Location invariant before [L1123-L1123] expression == 0 || expression == 1 [2024-01-27 14:53:41,113 INFO L98 nessWitnessExtractor]: Location invariant before [L1123-L1123] 0 <= expression [2024-01-27 14:53:41,113 INFO L98 nessWitnessExtractor]: Location invariant before [L1123-L1123] expression == 1 [2024-01-27 14:53:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L1140-L1140] (unsigned long )arg == 0UL [2024-01-27 14:53:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L1155-L1155] (unsigned long )arg == 0UL [2024-01-27 14:53:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L1134-L1134] (unsigned long )arg == 0UL [2024-01-27 14:53:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L1133-L1133] (unsigned long )arg == 0UL [2024-01-27 14:53:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L1156-L1156] (unsigned long )arg == 0UL [2024-01-27 14:53:41,114 INFO L98 nessWitnessExtractor]: Location invariant before [L1151-L1151] (unsigned long )arg == 0UL [2024-01-27 14:53:41,115 INFO L98 nessWitnessExtractor]: Location invariant before [L1147-L1147] (unsigned long )arg == 0UL [2024-01-27 14:53:41,115 INFO L98 nessWitnessExtractor]: Location invariant before [L1154-L1154] (unsigned long )arg == 0UL [2024-01-27 14:53:41,115 INFO L98 nessWitnessExtractor]: Location invariant before [L1153-L1153] (unsigned long )arg == 0UL [2024-01-27 14:53:41,115 INFO L98 nessWitnessExtractor]: Location invariant before [L1132-L1132] (unsigned long )arg == 0UL [2024-01-27 14:53:41,115 INFO L98 nessWitnessExtractor]: Location invariant before [L1139-L1139] (unsigned long )arg == 0UL [2024-01-27 14:53:41,115 INFO L98 nessWitnessExtractor]: Location invariant before [L1127-L1127] (unsigned long )arg == 0UL [2024-01-27 14:53:41,115 INFO L98 nessWitnessExtractor]: Location invariant before [L1152-L1152] (unsigned long )arg == 0UL [2024-01-27 14:53:41,116 INFO L98 nessWitnessExtractor]: Location invariant before [L1150-L1150] (unsigned long )arg == 0UL [2024-01-27 14:53:41,116 INFO L98 nessWitnessExtractor]: Location invariant before [L1162-L1162] v == 0 [2024-01-27 14:53:41,116 INFO L98 nessWitnessExtractor]: Location invariant before [L1135-L1135] (unsigned long )arg == 0UL [2024-01-27 14:53:41,116 INFO L98 nessWitnessExtractor]: Location invariant before [L1128-L1128] (unsigned long )arg == 0UL [2024-01-27 14:53:41,117 INFO L98 nessWitnessExtractor]: Location invariant before [L1148-L1148] (unsigned long )arg == 0UL [2024-01-27 14:53:41,117 INFO L98 nessWitnessExtractor]: Location invariant before [L1142-L1142] (unsigned long )arg == 0UL [2024-01-27 14:53:41,117 INFO L98 nessWitnessExtractor]: Location invariant before [L1141-L1141] (unsigned long )arg == 0UL [2024-01-27 14:53:41,117 INFO L98 nessWitnessExtractor]: Location invariant before [L1149-L1149] (unsigned long )arg == 0UL [2024-01-27 14:53:41,117 INFO L98 nessWitnessExtractor]: Location invariant before [L1157-L1157] (unsigned long )arg == 0UL [2024-01-27 14:53:41,157 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 14:53:41,498 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-27 14:53:41,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:53:41,532 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 14:53:41,561 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-27 14:53:41,562 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-27 14:53:41,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:53:41,636 INFO L206 MainTranslator]: Completed translation [2024-01-27 14:53:41,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41 WrapperNode [2024-01-27 14:53:41,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 14:53:41,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 14:53:41,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 14:53:41,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 14:53:41,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (1/1) ... [2024-01-27 14:53:41,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (1/1) ... [2024-01-27 14:53:41,685 INFO L138 Inliner]: procedures = 324, calls = 51, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2024-01-27 14:53:41,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 14:53:41,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 14:53:41,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 14:53:41,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 14:53:41,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (1/1) ... [2024-01-27 14:53:41,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (1/1) ... [2024-01-27 14:53:41,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (1/1) ... [2024-01-27 14:53:41,718 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 [0, 2, 0, 0, 0, 0, 0, 0]. The 8 writes are split as follows [1, 0, 1, 1, 1, 1, 1, 2]. [2024-01-27 14:53:41,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (1/1) ... [2024-01-27 14:53:41,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (1/1) ... [2024-01-27 14:53:41,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (1/1) ... [2024-01-27 14:53:41,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (1/1) ... [2024-01-27 14:53:41,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (1/1) ... [2024-01-27 14:53:41,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (1/1) ... [2024-01-27 14:53:41,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 14:53:41,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 14:53:41,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 14:53:41,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 14:53:41,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (1/1) ... [2024-01-27 14:53:41,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:53:41,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:53:41,765 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-27 14:53:41,794 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-27 14:53:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 14:53:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 14:53:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 14:53:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 14:53:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 14:53:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 14:53:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 14:53:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 14:53:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 14:53:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-27 14:53:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-01-27 14:53:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-01-27 14:53:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2024-01-27 14:53:41,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2024-01-27 14:53:41,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 14:53:41,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 14:53:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 14:53:41,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 14:53:41,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 14:53:41,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 14:53:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 14:53:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 14:53:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 14:53:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 14:53:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 14:53:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-27 14:53:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-01-27 14:53:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-01-27 14:53:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 14:53:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 14:53:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 14:53:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 14:53:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 14:53:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 14:53:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 14:53:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-27 14:53:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-01-27 14:53:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-01-27 14:53:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 14:53:41,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 14:53:41,848 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 14:53:42,074 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 14:53:42,076 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 14:53:42,361 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 14:53:42,361 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 14:53:42,452 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 14:53:42,453 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 14:53:42,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:53:42 BoogieIcfgContainer [2024-01-27 14:53:42,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 14:53:42,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 14:53:42,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 14:53:42,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 14:53:42,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:53:39" (1/4) ... [2024-01-27 14:53:42,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bcb5f5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:53:42, skipping insertion in model container [2024-01-27 14:53:42,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 02:53:41" (2/4) ... [2024-01-27 14:53:42,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bcb5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:53:42, skipping insertion in model container [2024-01-27 14:53:42,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:53:41" (3/4) ... [2024-01-27 14:53:42,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bcb5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:53:42, skipping insertion in model container [2024-01-27 14:53:42,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:53:42" (4/4) ... [2024-01-27 14:53:42,463 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton.i [2024-01-27 14:53:42,476 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 14:53:42,476 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-01-27 14:53:42,476 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 14:53:42,600 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-01-27 14:53:42,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 389 flow [2024-01-27 14:53:42,653 INFO L124 PetriNetUnfolderBase]: 6/97 cut-off events. [2024-01-27 14:53:42,653 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-27 14:53:42,657 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-27 14:53:42,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 146 transitions, 389 flow [2024-01-27 14:53:42,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 94 transitions, 239 flow [2024-01-27 14:53:42,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 14:53:42,671 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;@51625e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 14:53:42,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2024-01-27 14:53:42,673 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 14:53:42,673 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 14:53:42,673 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:53:42,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:42,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 14:53:42,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-27 14:53:42,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash 10028, now seen corresponding path program 1 times [2024-01-27 14:53:42,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:42,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908708039] [2024-01-27 14:53:42,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:42,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:42,858 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-27 14:53:42,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:42,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908708039] [2024-01-27 14:53:42,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908708039] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:42,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:42,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:53:42,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335705018] [2024-01-27 14:53:42,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:42,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:53:42,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:42,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:53:42,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:53:42,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 148 [2024-01-27 14:53:42,924 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-27 14:53:42,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:42,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 148 [2024-01-27 14:53:42,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:44,045 INFO L124 PetriNetUnfolderBase]: 7191/10961 cut-off events. [2024-01-27 14:53:44,046 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2024-01-27 14:53:44,067 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-27 14:53:44,125 INFO L140 encePairwiseOnDemand]: 141/148 looper letters, 53 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-01-27 14:53:44,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 92 transitions, 345 flow [2024-01-27 14:53:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:53:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:53:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2024-01-27 14:53:44,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5540540540540541 [2024-01-27 14:53:44,136 INFO L175 Difference]: Start difference. First operand has 108 places, 94 transitions, 239 flow. Second operand 3 states and 246 transitions. [2024-01-27 14:53:44,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 92 transitions, 345 flow [2024-01-27 14:53:44,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 311 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-01-27 14:53:44,149 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 199 flow [2024-01-27 14:53:44,150 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-27 14:53:44,153 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -15 predicate places. [2024-01-27 14:53:44,153 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 199 flow [2024-01-27 14:53:44,153 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-27 14:53:44,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:44,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 14:53:44,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 14:53:44,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-27 14:53:44,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash 299191131, now seen corresponding path program 1 times [2024-01-27 14:53:44,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:44,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749570726] [2024-01-27 14:53:44,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:44,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:44,302 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-27 14:53:44,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749570726] [2024-01-27 14:53:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749570726] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:44,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:44,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:44,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253168813] [2024-01-27 14:53:44,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:44,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:44,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:44,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:44,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:44,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 148 [2024-01-27 14:53:44,348 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-27 14:53:44,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:44,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 148 [2024-01-27 14:53:44,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:45,093 INFO L124 PetriNetUnfolderBase]: 7191/10295 cut-off events. [2024-01-27 14:53:45,093 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-01-27 14:53:45,105 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-27 14:53:45,144 INFO L140 encePairwiseOnDemand]: 135/148 looper letters, 51 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-01-27 14:53:45,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 79 transitions, 285 flow [2024-01-27 14:53:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2024-01-27 14:53:45,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-01-27 14:53:45,150 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 199 flow. Second operand 4 states and 272 transitions. [2024-01-27 14:53:45,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 79 transitions, 285 flow [2024-01-27 14:53:45,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 79 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:45,152 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 177 flow [2024-01-27 14:53:45,152 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-27 14:53:45,153 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -25 predicate places. [2024-01-27 14:53:45,153 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 177 flow [2024-01-27 14:53:45,154 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-27 14:53:45,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:45,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:53:45,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 14:53:45,154 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-27 14:53:45,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1146296624, now seen corresponding path program 1 times [2024-01-27 14:53:45,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:45,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616078684] [2024-01-27 14:53:45,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:45,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:45,296 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-27 14:53:45,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:45,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616078684] [2024-01-27 14:53:45,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616078684] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:45,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:45,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:45,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295768865] [2024-01-27 14:53:45,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:45,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:45,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:45,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:45,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 148 [2024-01-27 14:53:45,301 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-27 14:53:45,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:45,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 148 [2024-01-27 14:53:45,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:45,997 INFO L124 PetriNetUnfolderBase]: 7198/10302 cut-off events. [2024-01-27 14:53:45,997 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-27 14:53:46,010 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-27 14:53:46,048 INFO L140 encePairwiseOnDemand]: 144/148 looper letters, 55 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2024-01-27 14:53:46,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 80 transitions, 295 flow [2024-01-27 14:53:46,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 299 transitions. [2024-01-27 14:53:46,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050675675675675 [2024-01-27 14:53:46,051 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 177 flow. Second operand 4 states and 299 transitions. [2024-01-27 14:53:46,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 80 transitions, 295 flow [2024-01-27 14:53:46,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:46,053 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 174 flow [2024-01-27 14:53:46,053 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-27 14:53:46,054 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -26 predicate places. [2024-01-27 14:53:46,054 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 174 flow [2024-01-27 14:53:46,055 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-27 14:53:46,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:46,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:53:46,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 14:53:46,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-27 14:53:46,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:46,056 INFO L85 PathProgramCache]: Analyzing trace with hash -584594441, now seen corresponding path program 1 times [2024-01-27 14:53:46,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:46,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778680505] [2024-01-27 14:53:46,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:46,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:46,205 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-27 14:53:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:46,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778680505] [2024-01-27 14:53:46,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778680505] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:46,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:46,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:46,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255642585] [2024-01-27 14:53:46,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:46,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:46,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:46,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:46,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:46,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 148 [2024-01-27 14:53:46,232 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-27 14:53:46,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:46,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 148 [2024-01-27 14:53:46,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:46,858 INFO L124 PetriNetUnfolderBase]: 7191/10405 cut-off events. [2024-01-27 14:53:46,859 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-01-27 14:53:46,869 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-27 14:53:46,900 INFO L140 encePairwiseOnDemand]: 143/148 looper letters, 72 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-01-27 14:53:46,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 95 transitions, 363 flow [2024-01-27 14:53:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2024-01-27 14:53:46,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535472972972973 [2024-01-27 14:53:46,907 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 174 flow. Second operand 4 states and 317 transitions. [2024-01-27 14:53:46,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 95 transitions, 363 flow [2024-01-27 14:53:46,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 95 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:46,909 INFO L231 Difference]: Finished difference. Result has 80 places, 73 transitions, 169 flow [2024-01-27 14:53:46,910 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-27 14:53:46,911 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -28 predicate places. [2024-01-27 14:53:46,911 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 73 transitions, 169 flow [2024-01-27 14:53:46,911 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-27 14:53:46,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:46,911 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-27 14:53:46,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 14:53:46,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-27 14:53:46,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash -74460360, now seen corresponding path program 1 times [2024-01-27 14:53:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778961806] [2024-01-27 14:53:46,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:46,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:47,016 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-27 14:53:47,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:47,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778961806] [2024-01-27 14:53:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778961806] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:47,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:47,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:47,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333697513] [2024-01-27 14:53:47,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:47,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:47,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:47,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:47,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 148 [2024-01-27 14:53:47,024 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-27 14:53:47,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:47,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 148 [2024-01-27 14:53:47,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:47,587 INFO L124 PetriNetUnfolderBase]: 5528/8052 cut-off events. [2024-01-27 14:53:47,587 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-01-27 14:53:47,596 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-27 14:53:47,618 INFO L140 encePairwiseOnDemand]: 143/148 looper letters, 72 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-27 14:53:47,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 93 transitions, 361 flow [2024-01-27 14:53:47,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2024-01-27 14:53:47,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535472972972973 [2024-01-27 14:53:47,621 INFO L175 Difference]: Start difference. First operand has 80 places, 73 transitions, 169 flow. Second operand 4 states and 317 transitions. [2024-01-27 14:53:47,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 93 transitions, 361 flow [2024-01-27 14:53:47,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 93 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:47,622 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 164 flow [2024-01-27 14:53:47,623 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-27 14:53:47,623 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -30 predicate places. [2024-01-27 14:53:47,623 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 164 flow [2024-01-27 14:53:47,624 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-27 14:53:47,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:47,624 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-27 14:53:47,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 14:53:47,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-27 14:53:47,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:47,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2098387367, now seen corresponding path program 1 times [2024-01-27 14:53:47,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:47,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635300840] [2024-01-27 14:53:47,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:47,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:47,709 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-27 14:53:47,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:47,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635300840] [2024-01-27 14:53:47,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635300840] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:47,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:47,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:47,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237556899] [2024-01-27 14:53:47,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:47,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:47,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:47,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:47,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:47,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 148 [2024-01-27 14:53:47,716 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-27 14:53:47,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:47,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 148 [2024-01-27 14:53:47,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:48,154 INFO L124 PetriNetUnfolderBase]: 4095/6005 cut-off events. [2024-01-27 14:53:48,154 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-01-27 14:53:48,164 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-27 14:53:48,185 INFO L140 encePairwiseOnDemand]: 143/148 looper letters, 72 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-01-27 14:53:48,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 91 transitions, 359 flow [2024-01-27 14:53:48,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2024-01-27 14:53:48,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535472972972973 [2024-01-27 14:53:48,187 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 164 flow. Second operand 4 states and 317 transitions. [2024-01-27 14:53:48,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 91 transitions, 359 flow [2024-01-27 14:53:48,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:48,189 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 159 flow [2024-01-27 14:53:48,189 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-27 14:53:48,190 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -32 predicate places. [2024-01-27 14:53:48,190 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 159 flow [2024-01-27 14:53:48,190 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-27 14:53:48,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:48,191 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-27 14:53:48,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 14:53:48,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-27 14:53:48,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:48,192 INFO L85 PathProgramCache]: Analyzing trace with hash 164710810, now seen corresponding path program 1 times [2024-01-27 14:53:48,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:48,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707524179] [2024-01-27 14:53:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:48,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:48,279 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-27 14:53:48,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707524179] [2024-01-27 14:53:48,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707524179] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:48,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:48,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:53:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252839867] [2024-01-27 14:53:48,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:48,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:48,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:48,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:48,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 148 [2024-01-27 14:53:48,286 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-27 14:53:48,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:48,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 148 [2024-01-27 14:53:48,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:48,636 INFO L124 PetriNetUnfolderBase]: 3032/4442 cut-off events. [2024-01-27 14:53:48,636 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-01-27 14:53:48,647 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-27 14:53:48,663 INFO L140 encePairwiseOnDemand]: 143/148 looper letters, 72 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-01-27 14:53:48,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 357 flow [2024-01-27 14:53:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2024-01-27 14:53:48,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535472972972973 [2024-01-27 14:53:48,665 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 159 flow. Second operand 4 states and 317 transitions. [2024-01-27 14:53:48,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 357 flow [2024-01-27 14:53:48,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 89 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:48,667 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 154 flow [2024-01-27 14:53:48,667 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-27 14:53:48,667 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -34 predicate places. [2024-01-27 14:53:48,668 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 154 flow [2024-01-27 14:53:48,668 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-27 14:53:48,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:48,668 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-27 14:53:48,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 14:53:48,669 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-27 14:53:48,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1102324195, now seen corresponding path program 1 times [2024-01-27 14:53:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:48,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576551375] [2024-01-27 14:53:48,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:48,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:53:48,894 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-27 14:53:48,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:53:48,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576551375] [2024-01-27 14:53:48,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576551375] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:53:48,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:53:48,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:53:48,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131201435] [2024-01-27 14:53:48,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:53:48,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:53:48,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:53:48,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:53:48,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:53:48,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 148 [2024-01-27 14:53:48,904 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-27 14:53:48,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:53:48,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 148 [2024-01-27 14:53:48,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:53:49,256 INFO L124 PetriNetUnfolderBase]: 3743/5425 cut-off events. [2024-01-27 14:53:49,256 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-01-27 14:53:49,265 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-27 14:53:49,271 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 66 selfloop transitions, 4 changer transitions 13/98 dead transitions. [2024-01-27 14:53:49,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 98 transitions, 402 flow [2024-01-27 14:53:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:53:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:53:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 328 transitions. [2024-01-27 14:53:49,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5540540540540541 [2024-01-27 14:53:49,273 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 154 flow. Second operand 4 states and 328 transitions. [2024-01-27 14:53:49,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 98 transitions, 402 flow [2024-01-27 14:53:49,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 98 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:53:49,275 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 183 flow [2024-01-27 14:53:49,276 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-27 14:53:49,276 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -30 predicate places. [2024-01-27 14:53:49,276 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 183 flow [2024-01-27 14:53:49,277 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-27 14:53:49,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:53:49,277 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-27 14:53:49,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 14:53:49,277 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 60 more)] === [2024-01-27 14:53:49,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:53:49,278 INFO L85 PathProgramCache]: Analyzing trace with hash -224447279, now seen corresponding path program 2 times [2024-01-27 14:53:49,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:53:49,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374767279] [2024-01-27 14:53:49,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:53:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:53:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:53:49,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 14:53:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:53:49,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 14:53:49,356 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 14:53:49,357 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (62 of 63 remaining) [2024-01-27 14:53:49,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 63 remaining) [2024-01-27 14:53:49,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 63 remaining) [2024-01-27 14:53:49,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 63 remaining) [2024-01-27 14:53:49,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 63 remaining) [2024-01-27 14:53:49,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 63 remaining) [2024-01-27 14:53:49,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 63 remaining) [2024-01-27 14:53:49,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 63 remaining) [2024-01-27 14:53:49,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 63 remaining) [2024-01-27 14:53:49,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 63 remaining) [2024-01-27 14:53:49,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 63 remaining) [2024-01-27 14:53:49,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 63 remaining) [2024-01-27 14:53:49,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 63 remaining) [2024-01-27 14:53:49,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 63 remaining) [2024-01-27 14:53:49,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 63 remaining) [2024-01-27 14:53:49,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 63 remaining) [2024-01-27 14:53:49,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 63 remaining) [2024-01-27 14:53:49,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 63 remaining) [2024-01-27 14:53:49,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 63 remaining) [2024-01-27 14:53:49,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 63 remaining) [2024-01-27 14:53:49,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 63 remaining) [2024-01-27 14:53:49,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 63 remaining) [2024-01-27 14:53:49,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 63 remaining) [2024-01-27 14:53:49,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 63 remaining) [2024-01-27 14:53:49,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 63 remaining) [2024-01-27 14:53:49,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 63 remaining) [2024-01-27 14:53:49,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 63 remaining) [2024-01-27 14:53:49,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 63 remaining) [2024-01-27 14:53:49,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 63 remaining) [2024-01-27 14:53:49,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 63 remaining) [2024-01-27 14:53:49,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 63 remaining) [2024-01-27 14:53:49,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 63 remaining) [2024-01-27 14:53:49,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 63 remaining) [2024-01-27 14:53:49,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 63 remaining) [2024-01-27 14:53:49,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 63 remaining) [2024-01-27 14:53:49,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 63 remaining) [2024-01-27 14:53:49,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 63 remaining) [2024-01-27 14:53:49,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 63 remaining) [2024-01-27 14:53:49,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 63 remaining) [2024-01-27 14:53:49,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 63 remaining) [2024-01-27 14:53:49,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 63 remaining) [2024-01-27 14:53:49,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 63 remaining) [2024-01-27 14:53:49,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 63 remaining) [2024-01-27 14:53:49,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 63 remaining) [2024-01-27 14:53:49,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 63 remaining) [2024-01-27 14:53:49,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 63 remaining) [2024-01-27 14:53:49,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 63 remaining) [2024-01-27 14:53:49,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 63 remaining) [2024-01-27 14:53:49,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 63 remaining) [2024-01-27 14:53:49,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 63 remaining) [2024-01-27 14:53:49,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 63 remaining) [2024-01-27 14:53:49,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 63 remaining) [2024-01-27 14:53:49,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 63 remaining) [2024-01-27 14:53:49,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 63 remaining) [2024-01-27 14:53:49,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 63 remaining) [2024-01-27 14:53:49,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 63 remaining) [2024-01-27 14:53:49,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 63 remaining) [2024-01-27 14:53:49,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 63 remaining) [2024-01-27 14:53:49,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 63 remaining) [2024-01-27 14:53:49,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 63 remaining) [2024-01-27 14:53:49,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 63 remaining) [2024-01-27 14:53:49,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 63 remaining) [2024-01-27 14:53:49,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 63 remaining) [2024-01-27 14:53:49,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 14:53:49,368 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:53:49,373 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 14:53:49,373 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 14:53:49,432 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-01-27 14:53:49,432 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-01-27 14:53:49,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 02:53:49 BasicIcfg [2024-01-27 14:53:49,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 14:53:49,433 INFO L158 Benchmark]: Toolchain (without parser) took 8389.95ms. Allocated memory was 144.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 86.1MB in the beginning and 975.6MB in the end (delta: -889.5MB). Peak memory consumption was 398.8MB. Max. memory is 16.1GB. [2024-01-27 14:53:49,434 INFO L158 Benchmark]: Witness Parser took 0.30ms. Allocated memory is still 144.7MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:53:49,434 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:53:49,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.99ms. Allocated memory is still 144.7MB. Free memory was 86.1MB in the beginning and 48.4MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-01-27 14:53:49,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.07ms. Allocated memory is still 144.7MB. Free memory was 48.4MB in the beginning and 46.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:53:49,434 INFO L158 Benchmark]: Boogie Preprocessor took 54.57ms. Allocated memory is still 144.7MB. Free memory was 46.2MB in the beginning and 43.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 14:53:49,435 INFO L158 Benchmark]: RCFGBuilder took 710.65ms. Allocated memory is still 144.7MB. Free memory was 43.2MB in the beginning and 85.2MB in the end (delta: -41.9MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-01-27 14:53:49,435 INFO L158 Benchmark]: TraceAbstraction took 6977.99ms. Allocated memory was 144.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 84.2MB in the beginning and 975.6MB in the end (delta: -891.4MB). Peak memory consumption was 395.0MB. Max. memory is 16.1GB. [2024-01-27 14:53:49,436 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.30ms. Allocated memory is still 144.7MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.99ms. Allocated memory is still 144.7MB. Free memory was 86.1MB in the beginning and 48.4MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.07ms. Allocated memory is still 144.7MB. Free memory was 48.4MB in the beginning and 46.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.57ms. Allocated memory is still 144.7MB. Free memory was 46.2MB in the beginning and 43.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 710.65ms. Allocated memory is still 144.7MB. Free memory was 43.2MB in the beginning and 85.2MB in the end (delta: -41.9MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6977.99ms. Allocated memory was 144.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 84.2MB in the beginning and 975.6MB in the end (delta: -891.4MB). Peak memory consumption was 395.0MB. 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={6: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={6: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={8:0}, t2={9:0}, t3={5:0}, t4={10:0}, t5={7:0}, v={-2: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={6:0}, v={-2: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={-2: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={-2: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.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 548 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 527 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.6s 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.1s SatisfiabilityAnalysisTime, 0.9s 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-27 14:53:49,477 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