/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:37:44,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:37:44,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:37:44,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:37:44,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:37:44,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:37:44,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:37:44,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:37:44,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:37:44,310 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:37:44,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:37:44,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:37:44,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:37:44,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:37:44,310 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:37:44,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:37:44,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:37:44,310 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:37:44,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:37:44,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:37:44,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:37:44,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:37:44,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:37:44,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:37:44,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:37:44,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:37:44,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:37:44,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:37:44,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:37:44,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:37:44,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:37:44,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:37:44,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:37:44,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:37:44,313 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:37:44,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:37:44,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:37:44,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:37:44,541 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:37:44,541 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:37:44,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c [2025-04-13 20:37:45,837 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5aab6cce/d2ee2615de50414ba552ee6c4b86c6c0/FLAG9137c4eb3 [2025-04-13 20:37:46,027 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:37:46,027 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c [2025-04-13 20:37:46,033 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5aab6cce/d2ee2615de50414ba552ee6c4b86c6c0/FLAG9137c4eb3 [2025-04-13 20:37:47,039 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5aab6cce/d2ee2615de50414ba552ee6c4b86c6c0 [2025-04-13 20:37:47,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:37:47,044 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:37:47,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:37:47,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:37:47,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:37:47,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a87b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47, skipping insertion in model container [2025-04-13 20:37:47,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:37:47,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2025-04-13 20:37:47,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:37:47,254 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:37:47,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2025-04-13 20:37:47,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:37:47,295 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:37:47,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47 WrapperNode [2025-04-13 20:37:47,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:37:47,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:37:47,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:37:47,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:37:47,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,338 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 319 [2025-04-13 20:37:47,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:37:47,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:37:47,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:37:47,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:37:47,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,363 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 20:37:47,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,371 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:37:47,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:37:47,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:37:47,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:37:47,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (1/1) ... [2025-04-13 20:37:47,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:37:47,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:47,407 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) [2025-04-13 20:37:47,409 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 [2025-04-13 20:37:47,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:37:47,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:37:47,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:37:47,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 20:37:47,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:37:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:37:47,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:37:47,428 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:37:47,526 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:37:47,528 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:37:47,930 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:37:47,931 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:37:47,931 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:37:48,287 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:37:48,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:37:48 BoogieIcfgContainer [2025-04-13 20:37:48,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:37:48,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:37:48,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:37:48,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:37:48,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:37:47" (1/3) ... [2025-04-13 20:37:48,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bda49b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:37:48, skipping insertion in model container [2025-04-13 20:37:48,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:47" (2/3) ... [2025-04-13 20:37:48,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bda49b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:37:48, skipping insertion in model container [2025-04-13 20:37:48,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:37:48" (3/3) ... [2025-04-13 20:37:48,296 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series3.wvr.c [2025-04-13 20:37:48,306 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:37:48,307 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series3.wvr.c that has 5 procedures, 45 locations, 47 edges, 1 initial locations, 7 loop locations, and 1 error locations. [2025-04-13 20:37:48,307 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:37:48,375 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 20:37:48,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 51 transitions, 130 flow [2025-04-13 20:37:48,428 INFO L116 PetriNetUnfolderBase]: 7/47 cut-off events. [2025-04-13 20:37:48,432 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:37:48,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 47 events. 7/47 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-13 20:37:48,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 51 transitions, 130 flow [2025-04-13 20:37:48,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 46 transitions, 116 flow [2025-04-13 20:37:48,446 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:37:48,454 INFO L340 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, 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;@6a1ff870, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:37:48,454 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 20:37:48,471 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:37:48,472 INFO L116 PetriNetUnfolderBase]: 7/45 cut-off events. [2025-04-13 20:37:48,472 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:37:48,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:48,472 INFO L206 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] [2025-04-13 20:37:48,473 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:37:48,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:48,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1725227982, now seen corresponding path program 1 times [2025-04-13 20:37:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:48,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849924392] [2025-04-13 20:37:48,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:48,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:48,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 20:37:48,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 20:37:48,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:48,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:48,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:48,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849924392] [2025-04-13 20:37:48,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849924392] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:48,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:48,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:37:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492529126] [2025-04-13 20:37:48,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:48,768 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:37:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:48,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:37:48,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:37:48,785 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2025-04-13 20:37:48,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2025-04-13 20:37:48,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:48,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2025-04-13 20:37:48,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:49,228 INFO L116 PetriNetUnfolderBase]: 2408/3711 cut-off events. [2025-04-13 20:37:49,228 INFO L117 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2025-04-13 20:37:49,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6982 conditions, 3711 events. 2408/3711 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 21324 event pairs, 472 based on Foata normal form. 1/3510 useless extension candidates. Maximal degree in co-relation 6291. Up to 2067 conditions per place. [2025-04-13 20:37:49,255 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 43 selfloop transitions, 3 changer transitions 1/63 dead transitions. [2025-04-13 20:37:49,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 259 flow [2025-04-13 20:37:49,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:37:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:37:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-04-13 20:37:49,265 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2025-04-13 20:37:49,266 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 116 flow. Second operand 3 states and 108 transitions. [2025-04-13 20:37:49,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 259 flow [2025-04-13 20:37:49,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 233 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 20:37:49,278 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 119 flow [2025-04-13 20:37:49,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2025-04-13 20:37:49,283 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-04-13 20:37:49,283 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 119 flow [2025-04-13 20:37:49,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2025-04-13 20:37:49,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:49,284 INFO L206 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] [2025-04-13 20:37:49,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:37:49,285 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:37:49,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash -730086859, now seen corresponding path program 1 times [2025-04-13 20:37:49,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:49,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841577726] [2025-04-13 20:37:49,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:49,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:49,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:37:49,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:37:49,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:49,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:49,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:49,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841577726] [2025-04-13 20:37:49,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841577726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:49,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:49,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:37:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088755044] [2025-04-13 20:37:49,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:49,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:37:49,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:49,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:37:49,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:37:49,487 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2025-04-13 20:37:49,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2025-04-13 20:37:49,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:49,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2025-04-13 20:37:49,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:49,899 INFO L116 PetriNetUnfolderBase]: 2669/4085 cut-off events. [2025-04-13 20:37:49,899 INFO L117 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2025-04-13 20:37:49,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8439 conditions, 4085 events. 2669/4085 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 24566 event pairs, 761 based on Foata normal form. 104/3954 useless extension candidates. Maximal degree in co-relation 3135. Up to 2321 conditions per place. [2025-04-13 20:37:49,921 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 52 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-04-13 20:37:49,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 285 flow [2025-04-13 20:37:49,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:37:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:37:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-04-13 20:37:49,923 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7320261437908496 [2025-04-13 20:37:49,923 INFO L175 Difference]: Start difference. First operand has 47 places, 48 transitions, 119 flow. Second operand 3 states and 112 transitions. [2025-04-13 20:37:49,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 285 flow [2025-04-13 20:37:49,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:49,926 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 130 flow [2025-04-13 20:37:49,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2025-04-13 20:37:49,927 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-04-13 20:37:49,927 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 130 flow [2025-04-13 20:37:49,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2025-04-13 20:37:49,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:49,928 INFO L206 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] [2025-04-13 20:37:49,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:37:49,928 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:37:49,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:49,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1964792365, now seen corresponding path program 1 times [2025-04-13 20:37:49,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:49,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693455007] [2025-04-13 20:37:49,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:49,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:49,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:37:49,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:37:49,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:49,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:50,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:50,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693455007] [2025-04-13 20:37:50,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693455007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:50,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:50,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:37:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088967581] [2025-04-13 20:37:50,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:50,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:37:50,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:50,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:37:50,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:37:50,064 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2025-04-13 20:37:50,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2025-04-13 20:37:50,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:50,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2025-04-13 20:37:50,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:50,419 INFO L116 PetriNetUnfolderBase]: 2977/4709 cut-off events. [2025-04-13 20:37:50,419 INFO L117 PetriNetUnfolderBase]: For 1586/1601 co-relation queries the response was YES. [2025-04-13 20:37:50,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10157 conditions, 4709 events. 2977/4709 cut-off events. For 1586/1601 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 29976 event pairs, 955 based on Foata normal form. 69/4605 useless extension candidates. Maximal degree in co-relation 4634. Up to 2600 conditions per place. [2025-04-13 20:37:50,443 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 52 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-04-13 20:37:50,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 301 flow [2025-04-13 20:37:50,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:37:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:37:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-04-13 20:37:50,444 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7189542483660131 [2025-04-13 20:37:50,444 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 130 flow. Second operand 3 states and 110 transitions. [2025-04-13 20:37:50,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 301 flow [2025-04-13 20:37:50,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:50,447 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 142 flow [2025-04-13 20:37:50,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-04-13 20:37:50,448 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-04-13 20:37:50,448 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 142 flow [2025-04-13 20:37:50,448 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2025-04-13 20:37:50,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:50,448 INFO L206 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] [2025-04-13 20:37:50,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:37:50,449 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:37:50,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash 203691002, now seen corresponding path program 1 times [2025-04-13 20:37:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:50,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882184534] [2025-04-13 20:37:50,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:50,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 20:37:50,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:37:50,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:50,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:37:50,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:50,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882184534] [2025-04-13 20:37:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882184534] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:50,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:50,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:37:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910823246] [2025-04-13 20:37:50,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:50,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:37:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:50,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:37:50,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:37:50,627 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2025-04-13 20:37:50,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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) [2025-04-13 20:37:50,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:50,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2025-04-13 20:37:50,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:51,035 INFO L116 PetriNetUnfolderBase]: 3555/5584 cut-off events. [2025-04-13 20:37:51,035 INFO L117 PetriNetUnfolderBase]: For 2361/2442 co-relation queries the response was YES. [2025-04-13 20:37:51,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12771 conditions, 5584 events. 3555/5584 cut-off events. For 2361/2442 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 37015 event pairs, 2675 based on Foata normal form. 108/5344 useless extension candidates. Maximal degree in co-relation 6216. Up to 4011 conditions per place. [2025-04-13 20:37:51,059 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 59 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2025-04-13 20:37:51,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 345 flow [2025-04-13 20:37:51,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:37:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:37:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-04-13 20:37:51,062 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6715686274509803 [2025-04-13 20:37:51,062 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 142 flow. Second operand 4 states and 137 transitions. [2025-04-13 20:37:51,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 345 flow [2025-04-13 20:37:51,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:51,065 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 160 flow [2025-04-13 20:37:51,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-04-13 20:37:51,065 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2025-04-13 20:37:51,065 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 160 flow [2025-04-13 20:37:51,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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) [2025-04-13 20:37:51,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:51,066 INFO L206 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] [2025-04-13 20:37:51,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:37:51,066 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:37:51,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash -489148634, now seen corresponding path program 1 times [2025-04-13 20:37:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:51,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692036202] [2025-04-13 20:37:51,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:51,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 20:37:51,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:37:51,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:51,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:37:51,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:51,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692036202] [2025-04-13 20:37:51,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692036202] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:51,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:51,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:37:51,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188798758] [2025-04-13 20:37:51,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:51,208 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:37:51,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:51,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:37:51,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:37:51,209 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2025-04-13 20:37:51,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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) [2025-04-13 20:37:51,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:51,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2025-04-13 20:37:51,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:51,756 INFO L116 PetriNetUnfolderBase]: 4275/6980 cut-off events. [2025-04-13 20:37:51,756 INFO L117 PetriNetUnfolderBase]: For 3055/3153 co-relation queries the response was YES. [2025-04-13 20:37:51,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15812 conditions, 6980 events. 4275/6980 cut-off events. For 3055/3153 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 49646 event pairs, 3295 based on Foata normal form. 145/6692 useless extension candidates. Maximal degree in co-relation 13265. Up to 4871 conditions per place. [2025-04-13 20:37:51,781 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 58 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2025-04-13 20:37:51,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 368 flow [2025-04-13 20:37:51,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:37:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:37:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-04-13 20:37:51,782 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.615686274509804 [2025-04-13 20:37:51,782 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 160 flow. Second operand 5 states and 157 transitions. [2025-04-13 20:37:51,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 368 flow [2025-04-13 20:37:51,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 364 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:51,784 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 195 flow [2025-04-13 20:37:51,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-04-13 20:37:51,784 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-04-13 20:37:51,784 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 195 flow [2025-04-13 20:37:51,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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) [2025-04-13 20:37:51,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:51,785 INFO L206 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] [2025-04-13 20:37:51,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:37:51,785 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:37:51,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash -324915943, now seen corresponding path program 1 times [2025-04-13 20:37:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:51,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083813807] [2025-04-13 20:37:51,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:51,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:51,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:37:51,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:37:51,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:51,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:52,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:52,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083813807] [2025-04-13 20:37:52,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083813807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:52,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:52,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:37:52,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419541308] [2025-04-13 20:37:52,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:52,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:37:52,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:52,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:37:52,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:37:52,052 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-04-13 20:37:52,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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) [2025-04-13 20:37:52,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:52,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-04-13 20:37:52,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:52,949 INFO L116 PetriNetUnfolderBase]: 9137/14363 cut-off events. [2025-04-13 20:37:52,949 INFO L117 PetriNetUnfolderBase]: For 5676/5906 co-relation queries the response was YES. [2025-04-13 20:37:52,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33054 conditions, 14363 events. 9137/14363 cut-off events. For 5676/5906 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 104968 event pairs, 3234 based on Foata normal form. 5/13460 useless extension candidates. Maximal degree in co-relation 24304. Up to 5797 conditions per place. [2025-04-13 20:37:53,006 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 97 selfloop transitions, 8 changer transitions 1/119 dead transitions. [2025-04-13 20:37:53,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 119 transitions, 603 flow [2025-04-13 20:37:53,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:37:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:37:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2025-04-13 20:37:53,007 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.630718954248366 [2025-04-13 20:37:53,007 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 195 flow. Second operand 6 states and 193 transitions. [2025-04-13 20:37:53,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 119 transitions, 603 flow [2025-04-13 20:37:53,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 119 transitions, 596 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:53,011 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 236 flow [2025-04-13 20:37:53,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2025-04-13 20:37:53,012 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2025-04-13 20:37:53,012 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 236 flow [2025-04-13 20:37:53,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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) [2025-04-13 20:37:53,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:53,012 INFO L206 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] [2025-04-13 20:37:53,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:37:53,012 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:37:53,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1568596546, now seen corresponding path program 1 times [2025-04-13 20:37:53,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:53,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283072526] [2025-04-13 20:37:53,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:53,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:37:53,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:37:53,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:53,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:53,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:53,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283072526] [2025-04-13 20:37:53,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283072526] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:53,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:53,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:37:53,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957582220] [2025-04-13 20:37:53,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:53,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:37:53,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:53,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:37:53,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:37:53,274 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-04-13 20:37:53,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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) [2025-04-13 20:37:53,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:53,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-04-13 20:37:53,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:54,222 INFO L116 PetriNetUnfolderBase]: 7733/11999 cut-off events. [2025-04-13 20:37:54,223 INFO L117 PetriNetUnfolderBase]: For 6264/6630 co-relation queries the response was YES. [2025-04-13 20:37:54,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28807 conditions, 11999 events. 7733/11999 cut-off events. For 6264/6630 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 83791 event pairs, 3191 based on Foata normal form. 11/11079 useless extension candidates. Maximal degree in co-relation 23962. Up to 5705 conditions per place. [2025-04-13 20:37:54,293 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 60 selfloop transitions, 6 changer transitions 28/107 dead transitions. [2025-04-13 20:37:54,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 107 transitions, 560 flow [2025-04-13 20:37:54,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:37:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:37:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2025-04-13 20:37:54,294 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5980392156862745 [2025-04-13 20:37:54,294 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 236 flow. Second operand 6 states and 183 transitions. [2025-04-13 20:37:54,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 107 transitions, 560 flow [2025-04-13 20:37:54,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 107 transitions, 551 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:54,300 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 242 flow [2025-04-13 20:37:54,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2025-04-13 20:37:54,300 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2025-04-13 20:37:54,300 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 242 flow [2025-04-13 20:37:54,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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) [2025-04-13 20:37:54,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:54,301 INFO L206 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] [2025-04-13 20:37:54,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:37:54,301 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:37:54,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:54,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1543948468, now seen corresponding path program 1 times [2025-04-13 20:37:54,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:54,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052138130] [2025-04-13 20:37:54,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:54,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:54,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:37:54,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:37:54,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:54,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:54,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:54,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052138130] [2025-04-13 20:37:54,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052138130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:54,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:54,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:37:54,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200319339] [2025-04-13 20:37:54,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:54,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:37:54,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:54,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:37:54,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:37:54,577 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2025-04-13 20:37:54,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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) [2025-04-13 20:37:54,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:54,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2025-04-13 20:37:54,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:55,054 INFO L116 PetriNetUnfolderBase]: 4747/7447 cut-off events. [2025-04-13 20:37:55,054 INFO L117 PetriNetUnfolderBase]: For 5430/5458 co-relation queries the response was YES. [2025-04-13 20:37:55,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19165 conditions, 7447 events. 4747/7447 cut-off events. For 5430/5458 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 48123 event pairs, 886 based on Foata normal form. 280/7631 useless extension candidates. Maximal degree in co-relation 16663. Up to 4843 conditions per place. [2025-04-13 20:37:55,089 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 68 selfloop transitions, 7 changer transitions 1/90 dead transitions. [2025-04-13 20:37:55,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 90 transitions, 506 flow [2025-04-13 20:37:55,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:37:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:37:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2025-04-13 20:37:55,090 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5522875816993464 [2025-04-13 20:37:55,090 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 242 flow. Second operand 6 states and 169 transitions. [2025-04-13 20:37:55,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 90 transitions, 506 flow [2025-04-13 20:37:55,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 90 transitions, 484 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-04-13 20:37:55,095 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 236 flow [2025-04-13 20:37:55,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2025-04-13 20:37:55,096 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2025-04-13 20:37:55,096 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 236 flow [2025-04-13 20:37:55,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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) [2025-04-13 20:37:55,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:55,096 INFO L206 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] [2025-04-13 20:37:55,096 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:37:55,096 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:37:55,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:55,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1980546757, now seen corresponding path program 1 times [2025-04-13 20:37:55,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:55,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978796114] [2025-04-13 20:37:55,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:55,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:55,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 20:37:55,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:37:55,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:55,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:55,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:55,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978796114] [2025-04-13 20:37:55,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978796114] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:55,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:55,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:37:55,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118136643] [2025-04-13 20:37:55,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:55,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:37:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:55,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:37:55,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:37:55,347 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2025-04-13 20:37:55,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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) [2025-04-13 20:37:55,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:55,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2025-04-13 20:37:55,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:55,728 INFO L116 PetriNetUnfolderBase]: 3622/5508 cut-off events. [2025-04-13 20:37:55,729 INFO L117 PetriNetUnfolderBase]: For 5051/5221 co-relation queries the response was YES. [2025-04-13 20:37:55,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14626 conditions, 5508 events. 3622/5508 cut-off events. For 5051/5221 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 32418 event pairs, 517 based on Foata normal form. 386/5819 useless extension candidates. Maximal degree in co-relation 14593. Up to 3327 conditions per place. [2025-04-13 20:37:55,745 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 66 selfloop transitions, 5 changer transitions 2/87 dead transitions. [2025-04-13 20:37:55,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 87 transitions, 498 flow [2025-04-13 20:37:55,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:37:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:37:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2025-04-13 20:37:55,746 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.545751633986928 [2025-04-13 20:37:55,746 INFO L175 Difference]: Start difference. First operand has 72 places, 57 transitions, 236 flow. Second operand 6 states and 167 transitions. [2025-04-13 20:37:55,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 87 transitions, 498 flow [2025-04-13 20:37:55,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 87 transitions, 464 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-13 20:37:55,749 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 208 flow [2025-04-13 20:37:55,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2025-04-13 20:37:55,749 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2025-04-13 20:37:55,749 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 208 flow [2025-04-13 20:37:55,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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) [2025-04-13 20:37:55,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:55,750 INFO L206 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] [2025-04-13 20:37:55,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:37:55,750 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:37:55,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:55,750 INFO L85 PathProgramCache]: Analyzing trace with hash 572743896, now seen corresponding path program 1 times [2025-04-13 20:37:55,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:55,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706103498] [2025-04-13 20:37:55,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:55,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:55,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 20:37:55,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 20:37:55,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:55,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:37:55,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:55,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706103498] [2025-04-13 20:37:55,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706103498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:55,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:55,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:37:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550772578] [2025-04-13 20:37:55,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:55,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:37:55,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:55,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:37:55,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:37:56,022 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2025-04-13 20:37:56,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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) [2025-04-13 20:37:56,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:56,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2025-04-13 20:37:56,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:56,416 INFO L116 PetriNetUnfolderBase]: 3636/5314 cut-off events. [2025-04-13 20:37:56,416 INFO L117 PetriNetUnfolderBase]: For 4490/4750 co-relation queries the response was YES. [2025-04-13 20:37:56,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14380 conditions, 5314 events. 3636/5314 cut-off events. For 4490/4750 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 30539 event pairs, 510 based on Foata normal form. 442/5727 useless extension candidates. Maximal degree in co-relation 14348. Up to 3509 conditions per place. [2025-04-13 20:37:56,442 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 79 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2025-04-13 20:37:56,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 557 flow [2025-04-13 20:37:56,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:37:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:37:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2025-04-13 20:37:56,444 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5490196078431373 [2025-04-13 20:37:56,444 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 208 flow. Second operand 7 states and 196 transitions. [2025-04-13 20:37:56,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 557 flow [2025-04-13 20:37:56,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 100 transitions, 537 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-04-13 20:37:56,447 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 230 flow [2025-04-13 20:37:56,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2025-04-13 20:37:56,449 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2025-04-13 20:37:56,449 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 230 flow [2025-04-13 20:37:56,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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) [2025-04-13 20:37:56,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:56,449 INFO L206 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] [2025-04-13 20:37:56,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:37:56,450 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:37:56,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:56,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2093622880, now seen corresponding path program 2 times [2025-04-13 20:37:56,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:56,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111845947] [2025-04-13 20:37:56,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:37:56,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:56,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 20:37:56,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 43 statements. [2025-04-13 20:37:56,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:37:56,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:37:56,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:56,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111845947] [2025-04-13 20:37:56,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111845947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:56,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:56,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:37:56,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504741657] [2025-04-13 20:37:56,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:56,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:37:56,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:56,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:37:56,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:37:56,598 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2025-04-13 20:37:56,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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) [2025-04-13 20:37:56,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:56,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2025-04-13 20:37:56,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:57,184 INFO L116 PetriNetUnfolderBase]: 5797/8691 cut-off events. [2025-04-13 20:37:57,185 INFO L117 PetriNetUnfolderBase]: For 8252/8619 co-relation queries the response was YES. [2025-04-13 20:37:57,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24366 conditions, 8691 events. 5797/8691 cut-off events. For 8252/8619 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 56325 event pairs, 537 based on Foata normal form. 536/9172 useless extension candidates. Maximal degree in co-relation 24334. Up to 4079 conditions per place. [2025-04-13 20:37:57,231 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 108 selfloop transitions, 10 changer transitions 0/132 dead transitions. [2025-04-13 20:37:57,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 132 transitions, 759 flow [2025-04-13 20:37:57,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:37:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:37:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2025-04-13 20:37:57,232 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6633986928104575 [2025-04-13 20:37:57,232 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 230 flow. Second operand 6 states and 203 transitions. [2025-04-13 20:37:57,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 132 transitions, 759 flow [2025-04-13 20:37:57,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 132 transitions, 752 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 20:37:57,244 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 316 flow [2025-04-13 20:37:57,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2025-04-13 20:37:57,244 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2025-04-13 20:37:57,244 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 316 flow [2025-04-13 20:37:57,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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) [2025-04-13 20:37:57,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:57,245 INFO L206 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] [2025-04-13 20:37:57,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:37:57,245 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:37:57,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash 592286946, now seen corresponding path program 3 times [2025-04-13 20:37:57,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:57,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993960554] [2025-04-13 20:37:57,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:37:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:57,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 2 equivalence classes. [2025-04-13 20:37:57,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 20:37:57,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:37:57,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 20:37:57,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 20:37:57,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 20:37:57,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 20:37:57,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:57,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 20:37:57,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 20:37:57,363 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 20:37:57,364 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 20:37:57,365 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 20:37:57,365 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 20:37:57,365 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 20:37:57,365 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 20:37:57,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:37:57,366 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:57,457 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:37:57,457 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:37:57,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:37:57 BasicIcfg [2025-04-13 20:37:57,460 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:37:57,460 INFO L158 Benchmark]: Toolchain (without parser) took 10416.86ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 98.1MB in the beginning and 507.5MB in the end (delta: -409.4MB). Peak memory consumption was 539.0MB. Max. memory is 8.0GB. [2025-04-13 20:37:57,460 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:37:57,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.46ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 82.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:37:57,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.18ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 79.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:37:57,461 INFO L158 Benchmark]: Boogie Preprocessor took 45.34ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 76.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:37:57,461 INFO L158 Benchmark]: RCFGBuilder took 903.17ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 32.5MB in the end (delta: 43.8MB). Peak memory consumption was 61.7MB. Max. memory is 8.0GB. [2025-04-13 20:37:57,461 INFO L158 Benchmark]: TraceAbstraction took 9170.86ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 32.5MB in the beginning and 507.5MB in the end (delta: -475.0MB). Peak memory consumption was 473.0MB. Max. memory is 8.0GB. [2025-04-13 20:37:57,462 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.46ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 82.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.18ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 79.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 45.34ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 76.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 903.17ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 32.5MB in the end (delta: 43.8MB). Peak memory consumption was 61.7MB. Max. memory is 8.0GB. * TraceAbstraction took 9170.86ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 32.5MB in the beginning and 507.5MB in the end (delta: -475.0MB). Peak memory consumption was 473.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 155]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int *q1, *q2, *f; [L42] 0 int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, total; [L129] 0 pthread_t t1, t2, t3, t4; [L131] 0 N = __VERIFIER_nondet_int() [L132] 0 n1 = __VERIFIER_nondet_int() [L133] 0 n2 = __VERIFIER_nondet_int() [L134] 0 q1_front = __VERIFIER_nondet_int() [L135] 0 q1_back = q1_front [L136] 0 q2_front = __VERIFIER_nondet_int() [L137] 0 q2_back = q2_front [L138] CALL, EXPR 0 create_fresh_int_array(n1) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \at(size, Pre)=1, arr={-2:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \at(size, Pre)=1, arr={-2:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n1) [L138] 0 q1 = create_fresh_int_array(n1) [L139] CALL, EXPR 0 create_fresh_int_array(n2) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \at(size, Pre)=1, arr={-3:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \at(size, Pre)=1, arr={-3:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L139] RET, EXPR 0 create_fresh_int_array(n2) [L139] 0 q2 = create_fresh_int_array(n2) [L140] CALL, EXPR 0 create_fresh_int_array(N) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \at(size, Pre)=1, arr={-5:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \at(size, Pre)=1, arr={-5:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L140] RET, EXPR 0 create_fresh_int_array(N) [L140] 0 f = create_fresh_int_array(N) [L142] CALL 0 assume_abort_if_not(N >= 0) [L38] COND FALSE 0 !(!cond) [L142] RET 0 assume_abort_if_not(N >= 0) [L145] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, total=0] [L49] 1 _Bool cond = i < N; VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L38] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L54] EXPR 1 q1[q1_back] [L54] EXPR 1 f[i] [L54] CALL 1 assume_abort_if_not(q1[q1_back] == f[i]) [L38] COND FALSE 1 !(!cond) [L54] RET 1 assume_abort_if_not(q1[q1_back] == f[i]) [L55] CALL 1 assume_abort_if_not(q1_back < 2147483647) [L38] COND FALSE 1 !(!cond) [L55] RET 1 assume_abort_if_not(q1_back < 2147483647) [L56] 1 i++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L146] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [N=1, f={-5:0}, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, total=0] [L71] 2 _Bool cond = j < N; VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L73] COND TRUE 2 \read(cond) VAL [N=1, f={-5:0}, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L75] CALL 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L38] COND FALSE 2 !(!cond) [L75] RET 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L76] EXPR 2 f[j] [L76] CALL 2 assume_abort_if_not(f[j] > -2147483648) [L38] COND FALSE 2 !(!cond) [L76] RET 2 assume_abort_if_not(f[j] > -2147483648) [L77] EXPR 2 q2[q2_back] [L77] EXPR 2 f[j] [L77] CALL 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L38] COND FALSE 2 !(!cond) [L77] RET 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L78] CALL 2 assume_abort_if_not(q2_back < 2147483647) [L38] COND FALSE 2 !(!cond) [L78] RET 2 assume_abort_if_not(q2_back < 2147483647) [L79] 2 j++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L147] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, t3=1, total=0] [L59] 1 q1_back++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L94] 3 _Bool cond = i < N || q1_front < q1_back; VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L96] COND TRUE 3 \read(cond) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L98] CALL 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L38] COND FALSE 3 !(!cond) [L98] RET 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L99] EXPR 3 q1[q1_front] [L99] CALL, EXPR 3 plus(total, q1[q1_front]) [L172] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L38] COND FALSE 3 !(!cond) [L172] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L173] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 3 !(!cond) [L173] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L174] 3 return a + b; [L99] RET, EXPR 3 plus(total, q1[q1_front]) [L99] 3 total = plus(total, q1[q1_front]) [L100] 3 q1_front++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=0, q2_front=0, total=-6] [L103] 3 cond = i < N || q1_front < q1_back VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=0, q2_front=0, total=-6] [L96] COND FALSE 3 !(\read(cond)) [L107] 3 return 0; [L148] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=-6] [L112] 4 _Bool cond = j < N || q2_front < q2_back; VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=0, q2_front=0, total=-6] [L62] 1 cond = i < N VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=0, q2_front=0, total=-6] [L51] COND FALSE 1 !(\read(cond)) [L66] 1 return 0; [L114] COND FALSE 4 !(\read(cond)) [L125] 4 return 0; [L149] FCALL, JOIN 1 pthread_join(t1, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=-6] [L82] 2 q2_back++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, total=-6] [L85] 2 cond = j < N VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, total=-6] [L73] COND FALSE 2 !(\read(cond)) [L89] 2 return 0; [L150] FCALL, JOIN 2 pthread_join(t2, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=-6] [L151] FCALL, JOIN 3 pthread_join(t3, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=-6] [L152] FCALL, JOIN 4 pthread_join(t4, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=-6] [L154] CALL 0 assume_abort_if_not(total != 0) [L38] COND FALSE 0 !(!cond) [L154] RET 0 assume_abort_if_not(total != 0) [L155] 0 reach_error() VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=-6] - UnprovableResult [Line: 145]: 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: 148]: 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: 147]: 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: 146]: 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 9 procedures, 75 locations, 85 edges, 5 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: 9.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 494 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1613 IncrementalHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 18 mSDtfsCounter, 1613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=11, InterpolantAutomatonStates: 55, 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.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 444 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 1092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 21/21 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 20:37:57,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...