/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:52:59,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:52:59,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:52:59,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:52:59,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:52:59,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:52:59,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:52:59,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:52:59,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:52:59,597 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:52:59,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:52:59,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:52:59,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:52:59,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:52:59,598 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:52:59,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:52:59,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:52:59,598 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:52:59,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:52:59,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:52:59,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:52:59,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:52:59,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:52:59,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:52:59,599 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:52:59,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:52:59,599 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:52:59,599 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:52:59,599 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:52:59,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:52:59,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:52:59,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:52:59,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:52:59,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:52:59,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:52:59,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:52:59,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:52:59,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:52:59,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:52:59,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:52:59,600 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:52:59,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:52:59,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:52:59,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:52:59,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:52:59,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:52:59,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:52:59,601 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:52:59,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:52:59,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:52:59,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:52:59,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:52:59,795 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:52:59,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2025-04-13 19:53:01,107 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbdc3bcfb/6a62b34513764245a948cd23f708c063/FLAGd291d67ce [2025-04-13 19:53:01,335 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:53:01,336 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2025-04-13 19:53:01,342 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbdc3bcfb/6a62b34513764245a948cd23f708c063/FLAGd291d67ce [2025-04-13 19:53:02,157 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbdc3bcfb/6a62b34513764245a948cd23f708c063 [2025-04-13 19:53:02,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:53:02,160 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:53:02,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:53:02,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:53:02,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:53:02,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b6f2f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02, skipping insertion in model container [2025-04-13 19:53:02,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:53:02,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c[2820,2833] [2025-04-13 19:53:02,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:53:02,376 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:53:02,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c[2820,2833] [2025-04-13 19:53:02,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:53:02,422 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:53:02,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02 WrapperNode [2025-04-13 19:53:02,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:53:02,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:53:02,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:53:02,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:53:02,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,459 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 256 [2025-04-13 19:53:02,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:53:02,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:53:02,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:53:02,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:53:02,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,484 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 19:53:02,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:53:02,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:53:02,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:53:02,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:53:02,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (1/1) ... [2025-04-13 19:53:02,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:53:02,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:02,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:53:02,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:53:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:53:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:53:02,554 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:53:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:53:02,554 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:53:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 19:53:02,554 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 19:53:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:53:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:53:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:53:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:53:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 19:53:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:53:02,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:53:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:53:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:53:02,556 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:53:02,638 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:53:02,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:53:02,986 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:53:02,987 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:53:02,987 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:53:03,313 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:53:03,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:53:03 BoogieIcfgContainer [2025-04-13 19:53:03,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:53:03,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:53:03,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:53:03,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:53:03,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:53:02" (1/3) ... [2025-04-13 19:53:03,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40630744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:53:03, skipping insertion in model container [2025-04-13 19:53:03,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:53:02" (2/3) ... [2025-04-13 19:53:03,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40630744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:53:03, skipping insertion in model container [2025-04-13 19:53:03,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:53:03" (3/3) ... [2025-04-13 19:53:03,321 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-04-13 19:53:03,332 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:53:03,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 25 locations, 27 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 19:53:03,333 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:53:03,384 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 19:53:03,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 19:53:03,440 INFO L116 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-04-13 19:53:03,442 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:53:03,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-13 19:53:03,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 19:53:03,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 70 flow [2025-04-13 19:53:03,454 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:53:03,463 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;@751935bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:53:03,463 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:53:03,474 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:53:03,474 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-13 19:53:03,475 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:53:03,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:03,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:53:03,477 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:53:03,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash -905359431, now seen corresponding path program 1 times [2025-04-13 19:53:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:03,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753869367] [2025-04-13 19:53:03,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:53:03,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:03,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:53:03,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:53:03,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:53:03,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:04,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:04,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753869367] [2025-04-13 19:53:04,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753869367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:53:04,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:53:04,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:53:04,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938217911] [2025-04-13 19:53:04,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:53:04,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:53:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:53:04,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:53:04,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:53:04,573 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:53:04,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 70 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:53:04,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:53:04,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:53:04,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:53:05,065 INFO L116 PetriNetUnfolderBase]: 354/545 cut-off events. [2025-04-13 19:53:05,066 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-13 19:53:05,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 545 events. 354/545 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1781 event pairs, 36 based on Foata normal form. 1/439 useless extension candidates. Maximal degree in co-relation 534. Up to 257 conditions per place. [2025-04-13 19:53:05,069 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 32 selfloop transitions, 8 changer transitions 39/79 dead transitions. [2025-04-13 19:53:05,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 373 flow [2025-04-13 19:53:05,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:53:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:53:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-04-13 19:53:05,080 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-04-13 19:53:05,081 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 70 flow. Second operand 10 states and 114 transitions. [2025-04-13 19:53:05,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 79 transitions, 373 flow [2025-04-13 19:53:05,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 79 transitions, 335 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 19:53:05,102 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2025-04-13 19:53:05,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2025-04-13 19:53:05,106 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2025-04-13 19:53:05,106 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2025-04-13 19:53:05,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:53:05,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:05,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:53:05,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:53:05,106 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:53:05,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash -34857977, now seen corresponding path program 1 times [2025-04-13 19:53:05,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:05,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138274590] [2025-04-13 19:53:05,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:53:05,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:05,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:53:05,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:53:05,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:53:05,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:05,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:05,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138274590] [2025-04-13 19:53:05,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138274590] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:05,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065716316] [2025-04-13 19:53:05,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:53:05,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:05,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:05,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:53:05,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:53:05,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:53:05,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:53:05,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:53:05,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:05,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 19:53:05,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:53:05,822 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:53:05,823 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 108 [2025-04-13 19:53:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:05,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:53:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:06,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065716316] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:06,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:53:06,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 16 [2025-04-13 19:53:06,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967391774] [2025-04-13 19:53:06,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:53:06,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:53:06,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:53:06,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:53:06,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-04-13 19:53:06,043 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:53:06,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 135 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:53:06,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:53:06,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:53:06,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:53:06,470 INFO L116 PetriNetUnfolderBase]: 743/1096 cut-off events. [2025-04-13 19:53:06,470 INFO L117 PetriNetUnfolderBase]: For 1090/1090 co-relation queries the response was YES. [2025-04-13 19:53:06,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3113 conditions, 1096 events. 743/1096 cut-off events. For 1090/1090 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3969 event pairs, 236 based on Foata normal form. 2/987 useless extension candidates. Maximal degree in co-relation 2514. Up to 300 conditions per place. [2025-04-13 19:53:06,476 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 66 selfloop transitions, 7 changer transitions 53/126 dead transitions. [2025-04-13 19:53:06,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 126 transitions, 742 flow [2025-04-13 19:53:06,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:53:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:53:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2025-04-13 19:53:06,481 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-13 19:53:06,481 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 9 states and 140 transitions. [2025-04-13 19:53:06,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 126 transitions, 742 flow [2025-04-13 19:53:06,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 126 transitions, 695 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-04-13 19:53:06,487 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 167 flow [2025-04-13 19:53:06,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=167, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-04-13 19:53:06,488 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2025-04-13 19:53:06,488 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 167 flow [2025-04-13 19:53:06,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:53:06,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:53:06,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:53:06,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:53:06,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:06,689 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:53:06,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:53:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1584518219, now seen corresponding path program 1 times [2025-04-13 19:53:06,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:53:06,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537371549] [2025-04-13 19:53:06,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:53:06,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:53:06,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:53:06,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:53:06,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:53:06,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:53:07,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537371549] [2025-04-13 19:53:07,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537371549] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:07,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054312142] [2025-04-13 19:53:07,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:53:07,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:53:07,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:53:07,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:53:07,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 19:53:07,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:53:07,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:53:07,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:53:07,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:53:07,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 19:53:07,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:53:08,666 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:53:08,667 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 262 treesize of output 583 [2025-04-13 19:53:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:48,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:53:50,280 INFO L325 Elim1Store]: treesize reduction 8, result has 89.5 percent of original size [2025-04-13 19:53:50,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 90 [2025-04-13 19:53:50,535 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 19:53:50,546 INFO L325 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-04-13 19:53:50,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 19 [2025-04-13 19:53:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:53:50,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054312142] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:53:50,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:53:50,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8, 10] total 27 [2025-04-13 19:53:50,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20163522] [2025-04-13 19:53:50,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:53:50,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 19:53:50,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:53:50,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 19:53:50,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2025-04-13 19:53:50,692 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:53:50,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 167 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:53:50,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:53:50,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:53:50,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:53:56,369 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 19:54:04,539 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 19:55:13,556 INFO L116 PetriNetUnfolderBase]: 1393/1996 cut-off events. [2025-04-13 19:55:13,556 INFO L117 PetriNetUnfolderBase]: For 1507/1507 co-relation queries the response was YES. [2025-04-13 19:55:13,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5931 conditions, 1996 events. 1393/1996 cut-off events. For 1507/1507 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7982 event pairs, 122 based on Foata normal form. 2/1805 useless extension candidates. Maximal degree in co-relation 5891. Up to 656 conditions per place. [2025-04-13 19:55:13,566 INFO L140 encePairwiseOnDemand]: 15/30 looper letters, 171 selfloop transitions, 51 changer transitions 2/224 dead transitions. [2025-04-13 19:55:13,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 224 transitions, 1301 flow [2025-04-13 19:55:13,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 19:55:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-13 19:55:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 286 transitions. [2025-04-13 19:55:13,569 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4144927536231884 [2025-04-13 19:55:13,569 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 167 flow. Second operand 23 states and 286 transitions. [2025-04-13 19:55:13,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 224 transitions, 1301 flow [2025-04-13 19:55:13,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 224 transitions, 1262 flow, removed 17 selfloop flow, removed 5 redundant places. [2025-04-13 19:55:13,575 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 602 flow [2025-04-13 19:55:13,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=602, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2025-04-13 19:55:13,576 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2025-04-13 19:55:13,576 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 602 flow [2025-04-13 19:55:13,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:13,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:13,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:55:13,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 19:55:13,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-13 19:55:13,777 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:55:13,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:13,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1236072213, now seen corresponding path program 2 times [2025-04-13 19:55:13,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:13,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355848881] [2025-04-13 19:55:13,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:55:13,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:13,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 19:55:13,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 21 statements. [2025-04-13 19:55:13,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:55:13,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:14,262 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 19:55:14,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:14,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355848881] [2025-04-13 19:55:14,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355848881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:55:14,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:55:14,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:55:14,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363714489] [2025-04-13 19:55:14,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:55:14,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:55:14,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:14,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:55:14,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:55:14,264 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:55:14,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 602 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:14,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:14,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:55:14,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:14,783 INFO L116 PetriNetUnfolderBase]: 1167/1770 cut-off events. [2025-04-13 19:55:14,783 INFO L117 PetriNetUnfolderBase]: For 16283/16283 co-relation queries the response was YES. [2025-04-13 19:55:14,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9683 conditions, 1770 events. 1167/1770 cut-off events. For 16283/16283 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7531 event pairs, 119 based on Foata normal form. 166/1931 useless extension candidates. Maximal degree in co-relation 7782. Up to 587 conditions per place. [2025-04-13 19:55:14,793 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 85 selfloop transitions, 18 changer transitions 16/119 dead transitions. [2025-04-13 19:55:14,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 119 transitions, 1095 flow [2025-04-13 19:55:14,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:55:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:55:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2025-04-13 19:55:14,794 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-04-13 19:55:14,794 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 602 flow. Second operand 10 states and 120 transitions. [2025-04-13 19:55:14,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 119 transitions, 1095 flow [2025-04-13 19:55:14,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 119 transitions, 1019 flow, removed 33 selfloop flow, removed 6 redundant places. [2025-04-13 19:55:14,813 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 492 flow [2025-04-13 19:55:14,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=492, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2025-04-13 19:55:14,814 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2025-04-13 19:55:14,814 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 492 flow [2025-04-13 19:55:14,814 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:14,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:14,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:55:14,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:55:14,815 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:55:14,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:14,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1027437717, now seen corresponding path program 1 times [2025-04-13 19:55:14,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:14,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357957461] [2025-04-13 19:55:14,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:55:14,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:14,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:55:14,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:55:14,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:55:14,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:14,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:14,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357957461] [2025-04-13 19:55:14,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357957461] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:55:14,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454115799] [2025-04-13 19:55:14,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:55:14,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:14,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:55:14,972 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:55:14,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 19:55:15,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:55:15,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:55:15,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:55:15,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:15,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 19:55:15,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:55:15,164 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:55:15,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 108 [2025-04-13 19:55:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:15,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:55:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:15,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454115799] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:55:15,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:55:15,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 14 [2025-04-13 19:55:15,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193017882] [2025-04-13 19:55:15,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:55:15,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:55:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:15,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:55:15,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:55:15,298 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:55:15,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 492 flow. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:15,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:15,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:55:15,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:15,613 INFO L116 PetriNetUnfolderBase]: 981/1459 cut-off events. [2025-04-13 19:55:15,613 INFO L117 PetriNetUnfolderBase]: For 13377/13377 co-relation queries the response was YES. [2025-04-13 19:55:15,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8000 conditions, 1459 events. 981/1459 cut-off events. For 13377/13377 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5559 event pairs, 493 based on Foata normal form. 1/1455 useless extension candidates. Maximal degree in co-relation 7245. Up to 1162 conditions per place. [2025-04-13 19:55:15,621 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 55 selfloop transitions, 5 changer transitions 39/99 dead transitions. [2025-04-13 19:55:15,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 99 transitions, 968 flow [2025-04-13 19:55:15,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:55:15,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:55:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2025-04-13 19:55:15,622 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2025-04-13 19:55:15,622 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 492 flow. Second operand 6 states and 83 transitions. [2025-04-13 19:55:15,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 99 transitions, 968 flow [2025-04-13 19:55:15,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 99 transitions, 898 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-04-13 19:55:15,634 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 441 flow [2025-04-13 19:55:15,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=441, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2025-04-13 19:55:15,634 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2025-04-13 19:55:15,634 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 441 flow [2025-04-13 19:55:15,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:15,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:15,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:55:15,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 19:55:15,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:15,839 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:55:15,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash -846574499, now seen corresponding path program 3 times [2025-04-13 19:55:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:15,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050639205] [2025-04-13 19:55:15,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:55:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:15,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 19:55:15,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 21 statements. [2025-04-13 19:55:15,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:55:15,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:16,402 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 19:55:16,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:16,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050639205] [2025-04-13 19:55:16,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050639205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:55:16,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:55:16,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:55:16,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986713927] [2025-04-13 19:55:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:55:16,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:55:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:16,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:55:16,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:55:16,403 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:55:16,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 441 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:16,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:16,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:55:16,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:16,826 INFO L116 PetriNetUnfolderBase]: 580/924 cut-off events. [2025-04-13 19:55:16,826 INFO L117 PetriNetUnfolderBase]: For 7035/7035 co-relation queries the response was YES. [2025-04-13 19:55:16,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4593 conditions, 924 events. 580/924 cut-off events. For 7035/7035 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3676 event pairs, 73 based on Foata normal form. 86/1007 useless extension candidates. Maximal degree in co-relation 4559. Up to 331 conditions per place. [2025-04-13 19:55:16,830 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 35 selfloop transitions, 6 changer transitions 44/85 dead transitions. [2025-04-13 19:55:16,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 726 flow [2025-04-13 19:55:16,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:55:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:55:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2025-04-13 19:55:16,832 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37407407407407406 [2025-04-13 19:55:16,832 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 441 flow. Second operand 9 states and 101 transitions. [2025-04-13 19:55:16,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 726 flow [2025-04-13 19:55:16,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 85 transitions, 679 flow, removed 15 selfloop flow, removed 9 redundant places. [2025-04-13 19:55:16,838 INFO L231 Difference]: Finished difference. Result has 73 places, 34 transitions, 222 flow [2025-04-13 19:55:16,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=73, PETRI_TRANSITIONS=34} [2025-04-13 19:55:16,840 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2025-04-13 19:55:16,840 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 34 transitions, 222 flow [2025-04-13 19:55:16,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:16,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:16,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:55:16,840 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:55:16,841 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:55:16,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1400773741, now seen corresponding path program 1 times [2025-04-13 19:55:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:16,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207077286] [2025-04-13 19:55:16,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:55:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:16,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:55:16,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:55:16,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:55:16,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:55:17,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:17,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207077286] [2025-04-13 19:55:17,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207077286] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:55:17,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026053540] [2025-04-13 19:55:17,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:55:17,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:17,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:55:17,210 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:55:17,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 19:55:17,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:55:17,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:55:17,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:55:17,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:17,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 19:55:17,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:55:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:55:17,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:55:18,124 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:55:18,124 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 324 treesize of output 394 [2025-04-13 19:55:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:55:18,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026053540] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:55:18,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:55:18,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 10] total 25 [2025-04-13 19:55:18,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017286699] [2025-04-13 19:55:18,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:55:18,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 19:55:18,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:18,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 19:55:18,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2025-04-13 19:55:18,953 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:55:18,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 34 transitions, 222 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:18,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:18,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:55:18,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:19,605 INFO L116 PetriNetUnfolderBase]: 611/913 cut-off events. [2025-04-13 19:55:19,605 INFO L117 PetriNetUnfolderBase]: For 5757/5757 co-relation queries the response was YES. [2025-04-13 19:55:19,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4293 conditions, 913 events. 611/913 cut-off events. For 5757/5757 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3230 event pairs, 50 based on Foata normal form. 63/973 useless extension candidates. Maximal degree in co-relation 4250. Up to 330 conditions per place. [2025-04-13 19:55:19,610 INFO L140 encePairwiseOnDemand]: 17/30 looper letters, 82 selfloop transitions, 19 changer transitions 2/103 dead transitions. [2025-04-13 19:55:19,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 103 transitions, 842 flow [2025-04-13 19:55:19,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:55:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 19:55:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2025-04-13 19:55:19,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2025-04-13 19:55:19,611 INFO L175 Difference]: Start difference. First operand has 73 places, 34 transitions, 222 flow. Second operand 13 states and 135 transitions. [2025-04-13 19:55:19,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 103 transitions, 842 flow [2025-04-13 19:55:19,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 103 transitions, 751 flow, removed 27 selfloop flow, removed 12 redundant places. [2025-04-13 19:55:19,616 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 307 flow [2025-04-13 19:55:19,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=307, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2025-04-13 19:55:19,616 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2025-04-13 19:55:19,616 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 307 flow [2025-04-13 19:55:19,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:19,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:19,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:55:19,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 19:55:19,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:19,817 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:55:19,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:19,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1344764819, now seen corresponding path program 2 times [2025-04-13 19:55:19,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:19,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535067973] [2025-04-13 19:55:19,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:55:19,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:19,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:55:19,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 19:55:19,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:55:19,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:55:20,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:20,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535067973] [2025-04-13 19:55:20,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535067973] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:55:20,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:55:20,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 19:55:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901733542] [2025-04-13 19:55:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:55:20,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 19:55:20,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:20,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 19:55:20,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-13 19:55:20,308 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:55:20,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 307 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:20,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:20,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:55:20,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:20,944 INFO L116 PetriNetUnfolderBase]: 720/1098 cut-off events. [2025-04-13 19:55:20,945 INFO L117 PetriNetUnfolderBase]: For 6304/6304 co-relation queries the response was YES. [2025-04-13 19:55:20,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5134 conditions, 1098 events. 720/1098 cut-off events. For 6304/6304 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4363 event pairs, 86 based on Foata normal form. 38/1134 useless extension candidates. Maximal degree in co-relation 5094. Up to 370 conditions per place. [2025-04-13 19:55:20,950 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 68 selfloop transitions, 13 changer transitions 41/122 dead transitions. [2025-04-13 19:55:20,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 122 transitions, 1009 flow [2025-04-13 19:55:20,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 19:55:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 19:55:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2025-04-13 19:55:20,951 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3595238095238095 [2025-04-13 19:55:20,951 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 307 flow. Second operand 14 states and 151 transitions. [2025-04-13 19:55:20,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 122 transitions, 1009 flow [2025-04-13 19:55:20,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 122 transitions, 969 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-04-13 19:55:20,958 INFO L231 Difference]: Finished difference. Result has 76 places, 45 transitions, 349 flow [2025-04-13 19:55:20,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=349, PETRI_PLACES=76, PETRI_TRANSITIONS=45} [2025-04-13 19:55:20,958 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2025-04-13 19:55:20,958 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 45 transitions, 349 flow [2025-04-13 19:55:20,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:20,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:20,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:55:20,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:55:20,959 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:55:20,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash 625852859, now seen corresponding path program 3 times [2025-04-13 19:55:20,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:20,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922073946] [2025-04-13 19:55:20,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:55:20,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:20,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:55:20,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 19:55:20,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:55:20,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:55:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:21,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922073946] [2025-04-13 19:55:21,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922073946] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:55:21,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:55:21,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 19:55:21,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614883727] [2025-04-13 19:55:21,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:55:21,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 19:55:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:21,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 19:55:21,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 19:55:21,461 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:55:21,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 45 transitions, 349 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:21,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:21,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:55:21,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:22,031 INFO L116 PetriNetUnfolderBase]: 494/789 cut-off events. [2025-04-13 19:55:22,031 INFO L117 PetriNetUnfolderBase]: For 6981/6981 co-relation queries the response was YES. [2025-04-13 19:55:22,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3977 conditions, 789 events. 494/789 cut-off events. For 6981/6981 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3034 event pairs, 103 based on Foata normal form. 63/851 useless extension candidates. Maximal degree in co-relation 3931. Up to 370 conditions per place. [2025-04-13 19:55:22,039 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 56 selfloop transitions, 10 changer transitions 28/94 dead transitions. [2025-04-13 19:55:22,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 94 transitions, 784 flow [2025-04-13 19:55:22,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:55:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:55:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2025-04-13 19:55:22,040 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35 [2025-04-13 19:55:22,040 INFO L175 Difference]: Start difference. First operand has 76 places, 45 transitions, 349 flow. Second operand 12 states and 126 transitions. [2025-04-13 19:55:22,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 94 transitions, 784 flow [2025-04-13 19:55:22,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 741 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-04-13 19:55:22,046 INFO L231 Difference]: Finished difference. Result has 78 places, 41 transitions, 306 flow [2025-04-13 19:55:22,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=306, PETRI_PLACES=78, PETRI_TRANSITIONS=41} [2025-04-13 19:55:22,047 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2025-04-13 19:55:22,047 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 41 transitions, 306 flow [2025-04-13 19:55:22,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:22,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:22,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:55:22,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:55:22,047 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:55:22,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:22,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1345299385, now seen corresponding path program 4 times [2025-04-13 19:55:22,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:22,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437470320] [2025-04-13 19:55:22,048 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:55:22,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:22,058 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:55:22,066 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:55:22,066 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:55:22,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:22,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:55:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:22,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437470320] [2025-04-13 19:55:22,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437470320] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:55:22,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371671650] [2025-04-13 19:55:22,450 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:55:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:22,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:55:22,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:55:22,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 19:55:22,503 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:55:22,521 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:55:22,522 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:55:22,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:22,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 19:55:22,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:55:22,724 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:55:22,724 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 126 [2025-04-13 19:55:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 19:55:22,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:55:23,331 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:55:23,331 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 221 treesize of output 228 [2025-04-13 19:55:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 19:55:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371671650] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:55:25,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:55:25,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-04-13 19:55:25,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914185372] [2025-04-13 19:55:25,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:55:25,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 19:55:25,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:25,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 19:55:25,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2025-04-13 19:55:25,234 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:55:25,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 41 transitions, 306 flow. Second operand has 29 states, 29 states have (on average 5.0344827586206895) internal successors, (146), 29 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:25,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:25,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:55:25,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:26,357 INFO L116 PetriNetUnfolderBase]: 723/1148 cut-off events. [2025-04-13 19:55:26,358 INFO L117 PetriNetUnfolderBase]: For 8062/8062 co-relation queries the response was YES. [2025-04-13 19:55:26,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5717 conditions, 1148 events. 723/1148 cut-off events. For 8062/8062 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4693 event pairs, 78 based on Foata normal form. 22/1168 useless extension candidates. Maximal degree in co-relation 5060. Up to 333 conditions per place. [2025-04-13 19:55:26,364 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 106 selfloop transitions, 25 changer transitions 21/152 dead transitions. [2025-04-13 19:55:26,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 152 transitions, 1281 flow [2025-04-13 19:55:26,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 19:55:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 19:55:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 206 transitions. [2025-04-13 19:55:26,365 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3433333333333333 [2025-04-13 19:55:26,366 INFO L175 Difference]: Start difference. First operand has 78 places, 41 transitions, 306 flow. Second operand 20 states and 206 transitions. [2025-04-13 19:55:26,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 152 transitions, 1281 flow [2025-04-13 19:55:26,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 152 transitions, 1223 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-04-13 19:55:26,372 INFO L231 Difference]: Finished difference. Result has 93 places, 55 transitions, 461 flow [2025-04-13 19:55:26,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=461, PETRI_PLACES=93, PETRI_TRANSITIONS=55} [2025-04-13 19:55:26,373 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2025-04-13 19:55:26,373 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 55 transitions, 461 flow [2025-04-13 19:55:26,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.0344827586206895) internal successors, (146), 29 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:26,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:26,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:55:26,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 19:55:26,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 19:55:26,574 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:55:26,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 109057083, now seen corresponding path program 5 times [2025-04-13 19:55:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:26,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897298007] [2025-04-13 19:55:26,574 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:55:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:26,581 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:55:26,603 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:55:26,603 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:55:26,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:55:26,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:26,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897298007] [2025-04-13 19:55:26,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897298007] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:55:26,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827093276] [2025-04-13 19:55:26,895 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:55:26,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:26,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:55:26,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:55:26,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 19:55:26,956 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 19:55:26,977 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:55:26,977 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:55:26,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:26,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 19:55:26,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:55:27,426 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:55:27,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 108 [2025-04-13 19:55:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:27,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:55:28,306 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:55:28,306 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 290 treesize of output 376 [2025-04-13 19:55:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:29,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827093276] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:55:29,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:55:29,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 33 [2025-04-13 19:55:29,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707676475] [2025-04-13 19:55:29,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:55:29,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 19:55:29,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:55:29,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 19:55:29,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 19:55:29,265 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:55:29,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 55 transitions, 461 flow. Second operand has 35 states, 35 states have (on average 4.9714285714285715) internal successors, (174), 35 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:29,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:55:29,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:55:29,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:55:30,773 INFO L116 PetriNetUnfolderBase]: 877/1428 cut-off events. [2025-04-13 19:55:30,773 INFO L117 PetriNetUnfolderBase]: For 10185/10185 co-relation queries the response was YES. [2025-04-13 19:55:30,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7220 conditions, 1428 events. 877/1428 cut-off events. For 10185/10185 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6439 event pairs, 112 based on Foata normal form. 12/1436 useless extension candidates. Maximal degree in co-relation 7185. Up to 762 conditions per place. [2025-04-13 19:55:30,780 INFO L140 encePairwiseOnDemand]: 15/30 looper letters, 40 selfloop transitions, 31 changer transitions 79/150 dead transitions. [2025-04-13 19:55:30,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 150 transitions, 1343 flow [2025-04-13 19:55:30,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 19:55:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 19:55:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 198 transitions. [2025-04-13 19:55:30,781 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.275 [2025-04-13 19:55:30,781 INFO L175 Difference]: Start difference. First operand has 93 places, 55 transitions, 461 flow. Second operand 24 states and 198 transitions. [2025-04-13 19:55:30,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 150 transitions, 1343 flow [2025-04-13 19:55:30,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 150 transitions, 1280 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-04-13 19:55:30,793 INFO L231 Difference]: Finished difference. Result has 108 places, 59 transitions, 533 flow [2025-04-13 19:55:30,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=533, PETRI_PLACES=108, PETRI_TRANSITIONS=59} [2025-04-13 19:55:30,794 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2025-04-13 19:55:30,794 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 59 transitions, 533 flow [2025-04-13 19:55:30,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.9714285714285715) internal successors, (174), 35 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:55:30,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:55:30,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:55:30,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 19:55:30,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:30,995 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:55:30,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:55:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash 146276913, now seen corresponding path program 1 times [2025-04-13 19:55:30,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:55:30,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131694242] [2025-04-13 19:55:30,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:55:30,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:55:31,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:55:31,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:55:31,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:55:31,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:31,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:31,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:55:31,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131694242] [2025-04-13 19:55:31,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131694242] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:55:31,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106898748] [2025-04-13 19:55:31,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:55:31,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:55:31,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:55:31,781 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:55:31,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 19:55:31,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:55:31,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:55:31,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:55:31,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:55:31,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 19:55:31,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:55:32,603 INFO L325 Elim1Store]: treesize reduction 3, result has 98.3 percent of original size [2025-04-13 19:55:32,603 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 214 treesize of output 259 [2025-04-13 19:55:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:55:32,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:55:34,016 INFO L325 Elim1Store]: treesize reduction 11, result has 96.8 percent of original size [2025-04-13 19:55:34,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 254 treesize of output 425 [2025-04-13 19:58:44,733 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 19:58:44,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 19:58:44,734 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 19:58:44,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 19:58:44,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:44,935 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:142) 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.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 85 more [2025-04-13 19:58:44,940 INFO L158 Benchmark]: Toolchain (without parser) took 342780.40ms. Allocated memory was 155.2MB in the beginning and 817.9MB in the end (delta: 662.7MB). Free memory was 108.4MB in the beginning and 715.9MB in the end (delta: -607.5MB). Peak memory consumption was 492.6MB. Max. memory is 8.0GB. [2025-04-13 19:58:44,941 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:58:44,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.46ms. Allocated memory is still 155.2MB. Free memory was 108.4MB in the beginning and 93.2MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 19:58:44,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.11ms. Allocated memory is still 155.2MB. Free memory was 93.2MB in the beginning and 90.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:58:44,941 INFO L158 Benchmark]: Boogie Preprocessor took 40.70ms. Allocated memory is still 155.2MB. Free memory was 90.4MB in the beginning and 87.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:58:44,941 INFO L158 Benchmark]: RCFGBuilder took 809.02ms. Allocated memory is still 155.2MB. Free memory was 87.5MB in the beginning and 63.9MB in the end (delta: 23.6MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2025-04-13 19:58:44,941 INFO L158 Benchmark]: TraceAbstraction took 341623.77ms. Allocated memory was 155.2MB in the beginning and 817.9MB in the end (delta: 662.7MB). Free memory was 63.9MB in the beginning and 715.9MB in the end (delta: -652.1MB). Peak memory consumption was 447.5MB. Max. memory is 8.0GB. [2025-04-13 19:58:44,946 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.18ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.46ms. Allocated memory is still 155.2MB. Free memory was 108.4MB in the beginning and 93.2MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.11ms. Allocated memory is still 155.2MB. Free memory was 93.2MB in the beginning and 90.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.70ms. Allocated memory is still 155.2MB. Free memory was 90.4MB in the beginning and 87.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 809.02ms. Allocated memory is still 155.2MB. Free memory was 87.5MB in the beginning and 63.9MB in the end (delta: 23.6MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. * TraceAbstraction took 341623.77ms. Allocated memory was 155.2MB in the beginning and 817.9MB in the end (delta: 662.7MB). Free memory was 63.9MB in the beginning and 715.9MB in the end (delta: -652.1MB). Peak memory consumption was 447.5MB. 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...