/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/chl-array-int-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:53:36,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:53:36,713 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 19:53:36,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:53:36,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:53:36,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:53:36,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:53:36,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:53:36,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:53:36,734 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:53:36,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:53:36,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:53:36,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:53:36,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:53:36,736 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:53:36,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:53:36,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:53:36,736 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:53:36,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:53:36,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:53:36,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:53:36,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:53:36,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:53:36,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:53:36,737 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:53:36,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:53:36,737 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:53:36,737 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:53:36,737 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:53:36,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:53:36,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:53:36,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:53:36,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:53:36,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:53:36,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:53:36,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:53:36,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:53:36,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:53:36,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:53:36,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:53:36,738 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:53:36,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:53:36,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:53:36,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:53:36,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:53:36,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:53:36,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:53:36,738 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 19:53:36,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:53:36,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:53:36,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:53:36,920 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:53:36,921 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:53:36,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2025-04-13 19:53:38,171 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30412314b/8ea58b3f6c7a42a2875b980a0da9e8c2/FLAG980d23608 [2025-04-13 19:53:38,374 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:53:38,374 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2025-04-13 19:53:38,379 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30412314b/8ea58b3f6c7a42a2875b980a0da9e8c2/FLAG980d23608 [2025-04-13 19:53:39,221 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30412314b/8ea58b3f6c7a42a2875b980a0da9e8c2 [2025-04-13 19:53:39,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:53:39,224 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:53:39,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:53:39,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:53:39,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:53:39,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2dc3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39, skipping insertion in model container [2025-04-13 19:53:39,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:53:39,408 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/chl-array-int-trans.wvr.c[2767,2780] [2025-04-13 19:53:39,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:53:39,427 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:53:39,460 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/chl-array-int-trans.wvr.c[2767,2780] [2025-04-13 19:53:39,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:53:39,483 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:53:39,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39 WrapperNode [2025-04-13 19:53:39,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:53:39,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:53:39,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:53:39,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:53:39,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,523 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 13, calls inlined = 21, statements flattened = 252 [2025-04-13 19:53:39,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:53:39,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:53:39,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:53:39,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:53:39,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,546 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 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 19:53:39,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:53:39,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:53:39,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:53:39,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:53:39,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (1/1) ... [2025-04-13 19:53:39,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:53:39,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:39,583 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 19:53:39,587 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 19:53:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:53:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:53:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:53:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:53:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:53:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 19:53:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 19:53:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:53:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:53:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:53:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:53:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 19:53:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:53:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:53:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:53:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:53:39,601 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 19:53:39,676 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:53:39,677 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:53:39,960 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:53:39,961 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:53:39,961 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:53:40,256 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:53:40,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:53:40 BoogieIcfgContainer [2025-04-13 19:53:40,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:53:40,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:53:40,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:53:40,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:53:40,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:53:39" (1/3) ... [2025-04-13 19:53:40,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91d1170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:53:40, skipping insertion in model container [2025-04-13 19:53:40,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:39" (2/3) ... [2025-04-13 19:53:40,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91d1170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:53:40, skipping insertion in model container [2025-04-13 19:53:40,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:53:40" (3/3) ... [2025-04-13 19:53:40,263 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-04-13 19:53:40,273 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:53:40,274 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 25 locations, 27 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 19:53:40,274 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:53:40,320 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 19:53:40,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 19:53:40,370 INFO L116 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-04-13 19:53:40,374 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:53:40,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-13 19:53:40,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 19:53:40,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 70 flow [2025-04-13 19:53:40,385 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:53:40,394 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;@254da5e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:53:40,394 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:53:40,407 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:53:40,408 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-13 19:53:40,408 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:53:40,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:40,408 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] [2025-04-13 19:53:40,408 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 1 more)] === [2025-04-13 19:53:40,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:40,413 INFO L85 PathProgramCache]: Analyzing trace with hash -794265512, now seen corresponding path program 1 times [2025-04-13 19:53:40,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:40,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466726839] [2025-04-13 19:53:40,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:53:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:40,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:53:40,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:53:40,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:53:40,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:40,946 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 19:53:40,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:40,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466726839] [2025-04-13 19:53:40,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466726839] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:53:40,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:53:40,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:53:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590969826] [2025-04-13 19:53:40,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:53:40,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:53:40,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:53:40,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:53:40,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:53:40,976 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:53:40,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 19:53:40,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:53:40,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:53:40,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:53:41,265 INFO L116 PetriNetUnfolderBase]: 376/567 cut-off events. [2025-04-13 19:53:41,265 INFO L117 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-04-13 19:53:41,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 567 events. 376/567 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1890 event pairs, 52 based on Foata normal form. 1/439 useless extension candidates. Maximal degree in co-relation 534. Up to 216 conditions per place. [2025-04-13 19:53:41,269 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 33 selfloop transitions, 4 changer transitions 32/69 dead transitions. [2025-04-13 19:53:41,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 69 transitions, 324 flow [2025-04-13 19:53:41,271 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:53:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:53:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2025-04-13 19:53:41,279 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2025-04-13 19:53:41,280 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 70 flow. Second operand 7 states and 92 transitions. [2025-04-13 19:53:41,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 69 transitions, 324 flow [2025-04-13 19:53:41,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 69 transitions, 292 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 19:53:41,286 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 82 flow [2025-04-13 19:53:41,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2025-04-13 19:53:41,292 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-04-13 19:53:41,292 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 82 flow [2025-04-13 19:53:41,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 19:53:41,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:41,293 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] [2025-04-13 19:53:41,293 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:53:41,293 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 1 more)] === [2025-04-13 19:53:41,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:41,293 INFO L85 PathProgramCache]: Analyzing trace with hash -470130815, now seen corresponding path program 1 times [2025-04-13 19:53:41,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:41,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663375767] [2025-04-13 19:53:41,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:53:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:41,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:53:41,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:53:41,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:53:41,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:41,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:41,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663375767] [2025-04-13 19:53:41,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663375767] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:41,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745675411] [2025-04-13 19:53:41,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:53:41,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:41,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:41,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:53:41,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:53:41,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:53:41,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:53:41,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:53:41,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:41,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 19:53:41,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:53:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:41,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:53:41,960 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:53:41,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 125 [2025-04-13 19:53:42,124 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 19:53:42,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745675411] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:42,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:53:42,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 14 [2025-04-13 19:53:42,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767786035] [2025-04-13 19:53:42,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:53:42,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:53:42,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:53:42,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:53:42,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:53:42,126 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:53:42,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 19:53:42,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:53:42,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:53:42,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:53:42,382 INFO L116 PetriNetUnfolderBase]: 377/570 cut-off events. [2025-04-13 19:53:42,383 INFO L117 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-04-13 19:53:42,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 570 events. 377/570 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1903 event pairs, 40 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 1125. Up to 232 conditions per place. [2025-04-13 19:53:42,385 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 36 selfloop transitions, 3 changer transitions 34/73 dead transitions. [2025-04-13 19:53:42,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 73 transitions, 356 flow [2025-04-13 19:53:42,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:53:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:53:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-04-13 19:53:42,388 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2025-04-13 19:53:42,388 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 82 flow. Second operand 6 states and 91 transitions. [2025-04-13 19:53:42,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 73 transitions, 356 flow [2025-04-13 19:53:42,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 73 transitions, 320 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-13 19:53:42,390 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 84 flow [2025-04-13 19:53:42,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2025-04-13 19:53:42,390 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-04-13 19:53:42,390 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 84 flow [2025-04-13 19:53:42,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 19:53:42,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:42,392 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] [2025-04-13 19:53:42,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:53:42,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:42,592 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 1 more)] === [2025-04-13 19:53:42,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:42,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1553302228, now seen corresponding path program 1 times [2025-04-13 19:53:42,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:42,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741039527] [2025-04-13 19:53:42,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:53:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:42,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:53:42,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:53:42,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:53:42,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:53:42,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:42,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741039527] [2025-04-13 19:53:42,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741039527] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:42,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670349397] [2025-04-13 19:53:42,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:53:42,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:42,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:42,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:53:42,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 19:53:42,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:53:42,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:53:42,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:53:42,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:42,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 19:53:42,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:53:43,120 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:53:43,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 108 [2025-04-13 19:53:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:53:43,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:53:43,237 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:53:43,237 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 125 [2025-04-13 19:53:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:53:43,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670349397] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:43,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:53:43,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-04-13 19:53:43,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686190697] [2025-04-13 19:53:43,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:53:43,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:53:43,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:53:43,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:53:43,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:53:43,399 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:53:43,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 84 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 19:53:43,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:53:43,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:53:43,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:53:43,558 INFO L116 PetriNetUnfolderBase]: 379/570 cut-off events. [2025-04-13 19:53:43,559 INFO L117 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-04-13 19:53:43,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 570 events. 379/570 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1737 event pairs, 170 based on Foata normal form. 1/492 useless extension candidates. Maximal degree in co-relation 1265. Up to 299 conditions per place. [2025-04-13 19:53:43,562 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 25 selfloop transitions, 4 changer transitions 27/56 dead transitions. [2025-04-13 19:53:43,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 56 transitions, 268 flow [2025-04-13 19:53:43,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:53:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:53:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2025-04-13 19:53:43,564 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2025-04-13 19:53:43,564 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 84 flow. Second operand 7 states and 78 transitions. [2025-04-13 19:53:43,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 56 transitions, 268 flow [2025-04-13 19:53:43,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 56 transitions, 250 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-13 19:53:43,566 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 96 flow [2025-04-13 19:53:43,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-04-13 19:53:43,566 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-04-13 19:53:43,566 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 96 flow [2025-04-13 19:53:43,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 19:53:43,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:43,567 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] [2025-04-13 19:53:43,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 19:53:43,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-13 19:53:43,767 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 1 more)] === [2025-04-13 19:53:43,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:43,768 INFO L85 PathProgramCache]: Analyzing trace with hash 367755171, now seen corresponding path program 1 times [2025-04-13 19:53:43,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:43,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10153632] [2025-04-13 19:53:43,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:53:43,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:43,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:53:43,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:53:43,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:53:43,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:44,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:44,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10153632] [2025-04-13 19:53:44,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10153632] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:44,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147581138] [2025-04-13 19:53:44,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:53:44,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:44,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:44,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:53:44,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 19:53:44,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:53:44,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:53:44,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:53:44,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:44,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 19:53:44,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:53:45,835 INFO L325 Elim1Store]: treesize reduction 3, result has 98.3 percent of original size [2025-04-13 19:53:45,835 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 244 treesize of output 273 [2025-04-13 19:53:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:46,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:53:46,915 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:53:46,915 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 286 treesize of output 431 [2025-04-13 19:55:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:31,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147581138] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:55:31,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:55:31,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 12] total 33 [2025-04-13 19:55:31,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164034184] [2025-04-13 19:55:31,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:55:31,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:55:31,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:31,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:55:31,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 19:55:31,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:55:31,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 96 flow. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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 19:55:31,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:31,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:55:31,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:33,080 INFO L116 PetriNetUnfolderBase]: 448/669 cut-off events. [2025-04-13 19:55:33,081 INFO L117 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-04-13 19:55:33,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 669 events. 448/669 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2336 event pairs, 21 based on Foata normal form. 1/532 useless extension candidates. Maximal degree in co-relation 1469. Up to 194 conditions per place. [2025-04-13 19:55:33,083 INFO L140 encePairwiseOnDemand]: 14/30 looper letters, 97 selfloop transitions, 28 changer transitions 5/130 dead transitions. [2025-04-13 19:55:33,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 130 transitions, 620 flow [2025-04-13 19:55:33,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 19:55:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 19:55:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 191 transitions. [2025-04-13 19:55:33,086 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31833333333333336 [2025-04-13 19:55:33,086 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 96 flow. Second operand 20 states and 191 transitions. [2025-04-13 19:55:33,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 130 transitions, 620 flow [2025-04-13 19:55:33,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 130 transitions, 568 flow, removed 23 selfloop flow, removed 5 redundant places. [2025-04-13 19:55:33,088 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 238 flow [2025-04-13 19:55:33,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=238, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2025-04-13 19:55:33,089 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2025-04-13 19:55:33,089 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 238 flow [2025-04-13 19:55:33,089 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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 19:55:33,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:33,089 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] [2025-04-13 19:55:33,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 19:55:33,293 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:33,293 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 1 more)] === [2025-04-13 19:55:33,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash 690691031, now seen corresponding path program 2 times [2025-04-13 19:55:33,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:33,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843831258] [2025-04-13 19:55:33,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:55:33,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:33,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:55:33,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 19:55:33,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:55:33,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:34,093 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 19:55:34,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:34,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843831258] [2025-04-13 19:55:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843831258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:55:34,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:55:34,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 19:55:34,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422895481] [2025-04-13 19:55:34,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:55:34,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 19:55:34,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:34,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 19:55:34,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 19:55:34,094 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:55:34,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 238 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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 19:55:34,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:34,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:55:34,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:34,741 INFO L116 PetriNetUnfolderBase]: 541/788 cut-off events. [2025-04-13 19:55:34,741 INFO L117 PetriNetUnfolderBase]: For 800/800 co-relation queries the response was YES. [2025-04-13 19:55:34,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2759 conditions, 788 events. 541/788 cut-off events. For 800/800 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2612 event pairs, 52 based on Foata normal form. 1/617 useless extension candidates. Maximal degree in co-relation 2735. Up to 608 conditions per place. [2025-04-13 19:55:34,745 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 76 selfloop transitions, 34 changer transitions 4/114 dead transitions. [2025-04-13 19:55:34,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 114 transitions, 757 flow [2025-04-13 19:55:34,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:55:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:55:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2025-04-13 19:55:34,746 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36944444444444446 [2025-04-13 19:55:34,746 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 238 flow. Second operand 12 states and 133 transitions. [2025-04-13 19:55:34,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 114 transitions, 757 flow [2025-04-13 19:55:34,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 114 transitions, 726 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-04-13 19:55:34,753 INFO L231 Difference]: Finished difference. Result has 69 places, 76 transitions, 486 flow [2025-04-13 19:55:34,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=486, PETRI_PLACES=69, PETRI_TRANSITIONS=76} [2025-04-13 19:55:34,755 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2025-04-13 19:55:34,755 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 76 transitions, 486 flow [2025-04-13 19:55:34,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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 19:55:34,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:34,755 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] [2025-04-13 19:55:34,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:55:34,756 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 1 more)] === [2025-04-13 19:55:34,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:34,756 INFO L85 PathProgramCache]: Analyzing trace with hash 181941155, now seen corresponding path program 3 times [2025-04-13 19:55:34,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:34,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879743374] [2025-04-13 19:55:34,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:55:34,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:34,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:55:34,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 19:55:34,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:55:34,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:35,391 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 19:55:35,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:35,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879743374] [2025-04-13 19:55:35,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879743374] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:55:35,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:55:35,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 19:55:35,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595554448] [2025-04-13 19:55:35,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:55:35,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 19:55:35,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:35,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 19:55:35,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 19:55:35,392 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:55:35,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 76 transitions, 486 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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 19:55:35,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:35,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:55:35,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:36,033 INFO L116 PetriNetUnfolderBase]: 694/980 cut-off events. [2025-04-13 19:55:36,033 INFO L117 PetriNetUnfolderBase]: For 3841/3841 co-relation queries the response was YES. [2025-04-13 19:55:36,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 980 events. 694/980 cut-off events. For 3841/3841 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3259 event pairs, 46 based on Foata normal form. 1/981 useless extension candidates. Maximal degree in co-relation 4459. Up to 669 conditions per place. [2025-04-13 19:55:36,039 INFO L140 encePairwiseOnDemand]: 16/30 looper letters, 90 selfloop transitions, 65 changer transitions 4/159 dead transitions. [2025-04-13 19:55:36,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 159 transitions, 1377 flow [2025-04-13 19:55:36,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 19:55:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 19:55:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 140 transitions. [2025-04-13 19:55:36,040 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 19:55:36,041 INFO L175 Difference]: Start difference. First operand has 69 places, 76 transitions, 486 flow. Second operand 14 states and 140 transitions. [2025-04-13 19:55:36,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 159 transitions, 1377 flow [2025-04-13 19:55:36,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 159 transitions, 1265 flow, removed 39 selfloop flow, removed 3 redundant places. [2025-04-13 19:55:36,049 INFO L231 Difference]: Finished difference. Result has 86 places, 120 transitions, 1028 flow [2025-04-13 19:55:36,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1028, PETRI_PLACES=86, PETRI_TRANSITIONS=120} [2025-04-13 19:55:36,050 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2025-04-13 19:55:36,050 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 120 transitions, 1028 flow [2025-04-13 19:55:36,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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 19:55:36,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:36,050 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] [2025-04-13 19:55:36,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:55:36,051 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 1 more)] === [2025-04-13 19:55:36,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1101336027, now seen corresponding path program 4 times [2025-04-13 19:55:36,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:36,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942978901] [2025-04-13 19:55:36,051 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:55:36,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:36,060 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:55:36,092 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:55:36,092 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:55:36,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:36,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:36,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942978901] [2025-04-13 19:55:36,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942978901] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:55:36,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250374861] [2025-04-13 19:55:36,791 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:55:36,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:36,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:55:36,793 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:55:36,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 19:55:36,843 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:55:36,863 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:55:36,863 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:55:36,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:36,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 19:55:36,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:55:37,226 INFO L325 Elim1Store]: treesize reduction 9, result has 75.7 percent of original size [2025-04-13 19:55:37,226 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 75 [2025-04-13 19:55:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:37,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:55:38,142 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:55:38,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 392 treesize of output 846 [2025-04-13 19:55:52,639 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 19:55:52,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-13 19:55:52,640 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 19:55:52,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 19:55:52,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:52,841 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2025-04-13 19:55:52,846 INFO L158 Benchmark]: Toolchain (without parser) took 133622.00ms. Allocated memory was 155.2MB in the beginning and 704.6MB in the end (delta: 549.5MB). Free memory was 109.2MB in the beginning and 572.3MB in the end (delta: -463.2MB). Peak memory consumption was 424.0MB. Max. memory is 8.0GB. [2025-04-13 19:55:52,846 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:55:52,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.16ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 93.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 19:55:52,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.97ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 91.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:55:52,846 INFO L158 Benchmark]: Boogie Preprocessor took 35.55ms. Allocated memory is still 155.2MB. Free memory was 91.2MB in the beginning and 88.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:55:52,847 INFO L158 Benchmark]: RCFGBuilder took 696.69ms. Allocated memory is still 155.2MB. Free memory was 88.3MB in the beginning and 66.7MB in the end (delta: 21.6MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. [2025-04-13 19:55:52,847 INFO L158 Benchmark]: TraceAbstraction took 132587.06ms. Allocated memory was 155.2MB in the beginning and 704.6MB in the end (delta: 549.5MB). Free memory was 66.3MB in the beginning and 572.3MB in the end (delta: -506.0MB). Peak memory consumption was 382.8MB. Max. memory is 8.0GB. [2025-04-13 19:55:52,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.16ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 93.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.97ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 91.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 35.55ms. Allocated memory is still 155.2MB. Free memory was 91.2MB in the beginning and 88.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 696.69ms. Allocated memory is still 155.2MB. Free memory was 88.3MB in the beginning and 66.7MB in the end (delta: 21.6MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. * TraceAbstraction took 132587.06ms. Allocated memory was 155.2MB in the beginning and 704.6MB in the end (delta: 549.5MB). Free memory was 66.3MB in the beginning and 572.3MB in the end (delta: -506.0MB). Peak memory consumption was 382.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...