/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/unroll-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:00:33,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:00:33,272 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 21:00:33,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:00:33,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:00:33,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:00:33,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:00:33,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:00:33,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:00:33,294 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:00:33,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:00:33,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:00:33,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:00:33,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:00:33,295 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:00:33,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:00:33,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:00:33,295 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:00:33,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:00:33,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:00:33,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:00:33,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:00:33,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:00:33,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:00:33,295 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:00:33,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:00:33,296 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:00:33,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:00:33,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:00:33,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:00:33,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:00:33,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:00:33,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:00:33,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:00:33,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:00:33,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:00:33,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:00:33,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:00:33,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:00:33,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:00:33,297 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:00:33,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:00:33,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:00:33,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:00:33,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:00:33,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:00:33,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:00:33,297 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 21:00:33,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:00:33,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:00:33,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:00:33,535 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:00:33,538 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:00:33,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c [2025-04-13 21:00:34,832 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11609235/d0110655896b4b45ab78b10c8d7eb52c/FLAG2c95e5131 [2025-04-13 21:00:35,043 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:00:35,044 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2025-04-13 21:00:35,050 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11609235/d0110655896b4b45ab78b10c8d7eb52c/FLAG2c95e5131 [2025-04-13 21:00:35,883 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11609235/d0110655896b4b45ab78b10c8d7eb52c [2025-04-13 21:00:35,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:00:35,888 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:00:35,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:00:35,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:00:35,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:00:35,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:00:35" (1/1) ... [2025-04-13 21:00:35,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c399738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:35, skipping insertion in model container [2025-04-13 21:00:35,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:00:35" (1/1) ... [2025-04-13 21:00:35,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:00:36,091 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/unroll-4.wvr.c[2598,2611] [2025-04-13 21:00:36,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:00:36,112 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:00:36,147 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/unroll-4.wvr.c[2598,2611] [2025-04-13 21:00:36,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:00:36,174 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:00:36,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36 WrapperNode [2025-04-13 21:00:36,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:00:36,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:00:36,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:00:36,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:00:36,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,211 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 138 [2025-04-13 21:00:36,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:00:36,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:00:36,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:00:36,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:00:36,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,246 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 21:00:36,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:00:36,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:00:36,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:00:36,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:00:36,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (1/1) ... [2025-04-13 21:00:36,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:00:36,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:36,301 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 21:00:36,303 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 21:00:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:00:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 21:00:36,322 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 21:00:36,322 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 21:00:36,323 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 21:00:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:00:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:00:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:00:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:00:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 21:00:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:00:36,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:00:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:00:36,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:00:36,324 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 21:00:36,400 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:00:36,402 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:00:36,617 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:00:36,618 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:00:36,618 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:00:36,809 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:00:36,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:00:36 BoogieIcfgContainer [2025-04-13 21:00:36,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:00:36,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:00:36,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:00:36,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:00:36,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:00:35" (1/3) ... [2025-04-13 21:00:36,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c29aa50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:00:36, skipping insertion in model container [2025-04-13 21:00:36,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:36" (2/3) ... [2025-04-13 21:00:36,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c29aa50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:00:36, skipping insertion in model container [2025-04-13 21:00:36,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:00:36" (3/3) ... [2025-04-13 21:00:36,818 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2025-04-13 21:00:36,828 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:00:36,829 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-4.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 21:00:36,829 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:00:36,888 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:00:36,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 21:00:36,933 INFO L116 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-04-13 21:00:36,937 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:00:36,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 3/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-13 21:00:36,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 21:00:36,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2025-04-13 21:00:36,950 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:00:36,964 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;@5168eddc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:00:36,964 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:00:36,971 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:00:36,971 INFO L116 PetriNetUnfolderBase]: 3/15 cut-off events. [2025-04-13 21:00:36,972 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:00:36,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:36,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:36,972 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:36,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:36,977 INFO L85 PathProgramCache]: Analyzing trace with hash 418957701, now seen corresponding path program 1 times [2025-04-13 21:00:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:36,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68727659] [2025-04-13 21:00:36,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:36,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:37,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:00:37,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:00:37,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:37,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:37,226 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 21:00:37,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:37,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68727659] [2025-04-13 21:00:37,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68727659] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:37,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:37,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:00:37,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105504275] [2025-04-13 21:00:37,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:37,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:00:37,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:37,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:00:37,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:00:37,254 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:37,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21:00:37,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:37,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:37,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:37,344 INFO L116 PetriNetUnfolderBase]: 69/124 cut-off events. [2025-04-13 21:00:37,344 INFO L117 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-04-13 21:00:37,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 124 events. 69/124 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 316 event pairs, 22 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2025-04-13 21:00:37,346 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2025-04-13 21:00:37,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 27 transitions, 129 flow [2025-04-13 21:00:37,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:00:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:00:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-13 21:00:37,356 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2025-04-13 21:00:37,357 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 44 flow. Second operand 3 states and 34 transitions. [2025-04-13 21:00:37,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 27 transitions, 129 flow [2025-04-13 21:00:37,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 27 transitions, 115 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 21:00:37,362 INFO L231 Difference]: Finished difference. Result has 19 places, 18 transitions, 55 flow [2025-04-13 21:00:37,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=19, PETRI_TRANSITIONS=18} [2025-04-13 21:00:37,369 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2025-04-13 21:00:37,369 INFO L485 AbstractCegarLoop]: Abstraction has has 19 places, 18 transitions, 55 flow [2025-04-13 21:00:37,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21:00:37,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:37,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:37,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:00:37,370 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:37,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1759551730, now seen corresponding path program 1 times [2025-04-13 21:00:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:37,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520743328] [2025-04-13 21:00:37,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:37,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:37,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:00:37,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:00:37,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:37,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:37,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:37,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520743328] [2025-04-13 21:00:37,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520743328] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:37,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:37,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:00:37,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189403695] [2025-04-13 21:00:37,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:37,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:00:37,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:37,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:00:37,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:00:37,545 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:37,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 18 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 21:00:37,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:37,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:37,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:37,604 INFO L116 PetriNetUnfolderBase]: 69/125 cut-off events. [2025-04-13 21:00:37,604 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-13 21:00:37,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 125 events. 69/125 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 305 event pairs, 44 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 110. Up to 125 conditions per place. [2025-04-13 21:00:37,606 INFO L140 encePairwiseOnDemand]: 16/19 looper letters, 17 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2025-04-13 21:00:37,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 19 transitions, 95 flow [2025-04-13 21:00:37,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:00:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:00:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-04-13 21:00:37,608 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-04-13 21:00:37,608 INFO L175 Difference]: Start difference. First operand has 19 places, 18 transitions, 55 flow. Second operand 3 states and 24 transitions. [2025-04-13 21:00:37,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 19 transitions, 95 flow [2025-04-13 21:00:37,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 19 transitions, 92 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:37,609 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 64 flow [2025-04-13 21:00:37,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-04-13 21:00:37,610 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2025-04-13 21:00:37,610 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 64 flow [2025-04-13 21:00:37,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 21:00:37,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:37,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:37,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:00:37,610 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:37,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash 219983342, now seen corresponding path program 1 times [2025-04-13 21:00:37,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:37,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913614838] [2025-04-13 21:00:37,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:37,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:37,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:00:37,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:37,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:37,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:37,817 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 21:00:37,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:37,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913614838] [2025-04-13 21:00:37,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913614838] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:37,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536615270] [2025-04-13 21:00:37,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:37,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:37,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:37,821 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 21:00:37,822 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 21:00:37,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:00:37,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:37,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:37,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:37,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:37,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:37,935 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 21:00:37,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:37,986 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 21:00:37,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536615270] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:37,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 21:00:37,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-13 21:00:37,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242252945] [2025-04-13 21:00:37,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:37,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:00:37,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:37,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:00:37,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:00:37,987 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:37,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 21:00:37,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:37,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:37,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:38,096 INFO L116 PetriNetUnfolderBase]: 76/137 cut-off events. [2025-04-13 21:00:38,096 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 21:00:38,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 137 events. 76/137 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 22 based on Foata normal form. 5/141 useless extension candidates. Maximal degree in co-relation 316. Up to 71 conditions per place. [2025-04-13 21:00:38,097 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 4 changer transitions 1/33 dead transitions. [2025-04-13 21:00:38,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 33 transitions, 166 flow [2025-04-13 21:00:38,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:00:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:00:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-13 21:00:38,098 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-04-13 21:00:38,098 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 64 flow. Second operand 4 states and 41 transitions. [2025-04-13 21:00:38,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 33 transitions, 166 flow [2025-04-13 21:00:38,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 33 transitions, 162 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:38,099 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 86 flow [2025-04-13 21:00:38,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-13 21:00:38,100 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2025-04-13 21:00:38,100 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 86 flow [2025-04-13 21:00:38,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 21:00:38,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:38,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:38,107 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 21:00:38,300 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:38,301 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:38,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:38,301 INFO L85 PathProgramCache]: Analyzing trace with hash -18387259, now seen corresponding path program 1 times [2025-04-13 21:00:38,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:38,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925651209] [2025-04-13 21:00:38,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:38,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:38,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:00:38,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:38,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:38,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:38,422 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 21:00:38,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:38,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925651209] [2025-04-13 21:00:38,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925651209] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:38,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:38,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:00:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578572653] [2025-04-13 21:00:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:38,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:00:38,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:38,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:00:38,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:00:38,423 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:38,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 21:00:38,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:38,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:38,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:38,550 INFO L116 PetriNetUnfolderBase]: 85/165 cut-off events. [2025-04-13 21:00:38,550 INFO L117 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-04-13 21:00:38,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 165 events. 85/165 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 550 event pairs, 24 based on Foata normal form. 9/173 useless extension candidates. Maximal degree in co-relation 440. Up to 93 conditions per place. [2025-04-13 21:00:38,551 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 31 selfloop transitions, 4 changer transitions 7/42 dead transitions. [2025-04-13 21:00:38,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 241 flow [2025-04-13 21:00:38,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:00:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:00:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-04-13 21:00:38,552 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2025-04-13 21:00:38,552 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 86 flow. Second operand 5 states and 48 transitions. [2025-04-13 21:00:38,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 42 transitions, 241 flow [2025-04-13 21:00:38,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 42 transitions, 236 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:38,554 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 113 flow [2025-04-13 21:00:38,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2025-04-13 21:00:38,554 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2025-04-13 21:00:38,554 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 113 flow [2025-04-13 21:00:38,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 21:00:38,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:38,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:38,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:00:38,555 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:38,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:38,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1661275679, now seen corresponding path program 2 times [2025-04-13 21:00:38,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:38,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436663555] [2025-04-13 21:00:38,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:38,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:38,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:38,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:38,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:38,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:38,666 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 21:00:38,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:38,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436663555] [2025-04-13 21:00:38,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436663555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:38,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079951643] [2025-04-13 21:00:38,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:38,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:38,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:38,670 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 21:00:38,674 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 21:00:38,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:38,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:38,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:38,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:38,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:38,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:38,762 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 21:00:38,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:38,870 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 21:00:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079951643] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:38,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 21:00:38,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-13 21:00:38,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783023782] [2025-04-13 21:00:38,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:38,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:00:38,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:38,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:00:38,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:00:38,871 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:38,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 21:00:38,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:38,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:38,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:38,956 INFO L116 PetriNetUnfolderBase]: 87/164 cut-off events. [2025-04-13 21:00:38,956 INFO L117 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-04-13 21:00:38,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 164 events. 87/164 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 25 based on Foata normal form. 4/167 useless extension candidates. Maximal degree in co-relation 548. Up to 103 conditions per place. [2025-04-13 21:00:38,957 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 4 changer transitions 3/35 dead transitions. [2025-04-13 21:00:38,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 232 flow [2025-04-13 21:00:38,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:00:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:00:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-13 21:00:38,959 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2025-04-13 21:00:38,959 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 113 flow. Second operand 4 states and 40 transitions. [2025-04-13 21:00:38,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 232 flow [2025-04-13 21:00:38,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 219 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 21:00:38,961 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 132 flow [2025-04-13 21:00:38,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2025-04-13 21:00:38,961 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 13 predicate places. [2025-04-13 21:00:38,961 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 132 flow [2025-04-13 21:00:38,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 21:00:38,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:38,961 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:38,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 21:00:39,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:39,167 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:39,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash -768548956, now seen corresponding path program 2 times [2025-04-13 21:00:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:39,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136730876] [2025-04-13 21:00:39,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:39,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:39,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:39,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:39,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:39,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:39,229 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 21:00:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:39,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136730876] [2025-04-13 21:00:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136730876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:39,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:39,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:00:39,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348438950] [2025-04-13 21:00:39,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:39,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:00:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:39,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:00:39,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:00:39,230 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:39,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 21:00:39,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:39,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:39,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:39,306 INFO L116 PetriNetUnfolderBase]: 97/186 cut-off events. [2025-04-13 21:00:39,307 INFO L117 PetriNetUnfolderBase]: For 299/299 co-relation queries the response was YES. [2025-04-13 21:00:39,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 186 events. 97/186 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 587 event pairs, 35 based on Foata normal form. 4/189 useless extension candidates. Maximal degree in co-relation 631. Up to 126 conditions per place. [2025-04-13 21:00:39,308 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 32 selfloop transitions, 6 changer transitions 3/41 dead transitions. [2025-04-13 21:00:39,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 294 flow [2025-04-13 21:00:39,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:00:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:00:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-04-13 21:00:39,312 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 21:00:39,312 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 132 flow. Second operand 4 states and 38 transitions. [2025-04-13 21:00:39,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 294 flow [2025-04-13 21:00:39,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:39,314 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 169 flow [2025-04-13 21:00:39,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2025-04-13 21:00:39,314 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2025-04-13 21:00:39,314 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 169 flow [2025-04-13 21:00:39,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 21:00:39,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:39,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:39,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:00:39,315 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:39,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash -740753953, now seen corresponding path program 3 times [2025-04-13 21:00:39,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:39,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731125604] [2025-04-13 21:00:39,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:39,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:39,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:39,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:39,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:39,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:39,392 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 21:00:39,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:39,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731125604] [2025-04-13 21:00:39,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731125604] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:39,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182492540] [2025-04-13 21:00:39,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:39,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:39,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:39,395 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 21:00:39,396 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 21:00:39,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:39,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:39,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:39,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:39,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:39,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:39,470 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 21:00:39,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:39,526 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 21:00:39,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182492540] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:39,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:39,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-13 21:00:39,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039959889] [2025-04-13 21:00:39,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:39,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:00:39,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:39,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:00:39,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:00:39,527 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:39,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 169 flow. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 21:00:39,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:39,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:39,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:39,667 INFO L116 PetriNetUnfolderBase]: 125/235 cut-off events. [2025-04-13 21:00:39,667 INFO L117 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2025-04-13 21:00:39,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 235 events. 125/235 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 841 event pairs, 29 based on Foata normal form. 18/252 useless extension candidates. Maximal degree in co-relation 964. Up to 117 conditions per place. [2025-04-13 21:00:39,670 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 37 selfloop transitions, 12 changer transitions 9/58 dead transitions. [2025-04-13 21:00:39,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 485 flow [2025-04-13 21:00:39,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:00:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:00:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-13 21:00:39,671 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2025-04-13 21:00:39,671 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 169 flow. Second operand 6 states and 58 transitions. [2025-04-13 21:00:39,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 485 flow [2025-04-13 21:00:39,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 436 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:39,675 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 251 flow [2025-04-13 21:00:39,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-04-13 21:00:39,675 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2025-04-13 21:00:39,675 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 251 flow [2025-04-13 21:00:39,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 21:00:39,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:39,675 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:39,682 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 21:00:39,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:39,876 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:39,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:39,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1799302024, now seen corresponding path program 3 times [2025-04-13 21:00:39,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:39,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454353487] [2025-04-13 21:00:39,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:39,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:00:39,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:00:39,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:39,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:00:39,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:39,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454353487] [2025-04-13 21:00:39,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454353487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:39,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:39,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:00:39,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159652953] [2025-04-13 21:00:39,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:39,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:00:39,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:39,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:00:39,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:00:39,967 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:39,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 21:00:39,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:39,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:39,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:40,027 INFO L116 PetriNetUnfolderBase]: 113/200 cut-off events. [2025-04-13 21:00:40,027 INFO L117 PetriNetUnfolderBase]: For 617/617 co-relation queries the response was YES. [2025-04-13 21:00:40,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 200 events. 113/200 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 585 event pairs, 40 based on Foata normal form. 7/206 useless extension candidates. Maximal degree in co-relation 878. Up to 143 conditions per place. [2025-04-13 21:00:40,029 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 32 selfloop transitions, 13 changer transitions 1/46 dead transitions. [2025-04-13 21:00:40,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 438 flow [2025-04-13 21:00:40,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:00:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:00:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-04-13 21:00:40,030 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2025-04-13 21:00:40,030 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 251 flow. Second operand 4 states and 37 transitions. [2025-04-13 21:00:40,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 438 flow [2025-04-13 21:00:40,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 393 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-04-13 21:00:40,036 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 293 flow [2025-04-13 21:00:40,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2025-04-13 21:00:40,037 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2025-04-13 21:00:40,037 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 293 flow [2025-04-13 21:00:40,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 21:00:40,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:40,037 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:40,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:00:40,038 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:40,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash -740807503, now seen corresponding path program 1 times [2025-04-13 21:00:40,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:40,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048880869] [2025-04-13 21:00:40,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:40,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:40,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:00:40,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:00:40,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:40,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:40,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:40,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048880869] [2025-04-13 21:00:40,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048880869] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:40,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548989795] [2025-04-13 21:00:40,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:40,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:40,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:40,271 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 21:00:40,274 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 21:00:40,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:00:40,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:00:40,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:40,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:40,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 21:00:40,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:40,392 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:00:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:40,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:41,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 298 treesize of output 262 [2025-04-13 21:00:41,451 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:00:41,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 1833 treesize of output 1215 [2025-04-13 21:02:12,979 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:02:16,406 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:02:21,727 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:02:22,319 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:02:23,866 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:03:28,405 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:42,826 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:47,044 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:04:09,795 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:16,020 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:21,565 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:25,010 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:26,106 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:27,481 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:05:44,322 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:06:04,303 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:06:05,236 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:06:06,193 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:06:06,565 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 21:06:06,565 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 21:06:06,566 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 21:06:06,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 21:06:06,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:06,767 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$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.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) ... 69 more [2025-04-13 21:06:06,772 INFO L158 Benchmark]: Toolchain (without parser) took 330885.60ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 100.0MB in the beginning and 488.9MB in the end (delta: -388.9MB). Peak memory consumption was 732.9MB. Max. memory is 8.0GB. [2025-04-13 21:06:06,772 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:06:06,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.24ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 84.9MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 21:06:06,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.22ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:06:06,773 INFO L158 Benchmark]: Boogie Preprocessor took 58.05ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 80.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:06:06,773 INFO L158 Benchmark]: RCFGBuilder took 536.91ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 29.4MB in the end (delta: 51.3MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 21:06:06,773 INFO L158 Benchmark]: TraceAbstraction took 329960.60ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 28.3MB in the beginning and 488.9MB in the end (delta: -460.6MB). Peak memory consumption was 661.6MB. Max. memory is 8.0GB. [2025-04-13 21:06:06,774 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.23ms. Allocated memory is still 155.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.24ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 84.9MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.22ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.05ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 80.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 536.91ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 29.4MB in the end (delta: 51.3MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 329960.60ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 28.3MB in the beginning and 488.9MB in the end (delta: -460.6MB). Peak memory consumption was 661.6MB. 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...