/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:15:56,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:15:56,267 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-14 01:15:56,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:15:56,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:15:56,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:15:56,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:15:56,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:15:56,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:15:56,290 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:15:56,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:15:56,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:15:56,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:15:56,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:15:56,291 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:15:56,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:15:56,292 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:15:56,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:15:56,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:15:56,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:15:56,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:15:56,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:15:56,293 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:15:56,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:15:56,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:15:56,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:15:56,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:15:56,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:15:56,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:15:56,293 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:15:56,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:15:56,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:15:56,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:15:56,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:15:56,514 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:15:56,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2025-04-14 01:15:57,764 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9327e5c43/62f3fdbdcfd947efbda9fe1086cec8c3/FLAG85ff803cd [2025-04-14 01:15:57,935 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:15:57,935 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2025-04-14 01:15:57,943 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9327e5c43/62f3fdbdcfd947efbda9fe1086cec8c3/FLAG85ff803cd [2025-04-14 01:15:58,765 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9327e5c43/62f3fdbdcfd947efbda9fe1086cec8c3 [2025-04-14 01:15:58,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:15:58,769 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:15:58,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:15:58,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:15:58,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:15:58,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:15:58" (1/1) ... [2025-04-14 01:15:58,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf4bb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:58, skipping insertion in model container [2025-04-14 01:15:58,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:15:58" (1/1) ... [2025-04-14 01:15:58,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:15:58,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2025-04-14 01:15:58,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:15:58,978 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:15:59,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2025-04-14 01:15:59,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:15:59,036 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:15:59,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59 WrapperNode [2025-04-14 01:15:59,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:15:59,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:15:59,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:15:59,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:15:59,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (1/1) ... [2025-04-14 01:15:59,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (1/1) ... [2025-04-14 01:15:59,077 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 175 [2025-04-14 01:15:59,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:15:59,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:15:59,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:15:59,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:15:59,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (1/1) ... [2025-04-14 01:15:59,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (1/1) ... [2025-04-14 01:15:59,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (1/1) ... [2025-04-14 01:15:59,104 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-14 01:15:59,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (1/1) ... [2025-04-14 01:15:59,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (1/1) ... [2025-04-14 01:15:59,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (1/1) ... [2025-04-14 01:15:59,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (1/1) ... [2025-04-14 01:15:59,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (1/1) ... [2025-04-14 01:15:59,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (1/1) ... [2025-04-14 01:15:59,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:15:59,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:15:59,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:15:59,124 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:15:59,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (1/1) ... [2025-04-14 01:15:59,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:15:59,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:15:59,152 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-14 01:15:59,157 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-14 01:15:59,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:15:59,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:15:59,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:15:59,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:15:59,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:15:59,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:15:59,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:15:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:15:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:15:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:15:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:15:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:15:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:15:59,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:15:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:15:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:15:59,173 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:15:59,254 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:15:59,255 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:15:59,468 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:15:59,468 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:15:59,468 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:15:59,704 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:15:59,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:15:59 BoogieIcfgContainer [2025-04-14 01:15:59,705 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:15:59,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:15:59,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:15:59,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:15:59,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:15:58" (1/3) ... [2025-04-14 01:15:59,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a210baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:15:59, skipping insertion in model container [2025-04-14 01:15:59,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:15:59" (2/3) ... [2025-04-14 01:15:59,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a210baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:15:59, skipping insertion in model container [2025-04-14 01:15:59,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:15:59" (3/3) ... [2025-04-14 01:15:59,713 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2025-04-14 01:15:59,722 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:15:59,724 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-dec-subseq.wvr.c that has 3 procedures, 25 locations, 27 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 01:15:59,724 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:15:59,772 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:15:59,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 29 transitions, 72 flow [2025-04-14 01:15:59,816 INFO L116 PetriNetUnfolderBase]: 5/27 cut-off events. [2025-04-14 01:15:59,818 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:15:59,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 5/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-14 01:15:59,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 29 transitions, 72 flow [2025-04-14 01:15:59,826 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 26 transitions, 64 flow [2025-04-14 01:15:59,833 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:15:59,841 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;@79925548, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:15:59,841 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:15:59,851 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:15:59,852 INFO L116 PetriNetUnfolderBase]: 5/25 cut-off events. [2025-04-14 01:15:59,852 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:15:59,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:59,852 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:59,853 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:15:59,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1671665147, now seen corresponding path program 1 times [2025-04-14 01:15:59,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:59,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407554017] [2025-04-14 01:15:59,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:15:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:59,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:15:59,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:15:59,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:59,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:00,146 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-14 01:16:00,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:00,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407554017] [2025-04-14 01:16:00,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407554017] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:16:00,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:16:00,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:16:00,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408533495] [2025-04-14 01:16:00,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:16:00,157 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:16:00,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:00,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:16:00,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:16:00,176 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-04-14 01:16:00,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-14 01:16:00,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:00,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-04-14 01:16:00,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:00,321 INFO L116 PetriNetUnfolderBase]: 185/310 cut-off events. [2025-04-14 01:16:00,321 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-14 01:16:00,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 310 events. 185/310 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1190 event pairs, 49 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 595. Up to 182 conditions per place. [2025-04-14 01:16:00,330 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 33 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-04-14 01:16:00,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 39 transitions, 165 flow [2025-04-14 01:16:00,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:16:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:16:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-14 01:16:00,340 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49137931034482757 [2025-04-14 01:16:00,341 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 64 flow. Second operand 4 states and 57 transitions. [2025-04-14 01:16:00,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 39 transitions, 165 flow [2025-04-14 01:16:00,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 39 transitions, 155 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 01:16:00,347 INFO L231 Difference]: Finished difference. Result has 28 places, 27 transitions, 70 flow [2025-04-14 01:16:00,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=28, PETRI_TRANSITIONS=27} [2025-04-14 01:16:00,353 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2025-04-14 01:16:00,353 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 70 flow [2025-04-14 01:16:00,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-14 01:16:00,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:00,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:16:00,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:16:00,354 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:16:00,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:00,354 INFO L85 PathProgramCache]: Analyzing trace with hash 85390711, now seen corresponding path program 1 times [2025-04-14 01:16:00,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:00,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329350952] [2025-04-14 01:16:00,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:16:00,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:00,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:16:00,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:16:00,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:16:00,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:00,469 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-14 01:16:00,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:00,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329350952] [2025-04-14 01:16:00,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329350952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:16:00,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:16:00,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:16:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422360540] [2025-04-14 01:16:00,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:16:00,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:16:00,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:00,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:16:00,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:16:00,471 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-04-14 01:16:00,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-14 01:16:00,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:00,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-04-14 01:16:00,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:00,532 INFO L116 PetriNetUnfolderBase]: 185/311 cut-off events. [2025-04-14 01:16:00,532 INFO L117 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-04-14 01:16:00,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 311 events. 185/311 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1137 event pairs, 128 based on Foata normal form. 1/277 useless extension candidates. Maximal degree in co-relation 246. Up to 304 conditions per place. [2025-04-14 01:16:00,534 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 23 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-04-14 01:16:00,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 122 flow [2025-04-14 01:16:00,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:16:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:16:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-04-14 01:16:00,535 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45977011494252873 [2025-04-14 01:16:00,535 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 70 flow. Second operand 3 states and 40 transitions. [2025-04-14 01:16:00,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 122 flow [2025-04-14 01:16:00,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:16:00,536 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 78 flow [2025-04-14 01:16:00,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2025-04-14 01:16:00,536 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2025-04-14 01:16:00,536 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 78 flow [2025-04-14 01:16:00,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-14 01:16:00,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:00,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:16:00,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:16:00,537 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:16:00,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash -453474063, now seen corresponding path program 1 times [2025-04-14 01:16:00,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:00,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898769969] [2025-04-14 01:16:00,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:16:00,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:00,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:16:00,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:16:00,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:16:00,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:00,666 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-14 01:16:00,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:00,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898769969] [2025-04-14 01:16:00,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898769969] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:16:00,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:16:00,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:16:00,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753044124] [2025-04-14 01:16:00,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:16:00,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:16:00,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:00,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:16:00,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:16:00,667 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-04-14 01:16:00,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-14 01:16:00,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:00,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-04-14 01:16:00,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:00,748 INFO L116 PetriNetUnfolderBase]: 281/484 cut-off events. [2025-04-14 01:16:00,749 INFO L117 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-04-14 01:16:00,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 484 events. 281/484 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1900 event pairs, 102 based on Foata normal form. 1/439 useless extension candidates. Maximal degree in co-relation 1001. Up to 233 conditions per place. [2025-04-14 01:16:00,752 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 34 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2025-04-14 01:16:00,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 188 flow [2025-04-14 01:16:00,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:16:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:16:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-04-14 01:16:00,755 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-04-14 01:16:00,755 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 78 flow. Second operand 3 states and 51 transitions. [2025-04-14 01:16:00,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 41 transitions, 188 flow [2025-04-14 01:16:00,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 184 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:16:00,756 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 86 flow [2025-04-14 01:16:00,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-04-14 01:16:00,756 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2025-04-14 01:16:00,756 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 86 flow [2025-04-14 01:16:00,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-14 01:16:00,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:00,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:16:00,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:16:00,757 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:16:00,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash 959280380, now seen corresponding path program 1 times [2025-04-14 01:16:00,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:00,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325270247] [2025-04-14 01:16:00,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:16:00,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:00,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:16:00,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:16:00,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:16:00,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:00,846 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-14 01:16:00,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:00,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325270247] [2025-04-14 01:16:00,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325270247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:16:00,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:16:00,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:16:00,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595751106] [2025-04-14 01:16:00,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:16:00,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:16:00,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:00,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:16:00,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:16:00,847 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-04-14 01:16:00,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-14 01:16:00,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:00,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-04-14 01:16:00,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:00,918 INFO L116 PetriNetUnfolderBase]: 292/515 cut-off events. [2025-04-14 01:16:00,918 INFO L117 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-04-14 01:16:00,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 515 events. 292/515 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2024 event pairs, 113 based on Foata normal form. 11/488 useless extension candidates. Maximal degree in co-relation 1135. Up to 362 conditions per place. [2025-04-14 01:16:00,923 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 33 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2025-04-14 01:16:00,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 199 flow [2025-04-14 01:16:00,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:16:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:16:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-04-14 01:16:00,925 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-04-14 01:16:00,926 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 86 flow. Second operand 3 states and 51 transitions. [2025-04-14 01:16:00,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 199 flow [2025-04-14 01:16:00,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:16:00,928 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 96 flow [2025-04-14 01:16:00,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2025-04-14 01:16:00,929 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2025-04-14 01:16:00,929 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 96 flow [2025-04-14 01:16:00,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-14 01:16:00,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:00,929 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-14 01:16:00,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:16:00,929 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:16:00,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:00,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2028494547, now seen corresponding path program 1 times [2025-04-14 01:16:00,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:00,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299854785] [2025-04-14 01:16:00,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:16:00,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:00,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:16:00,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:16:00,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:16:00,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:01,070 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-14 01:16:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:01,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299854785] [2025-04-14 01:16:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299854785] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:16:01,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:16:01,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:16:01,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644831944] [2025-04-14 01:16:01,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:16:01,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:16:01,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:01,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:16:01,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:16:01,072 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-04-14 01:16:01,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-14 01:16:01,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:01,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-04-14 01:16:01,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:01,180 INFO L116 PetriNetUnfolderBase]: 359/653 cut-off events. [2025-04-14 01:16:01,180 INFO L117 PetriNetUnfolderBase]: For 136/138 co-relation queries the response was YES. [2025-04-14 01:16:01,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 653 events. 359/653 cut-off events. For 136/138 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2831 event pairs, 289 based on Foata normal form. 16/618 useless extension candidates. Maximal degree in co-relation 1200. Up to 494 conditions per place. [2025-04-14 01:16:01,184 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 26 selfloop transitions, 2 changer transitions 17/48 dead transitions. [2025-04-14 01:16:01,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 240 flow [2025-04-14 01:16:01,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:16:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:16:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-04-14 01:16:01,188 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45517241379310347 [2025-04-14 01:16:01,188 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 96 flow. Second operand 5 states and 66 transitions. [2025-04-14 01:16:01,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 240 flow [2025-04-14 01:16:01,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:16:01,191 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 110 flow [2025-04-14 01:16:01,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2025-04-14 01:16:01,192 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 11 predicate places. [2025-04-14 01:16:01,192 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 110 flow [2025-04-14 01:16:01,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-14 01:16:01,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:01,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:16:01,192 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:16:01,192 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:16:01,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash -919585493, now seen corresponding path program 1 times [2025-04-14 01:16:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:01,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824133625] [2025-04-14 01:16:01,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:16:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:01,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:16:01,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:16:01,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:16:01,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:02,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:16:02,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:02,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824133625] [2025-04-14 01:16:02,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824133625] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:02,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198239171] [2025-04-14 01:16:02,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:16:02,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:02,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:16:02,197 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-14 01:16:02,198 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-14 01:16:02,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:16:02,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:16:02,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:16:02,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:02,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:16:02,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:16:02,841 INFO L325 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-04-14 01:16:02,843 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 34 treesize of output 10 [2025-04-14 01:16:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:16:02,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:16:03,430 INFO L325 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2025-04-14 01:16:03,430 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 74 treesize of output 99 [2025-04-14 01:16:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:16:03,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198239171] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:16:03,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:16:03,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2025-04-14 01:16:03,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689688776] [2025-04-14 01:16:03,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:16:03,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 01:16:03,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:03,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 01:16:03,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2025-04-14 01:16:03,747 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2025-04-14 01:16:03,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 110 flow. Second operand has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:03,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:03,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2025-04-14 01:16:03,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:07,659 INFO L116 PetriNetUnfolderBase]: 1253/2148 cut-off events. [2025-04-14 01:16:07,659 INFO L117 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2025-04-14 01:16:07,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5145 conditions, 2148 events. 1253/2148 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11261 event pairs, 58 based on Foata normal form. 5/1881 useless extension candidates. Maximal degree in co-relation 5126. Up to 365 conditions per place. [2025-04-14 01:16:07,670 INFO L140 encePairwiseOnDemand]: 11/29 looper letters, 197 selfloop transitions, 89 changer transitions 127/415 dead transitions. [2025-04-14 01:16:07,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 415 transitions, 2046 flow [2025-04-14 01:16:07,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-14 01:16:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-04-14 01:16:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 642 transitions. [2025-04-14 01:16:07,674 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3689655172413793 [2025-04-14 01:16:07,675 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 110 flow. Second operand 60 states and 642 transitions. [2025-04-14 01:16:07,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 415 transitions, 2046 flow [2025-04-14 01:16:07,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 415 transitions, 2026 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-14 01:16:07,688 INFO L231 Difference]: Finished difference. Result has 132 places, 122 transitions, 909 flow [2025-04-14 01:16:07,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=909, PETRI_PLACES=132, PETRI_TRANSITIONS=122} [2025-04-14 01:16:07,689 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 104 predicate places. [2025-04-14 01:16:07,689 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 122 transitions, 909 flow [2025-04-14 01:16:07,689 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:07,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:07,690 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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-14 01:16:07,696 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-14 01:16:07,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-14 01:16:07,890 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:16:07,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash -569913493, now seen corresponding path program 2 times [2025-04-14 01:16:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:07,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701153361] [2025-04-14 01:16:07,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:16:07,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:07,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:16:07,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-04-14 01:16:07,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:16:07,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:16:08,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:08,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701153361] [2025-04-14 01:16:08,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701153361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:16:08,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:16:08,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:16:08,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006990506] [2025-04-14 01:16:08,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:16:08,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:16:08,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:08,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:16:08,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:16:08,041 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-04-14 01:16:08,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 122 transitions, 909 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-14 01:16:08,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:08,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-04-14 01:16:08,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:08,346 INFO L116 PetriNetUnfolderBase]: 1368/2412 cut-off events. [2025-04-14 01:16:08,346 INFO L117 PetriNetUnfolderBase]: For 29674/29698 co-relation queries the response was YES. [2025-04-14 01:16:08,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12831 conditions, 2412 events. 1368/2412 cut-off events. For 29674/29698 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13597 event pairs, 65 based on Foata normal form. 33/2441 useless extension candidates. Maximal degree in co-relation 12775. Up to 729 conditions per place. [2025-04-14 01:16:08,368 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 233 selfloop transitions, 70 changer transitions 1/308 dead transitions. [2025-04-14 01:16:08,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 308 transitions, 2883 flow [2025-04-14 01:16:08,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:16:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:16:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2025-04-14 01:16:08,369 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4870689655172414 [2025-04-14 01:16:08,369 INFO L175 Difference]: Start difference. First operand has 132 places, 122 transitions, 909 flow. Second operand 8 states and 113 transitions. [2025-04-14 01:16:08,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 308 transitions, 2883 flow [2025-04-14 01:16:08,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 308 transitions, 2527 flow, removed 177 selfloop flow, removed 14 redundant places. [2025-04-14 01:16:08,430 INFO L231 Difference]: Finished difference. Result has 111 places, 173 transitions, 1448 flow [2025-04-14 01:16:08,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1448, PETRI_PLACES=111, PETRI_TRANSITIONS=173} [2025-04-14 01:16:08,431 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 83 predicate places. [2025-04-14 01:16:08,431 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 173 transitions, 1448 flow [2025-04-14 01:16:08,431 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-14 01:16:08,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:08,431 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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-14 01:16:08,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:16:08,431 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:16:08,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1950102833, now seen corresponding path program 3 times [2025-04-14 01:16:08,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:08,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957974721] [2025-04-14 01:16:08,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:16:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:08,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:16:08,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:16:08,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:16:08,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:16:09,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:09,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957974721] [2025-04-14 01:16:09,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957974721] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:09,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645684776] [2025-04-14 01:16:09,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:16:09,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:09,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:16:09,528 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-14 01:16:09,530 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-14 01:16:09,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:16:09,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:16:09,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:16:09,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:09,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 01:16:09,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:16:09,843 INFO L325 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-04-14 01:16:09,843 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 42 treesize of output 10 [2025-04-14 01:16:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:16:09,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:16:10,105 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:16:10,106 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 74 treesize of output 121 [2025-04-14 01:16:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:16:10,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645684776] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:16:10,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:16:10,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 28 [2025-04-14 01:16:10,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449223088] [2025-04-14 01:16:10,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:16:10,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 01:16:10,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:10,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 01:16:10,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-04-14 01:16:10,293 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2025-04-14 01:16:10,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 173 transitions, 1448 flow. Second operand has 30 states, 30 states have (on average 6.366666666666666) internal successors, (191), 30 states have internal predecessors, (191), 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-14 01:16:10,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:10,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2025-04-14 01:16:10,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:12,005 INFO L116 PetriNetUnfolderBase]: 2464/4130 cut-off events. [2025-04-14 01:16:12,005 INFO L117 PetriNetUnfolderBase]: For 27397/27399 co-relation queries the response was YES. [2025-04-14 01:16:12,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20492 conditions, 4130 events. 2464/4130 cut-off events. For 27397/27399 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 23140 event pairs, 146 based on Foata normal form. 5/4135 useless extension candidates. Maximal degree in co-relation 19898. Up to 1132 conditions per place. [2025-04-14 01:16:12,036 INFO L140 encePairwiseOnDemand]: 14/29 looper letters, 211 selfloop transitions, 177 changer transitions 27/417 dead transitions. [2025-04-14 01:16:12,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 417 transitions, 4446 flow [2025-04-14 01:16:12,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 01:16:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 01:16:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 297 transitions. [2025-04-14 01:16:12,038 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3657635467980296 [2025-04-14 01:16:12,038 INFO L175 Difference]: Start difference. First operand has 111 places, 173 transitions, 1448 flow. Second operand 28 states and 297 transitions. [2025-04-14 01:16:12,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 417 transitions, 4446 flow [2025-04-14 01:16:12,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 417 transitions, 4203 flow, removed 108 selfloop flow, removed 2 redundant places. [2025-04-14 01:16:12,111 INFO L231 Difference]: Finished difference. Result has 151 places, 277 transitions, 3078 flow [2025-04-14 01:16:12,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3078, PETRI_PLACES=151, PETRI_TRANSITIONS=277} [2025-04-14 01:16:12,112 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 123 predicate places. [2025-04-14 01:16:12,112 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 277 transitions, 3078 flow [2025-04-14 01:16:12,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.366666666666666) internal successors, (191), 30 states have internal predecessors, (191), 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-14 01:16:12,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:12,112 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:16:12,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 01:16:12,317 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,SelfDestructingSolverStorable7 [2025-04-14 01:16:12,317 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:16:12,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2066921266, now seen corresponding path program 4 times [2025-04-14 01:16:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:12,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225199932] [2025-04-14 01:16:12,318 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:16:12,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:12,324 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:16:12,334 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:16:12,335 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:16:12,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:16:12,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:12,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225199932] [2025-04-14 01:16:12,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225199932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:16:12,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:16:12,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:16:12,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671190399] [2025-04-14 01:16:12,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:16:12,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:16:12,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:12,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:16:12,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:16:12,392 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-04-14 01:16:12,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 277 transitions, 3078 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-14 01:16:12,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:12,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-04-14 01:16:12,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:13,072 INFO L116 PetriNetUnfolderBase]: 3360/5939 cut-off events. [2025-04-14 01:16:13,072 INFO L117 PetriNetUnfolderBase]: For 44672/44712 co-relation queries the response was YES. [2025-04-14 01:16:13,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32671 conditions, 5939 events. 3360/5939 cut-off events. For 44672/44712 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 37083 event pairs, 528 based on Foata normal form. 162/6085 useless extension candidates. Maximal degree in co-relation 32596. Up to 2412 conditions per place. [2025-04-14 01:16:13,117 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 388 selfloop transitions, 82 changer transitions 13/487 dead transitions. [2025-04-14 01:16:13,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 487 transitions, 6426 flow [2025-04-14 01:16:13,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:16:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:16:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-04-14 01:16:13,118 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6637931034482759 [2025-04-14 01:16:13,118 INFO L175 Difference]: Start difference. First operand has 151 places, 277 transitions, 3078 flow. Second operand 4 states and 77 transitions. [2025-04-14 01:16:13,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 487 transitions, 6426 flow [2025-04-14 01:16:13,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 487 transitions, 6069 flow, removed 145 selfloop flow, removed 8 redundant places. [2025-04-14 01:16:13,258 INFO L231 Difference]: Finished difference. Result has 145 places, 335 transitions, 3916 flow [2025-04-14 01:16:13,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2836, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3916, PETRI_PLACES=145, PETRI_TRANSITIONS=335} [2025-04-14 01:16:13,258 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 117 predicate places. [2025-04-14 01:16:13,258 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 335 transitions, 3916 flow [2025-04-14 01:16:13,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-14 01:16:13,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:13,259 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:16:13,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:16:13,259 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:16:13,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash 820202805, now seen corresponding path program 5 times [2025-04-14 01:16:13,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:13,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139079446] [2025-04-14 01:16:13,260 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:16:13,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:13,266 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-04-14 01:16:13,273 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 01:16:13,273 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:16:13,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:16:13,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:13,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139079446] [2025-04-14 01:16:13,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139079446] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:13,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327942776] [2025-04-14 01:16:13,350 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:16:13,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:13,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:16:13,352 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-14 01:16:13,354 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-14 01:16:13,395 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-04-14 01:16:13,417 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 01:16:13,418 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:16:13,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:13,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:16:13,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:16:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:16:13,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:16:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:16:13,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327942776] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:16:13,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:16:13,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-04-14 01:16:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953475102] [2025-04-14 01:16:13,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:16:13,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 01:16:13,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:13,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 01:16:13,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:16:13,626 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-04-14 01:16:13,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 335 transitions, 3916 flow. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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-14 01:16:13,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:13,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-04-14 01:16:13,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:14,431 INFO L116 PetriNetUnfolderBase]: 3066/5710 cut-off events. [2025-04-14 01:16:14,431 INFO L117 PetriNetUnfolderBase]: For 47503/47544 co-relation queries the response was YES. [2025-04-14 01:16:14,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31349 conditions, 5710 events. 3066/5710 cut-off events. For 47503/47544 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 37048 event pairs, 1047 based on Foata normal form. 253/5937 useless extension candidates. Maximal degree in co-relation 30687. Up to 3362 conditions per place. [2025-04-14 01:16:14,462 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 204 selfloop transitions, 9 changer transitions 253/470 dead transitions. [2025-04-14 01:16:14,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 470 transitions, 6166 flow [2025-04-14 01:16:14,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 01:16:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 01:16:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 230 transitions. [2025-04-14 01:16:14,464 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2025-04-14 01:16:14,464 INFO L175 Difference]: Start difference. First operand has 145 places, 335 transitions, 3916 flow. Second operand 20 states and 230 transitions. [2025-04-14 01:16:14,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 470 transitions, 6166 flow [2025-04-14 01:16:14,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 470 transitions, 6137 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-14 01:16:14,585 INFO L231 Difference]: Finished difference. Result has 165 places, 194 transitions, 2328 flow [2025-04-14 01:16:14,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3189, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2328, PETRI_PLACES=165, PETRI_TRANSITIONS=194} [2025-04-14 01:16:14,587 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 137 predicate places. [2025-04-14 01:16:14,587 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 194 transitions, 2328 flow [2025-04-14 01:16:14,587 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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-14 01:16:14,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:14,588 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:16:14,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 01:16:14,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:14,788 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:16:14,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1772361031, now seen corresponding path program 6 times [2025-04-14 01:16:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:14,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230665058] [2025-04-14 01:16:14,789 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:16:14,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:14,795 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 2 equivalence classes. [2025-04-14 01:16:14,806 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:16:14,806 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:16:14,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 01:16:14,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:14,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230665058] [2025-04-14 01:16:14,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230665058] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:14,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717556358] [2025-04-14 01:16:14,924 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:16:14,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:14,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:16:14,927 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-14 01:16:14,927 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-14 01:16:14,977 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 2 equivalence classes. [2025-04-14 01:16:15,000 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:16:15,000 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:16:15,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:15,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:16:15,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:16:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:16:15,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:16:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:16:15,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717556358] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:16:15,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:16:15,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 8 [2025-04-14 01:16:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249628701] [2025-04-14 01:16:15,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:16:15,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:16:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:15,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:16:15,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:16:15,061 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2025-04-14 01:16:15,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 194 transitions, 2328 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-14 01:16:15,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:15,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2025-04-14 01:16:15,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:15,692 INFO L116 PetriNetUnfolderBase]: 3137/5246 cut-off events. [2025-04-14 01:16:15,692 INFO L117 PetriNetUnfolderBase]: For 46369/46369 co-relation queries the response was YES. [2025-04-14 01:16:15,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29623 conditions, 5246 events. 3137/5246 cut-off events. For 46369/46369 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 28717 event pairs, 307 based on Foata normal form. 47/5293 useless extension candidates. Maximal degree in co-relation 29553. Up to 3186 conditions per place. [2025-04-14 01:16:15,731 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 151 selfloop transitions, 104 changer transitions 0/257 dead transitions. [2025-04-14 01:16:15,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 257 transitions, 3521 flow [2025-04-14 01:16:15,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:16:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:16:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2025-04-14 01:16:15,732 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43103448275862066 [2025-04-14 01:16:15,732 INFO L175 Difference]: Start difference. First operand has 165 places, 194 transitions, 2328 flow. Second operand 6 states and 75 transitions. [2025-04-14 01:16:15,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 257 transitions, 3521 flow [2025-04-14 01:16:15,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 257 transitions, 3099 flow, removed 205 selfloop flow, removed 29 redundant places. [2025-04-14 01:16:15,869 INFO L231 Difference]: Finished difference. Result has 109 places, 222 transitions, 2687 flow [2025-04-14 01:16:15,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2687, PETRI_PLACES=109, PETRI_TRANSITIONS=222} [2025-04-14 01:16:15,870 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 81 predicate places. [2025-04-14 01:16:15,870 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 222 transitions, 2687 flow [2025-04-14 01:16:15,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-14 01:16:15,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:15,870 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:16:15,877 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-14 01:16:16,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:16,071 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:16:16,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1634516677, now seen corresponding path program 7 times [2025-04-14 01:16:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:16,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308259091] [2025-04-14 01:16:16,071 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:16:16,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:16,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 01:16:16,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:16:16,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:16:16,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:16:17,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:17,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308259091] [2025-04-14 01:16:17,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308259091] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:17,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035930685] [2025-04-14 01:16:17,540 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:16:17,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:17,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:16:17,542 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-14 01:16:17,544 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-14 01:16:17,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 01:16:17,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:16:17,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:16:17,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:17,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 01:16:17,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:16:42,227 INFO L325 Elim1Store]: treesize reduction 41, result has 54.9 percent of original size [2025-04-14 01:16:42,227 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 82 treesize of output 65 [2025-04-14 01:16:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:16:42,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:16:43,715 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:16:43,715 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 237 treesize of output 1261 [2025-04-14 01:18:35,375 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-14 01:18:35,376 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-14 01:18:35,377 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-14 01:18:35,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 01:18:35,577 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,SelfDestructingSolverStorable11 [2025-04-14 01:18:35,578 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.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2025-04-14 01:18:35,584 INFO L158 Benchmark]: Toolchain (without parser) took 156814.97ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 119.8MB in the beginning and 529.4MB in the end (delta: -409.6MB). Peak memory consumption was 952.5MB. Max. memory is 8.0GB. [2025-04-14 01:18:35,584 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:18:35,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.38ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 104.1MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:18:35,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.84ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 101.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:18:35,585 INFO L158 Benchmark]: Boogie Preprocessor took 45.62ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 100.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:18:35,586 INFO L158 Benchmark]: IcfgBuilder took 581.53ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 33.0MB in the end (delta: 66.3MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. [2025-04-14 01:18:35,586 INFO L158 Benchmark]: TraceAbstraction took 155876.78ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 33.0MB in the beginning and 529.4MB in the end (delta: -496.4MB). Peak memory consumption was 868.6MB. Max. memory is 8.0GB. [2025-04-14 01:18:35,588 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.21ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.38ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 104.1MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.84ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 101.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.62ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 100.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 581.53ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 33.0MB in the end (delta: 66.3MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. * TraceAbstraction took 155876.78ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 33.0MB in the beginning and 529.4MB in the end (delta: -496.4MB). Peak memory consumption was 868.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...