./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/clever.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/clever.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:19:51,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:19:52,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:19:52,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:19:52,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:19:52,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:19:52,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:19:52,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:19:52,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:19:52,077 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:19:52,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:19:52,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:19:52,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:19:52,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:19:52,077 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:19:52,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:19:52,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:19:52,078 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:19:52,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:19:52,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:19:52,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:19:52,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:19:52,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:19:52,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:19:52,080 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:19:52,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:19:52,080 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:19:52,080 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:19:52,080 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:19:52,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:19:52,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:19:52,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:19:52,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:19:52,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:19:52,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:19:52,081 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:19:52,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:19:52,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:19:52,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:19:52,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:19:52,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:19:52,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:19:52,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:19:52,081 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d [2025-03-04 02:19:52,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:19:52,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:19:52,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:19:52,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:19:52,321 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:19:52,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/clever.wvr.c [2025-03-04 02:19:53,498 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345f7450b/a215ca77feb441ed93331db347338647/FLAG6e2eaa163 [2025-03-04 02:19:53,717 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:19:53,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c [2025-03-04 02:19:53,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345f7450b/a215ca77feb441ed93331db347338647/FLAG6e2eaa163 [2025-03-04 02:19:54,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345f7450b/a215ca77feb441ed93331db347338647 [2025-03-04 02:19:54,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:19:54,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:19:54,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:19:54,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:19:54,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:19:54,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@95615a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54, skipping insertion in model container [2025-03-04 02:19:54,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:19:54,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c[2159,2172] [2025-03-04 02:19:54,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:19:54,208 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:19:54,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c[2159,2172] [2025-03-04 02:19:54,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:19:54,229 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:19:54,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54 WrapperNode [2025-03-04 02:19:54,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:19:54,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:19:54,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:19:54,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:19:54,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,252 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2025-03-04 02:19:54,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:19:54,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:19:54,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:19:54,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:19:54,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:19:54,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,269 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:19:54,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:19:54,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:19:54,274 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:19:54,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:19:54,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:54,298 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-03-04 02:19:54,300 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-03-04 02:19:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:19:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:19:54,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:19:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:19:54,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:19:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:19:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:19:54,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:19:54,320 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:19:54,383 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:19:54,385 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:19:54,579 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:19:54,580 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:19:54,700 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:19:54,700 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:19:54,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:19:54 BoogieIcfgContainer [2025-03-04 02:19:54,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:19:54,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:19:54,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:19:54,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:19:54,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:19:54" (1/3) ... [2025-03-04 02:19:54,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7437ce40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:19:54, skipping insertion in model container [2025-03-04 02:19:54,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (2/3) ... [2025-03-04 02:19:54,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7437ce40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:19:54, skipping insertion in model container [2025-03-04 02:19:54,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:19:54" (3/3) ... [2025-03-04 02:19:54,708 INFO L128 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2025-03-04 02:19:54,719 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:19:54,721 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG clever.wvr.c that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:19:54,721 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:19:54,758 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:19:54,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-03-04 02:19:54,810 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-03-04 02:19:54,815 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:19:54,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 17 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-03-04 02:19:54,817 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-03-04 02:19:54,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-03-04 02:19:54,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:19:54,833 INFO L333 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;@6f27865a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:19:54,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:19:54,839 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:19:54,839 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-03-04 02:19:54,839 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:19:54,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:54,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:54,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:54,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:54,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1617047893, now seen corresponding path program 1 times [2025-03-04 02:19:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788168694] [2025-03-04 02:19:54,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:54,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:19:54,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:19:54,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:54,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:55,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:55,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788168694] [2025-03-04 02:19:55,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788168694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:55,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:55,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:19:55,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415706443] [2025-03-04 02:19:55,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:55,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:19:55,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:55,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:19:55,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:19:55,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:19:55,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:55,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:55,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:19:55,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:55,332 INFO L124 PetriNetUnfolderBase]: 106/171 cut-off events. [2025-03-04 02:19:55,333 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 02:19:55,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 171 events. 106/171 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 508 event pairs, 19 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 318. Up to 110 conditions per place. [2025-03-04 02:19:55,337 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 21 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2025-03-04 02:19:55,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 127 flow [2025-03-04 02:19:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:19:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:19:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-03-04 02:19:55,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-04 02:19:55,349 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 41 transitions. [2025-03-04 02:19:55,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 127 flow [2025-03-04 02:19:55,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 113 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:19:55,356 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2025-03-04 02:19:55,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2025-03-04 02:19:55,360 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-03-04 02:19:55,361 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2025-03-04 02:19:55,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:55,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:55,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:55,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:19:55,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:55,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:55,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2015537899, now seen corresponding path program 1 times [2025-03-04 02:19:55,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:55,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944855591] [2025-03-04 02:19:55,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:55,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:55,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:19:55,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:19:55,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:55,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:55,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:55,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944855591] [2025-03-04 02:19:55,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944855591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:55,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:55,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:19:55,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628676219] [2025-03-04 02:19:55,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:55,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:19:55,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:55,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:19:55,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:19:55,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:19:55,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-03-04 02:19:55,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:55,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:19:55,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:55,535 INFO L124 PetriNetUnfolderBase]: 145/242 cut-off events. [2025-03-04 02:19:55,535 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 02:19:55,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 242 events. 145/242 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 778 event pairs, 12 based on Foata normal form. 6/223 useless extension candidates. Maximal degree in co-relation 172. Up to 96 conditions per place. [2025-03-04 02:19:55,537 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 37 selfloop transitions, 7 changer transitions 2/49 dead transitions. [2025-03-04 02:19:55,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 49 transitions, 236 flow [2025-03-04 02:19:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:19:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:19:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-03-04 02:19:55,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66 [2025-03-04 02:19:55,538 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 66 transitions. [2025-03-04 02:19:55,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 49 transitions, 236 flow [2025-03-04 02:19:55,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 49 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:55,541 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 105 flow [2025-03-04 02:19:55,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2025-03-04 02:19:55,542 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2025-03-04 02:19:55,542 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 105 flow [2025-03-04 02:19:55,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-03-04 02:19:55,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:55,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:55,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:19:55,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:55,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1838245669, now seen corresponding path program 2 times [2025-03-04 02:19:55,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:55,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405468224] [2025-03-04 02:19:55,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:55,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:55,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 02:19:55,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:19:55,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:55,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:55,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405468224] [2025-03-04 02:19:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405468224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257798480] [2025-03-04 02:19:55,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:55,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:55,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:55,627 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-03-04 02:19:55,630 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-03-04 02:19:55,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 02:19:55,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:19:55,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:55,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:55,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:19:55,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:55,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:55,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257798480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:55,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:55,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 02:19:55,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39158332] [2025-03-04 02:19:55,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:55,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:19:55,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:55,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:19:55,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:19:55,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:19:55,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:55,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:55,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:19:55,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:55,917 INFO L124 PetriNetUnfolderBase]: 145/239 cut-off events. [2025-03-04 02:19:55,917 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2025-03-04 02:19:55,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 239 events. 145/239 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 742 event pairs, 15 based on Foata normal form. 8/245 useless extension candidates. Maximal degree in co-relation 306. Up to 105 conditions per place. [2025-03-04 02:19:55,919 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 35 selfloop transitions, 15 changer transitions 5/58 dead transitions. [2025-03-04 02:19:55,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 58 transitions, 348 flow [2025-03-04 02:19:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:19:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:19:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-03-04 02:19:55,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 02:19:55,920 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 105 flow. Second operand 7 states and 80 transitions. [2025-03-04 02:19:55,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 58 transitions, 348 flow [2025-03-04 02:19:55,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 58 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:19:55,924 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 211 flow [2025-03-04 02:19:55,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=211, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2025-03-04 02:19:55,925 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2025-03-04 02:19:55,925 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 211 flow [2025-03-04 02:19:55,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:55,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:55,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:55,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:19:56,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:56,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:56,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1306416981, now seen corresponding path program 1 times [2025-03-04 02:19:56,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:56,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864591434] [2025-03-04 02:19:56,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:56,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:56,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:19:56,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:19:56,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:56,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:19:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:56,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864591434] [2025-03-04 02:19:56,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864591434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:56,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206419146] [2025-03-04 02:19:56,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:56,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:56,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:56,209 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-03-04 02:19:56,211 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-03-04 02:19:56,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:19:56,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:19:56,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:56,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:56,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:19:56,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:19:56,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:19:56,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206419146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:56,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:56,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 02:19:56,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421243575] [2025-03-04 02:19:56,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:56,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:19:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:56,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:19:56,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:19:56,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:19:56,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-03-04 02:19:56,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:56,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:19:56,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:56,455 INFO L124 PetriNetUnfolderBase]: 127/223 cut-off events. [2025-03-04 02:19:56,456 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2025-03-04 02:19:56,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 223 events. 127/223 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 688 event pairs, 2 based on Foata normal form. 14/236 useless extension candidates. Maximal degree in co-relation 543. Up to 91 conditions per place. [2025-03-04 02:19:56,460 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 41 selfloop transitions, 9 changer transitions 3/56 dead transitions. [2025-03-04 02:19:56,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 423 flow [2025-03-04 02:19:56,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:19:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:19:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-03-04 02:19:56,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-03-04 02:19:56,461 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 211 flow. Second operand 5 states and 64 transitions. [2025-03-04 02:19:56,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 423 flow [2025-03-04 02:19:56,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 411 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 02:19:56,467 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 237 flow [2025-03-04 02:19:56,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2025-03-04 02:19:56,468 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2025-03-04 02:19:56,468 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 237 flow [2025-03-04 02:19:56,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-03-04 02:19:56,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:56,468 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:56,476 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-03-04 02:19:56,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 02:19:56,669 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:56,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash -923758624, now seen corresponding path program 1 times [2025-03-04 02:19:56,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:56,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828077935] [2025-03-04 02:19:56,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:56,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:56,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:19:56,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:19:56,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:56,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:56,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:56,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828077935] [2025-03-04 02:19:56,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828077935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:56,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20655644] [2025-03-04 02:19:56,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:56,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:56,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:56,928 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-03-04 02:19:56,929 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-03-04 02:19:56,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:19:56,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:19:56,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:56,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:56,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:19:56,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:57,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:57,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20655644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:57,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:57,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 02:19:57,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299311525] [2025-03-04 02:19:57,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:57,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:19:57,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:57,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:19:57,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:19:57,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:19:57,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 237 flow. Second operand has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 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-03-04 02:19:57,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:57,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:19:57,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:57,484 INFO L124 PetriNetUnfolderBase]: 249/435 cut-off events. [2025-03-04 02:19:57,484 INFO L125 PetriNetUnfolderBase]: For 864/864 co-relation queries the response was YES. [2025-03-04 02:19:57,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1800 conditions, 435 events. 249/435 cut-off events. For 864/864 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1680 event pairs, 13 based on Foata normal form. 14/448 useless extension candidates. Maximal degree in co-relation 995. Up to 176 conditions per place. [2025-03-04 02:19:57,490 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 62 selfloop transitions, 19 changer transitions 21/105 dead transitions. [2025-03-04 02:19:57,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 105 transitions, 873 flow [2025-03-04 02:19:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:19:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:19:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2025-03-04 02:19:57,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6611111111111111 [2025-03-04 02:19:57,493 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 237 flow. Second operand 9 states and 119 transitions. [2025-03-04 02:19:57,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 105 transitions, 873 flow [2025-03-04 02:19:57,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 105 transitions, 841 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 02:19:57,501 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 409 flow [2025-03-04 02:19:57,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=409, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-03-04 02:19:57,502 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 30 predicate places. [2025-03-04 02:19:57,502 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 409 flow [2025-03-04 02:19:57,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 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-03-04 02:19:57,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:57,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:57,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:19:57,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:57,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:57,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash 146699317, now seen corresponding path program 2 times [2025-03-04 02:19:57,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:57,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57115472] [2025-03-04 02:19:57,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:57,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:57,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:19:57,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:19:57,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:57,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:19:57,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:57,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57115472] [2025-03-04 02:19:57,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57115472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:57,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:57,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:19:57,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172846582] [2025-03-04 02:19:57,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:57,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:19:57,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:57,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:19:57,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:19:57,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:19:57,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 409 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-03-04 02:19:57,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:57,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:19:57,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:57,819 INFO L124 PetriNetUnfolderBase]: 192/331 cut-off events. [2025-03-04 02:19:57,819 INFO L125 PetriNetUnfolderBase]: For 1027/1027 co-relation queries the response was YES. [2025-03-04 02:19:57,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 331 events. 192/331 cut-off events. For 1027/1027 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1137 event pairs, 25 based on Foata normal form. 2/332 useless extension candidates. Maximal degree in co-relation 1490. Up to 152 conditions per place. [2025-03-04 02:19:57,821 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 53 selfloop transitions, 12 changer transitions 2/70 dead transitions. [2025-03-04 02:19:57,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 696 flow [2025-03-04 02:19:57,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:19:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:19:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-03-04 02:19:57,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-03-04 02:19:57,822 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 409 flow. Second operand 5 states and 59 transitions. [2025-03-04 02:19:57,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 696 flow [2025-03-04 02:19:57,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 639 flow, removed 25 selfloop flow, removed 3 redundant places. [2025-03-04 02:19:57,829 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 453 flow [2025-03-04 02:19:57,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=453, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-03-04 02:19:57,831 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2025-03-04 02:19:57,832 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 453 flow [2025-03-04 02:19:57,832 INFO L472 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-03-04 02:19:57,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:57,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:57,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:19:57,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:57,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:57,833 INFO L85 PathProgramCache]: Analyzing trace with hash -608970760, now seen corresponding path program 2 times [2025-03-04 02:19:57,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:57,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984602996] [2025-03-04 02:19:57,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:57,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:57,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:19:57,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:19:57,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:57,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:58,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:58,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984602996] [2025-03-04 02:19:58,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984602996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:58,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380071635] [2025-03-04 02:19:58,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:58,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:58,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:58,047 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-03-04 02:19:58,048 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-03-04 02:19:58,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:19:58,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:19:58,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:58,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:58,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:19:58,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:58,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:58,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380071635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:58,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:58,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 02:19:58,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272358881] [2025-03-04 02:19:58,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:58,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:19:58,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:58,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:19:58,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:19:58,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:19:58,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 453 flow. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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-03-04 02:19:58,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:58,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:19:58,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:58,952 INFO L124 PetriNetUnfolderBase]: 624/1068 cut-off events. [2025-03-04 02:19:58,952 INFO L125 PetriNetUnfolderBase]: For 4297/4297 co-relation queries the response was YES. [2025-03-04 02:19:58,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5034 conditions, 1068 events. 624/1068 cut-off events. For 4297/4297 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5041 event pairs, 41 based on Foata normal form. 8/1075 useless extension candidates. Maximal degree in co-relation 4328. Up to 321 conditions per place. [2025-03-04 02:19:58,961 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 134 selfloop transitions, 86 changer transitions 11/234 dead transitions. [2025-03-04 02:19:58,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 234 transitions, 2363 flow [2025-03-04 02:19:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:19:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:19:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 223 transitions. [2025-03-04 02:19:58,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6558823529411765 [2025-03-04 02:19:58,963 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 453 flow. Second operand 17 states and 223 transitions. [2025-03-04 02:19:58,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 234 transitions, 2363 flow [2025-03-04 02:19:58,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 234 transitions, 2260 flow, removed 41 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:58,976 INFO L231 Difference]: Finished difference. Result has 80 places, 135 transitions, 1585 flow [2025-03-04 02:19:58,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1585, PETRI_PLACES=80, PETRI_TRANSITIONS=135} [2025-03-04 02:19:58,977 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 59 predicate places. [2025-03-04 02:19:58,977 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 135 transitions, 1585 flow [2025-03-04 02:19:58,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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-03-04 02:19:58,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:58,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:58,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:19:59,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:59,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:59,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:59,179 INFO L85 PathProgramCache]: Analyzing trace with hash -305227976, now seen corresponding path program 3 times [2025-03-04 02:19:59,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:59,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47760339] [2025-03-04 02:19:59,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:59,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:59,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:19:59,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:19:59,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:19:59,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:59,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:59,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47760339] [2025-03-04 02:19:59,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47760339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:59,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54725295] [2025-03-04 02:19:59,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:59,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:59,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:59,387 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-03-04 02:19:59,388 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-03-04 02:19:59,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 02:19:59,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:19:59,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:19:59,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:59,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:19:59,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:59,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:59,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54725295] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:59,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:59,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 02:19:59,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490213653] [2025-03-04 02:19:59,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:59,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:19:59,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:59,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:19:59,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:19:59,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:19:59,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 135 transitions, 1585 flow. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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-03-04 02:19:59,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:59,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:19:59,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:00,231 INFO L124 PetriNetUnfolderBase]: 1342/2300 cut-off events. [2025-03-04 02:20:00,232 INFO L125 PetriNetUnfolderBase]: For 11530/11530 co-relation queries the response was YES. [2025-03-04 02:20:00,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12458 conditions, 2300 events. 1342/2300 cut-off events. For 11530/11530 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12720 event pairs, 110 based on Foata normal form. 7/2306 useless extension candidates. Maximal degree in co-relation 11910. Up to 713 conditions per place. [2025-03-04 02:20:00,253 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 183 selfloop transitions, 151 changer transitions 11/348 dead transitions. [2025-03-04 02:20:00,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 348 transitions, 4525 flow [2025-03-04 02:20:00,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:20:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:20:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2025-03-04 02:20:00,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2025-03-04 02:20:00,255 INFO L175 Difference]: Start difference. First operand has 80 places, 135 transitions, 1585 flow. Second operand 11 states and 144 transitions. [2025-03-04 02:20:00,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 348 transitions, 4525 flow [2025-03-04 02:20:00,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 348 transitions, 4231 flow, removed 144 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:00,285 INFO L231 Difference]: Finished difference. Result has 93 places, 241 transitions, 3341 flow [2025-03-04 02:20:00,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3341, PETRI_PLACES=93, PETRI_TRANSITIONS=241} [2025-03-04 02:20:00,286 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 72 predicate places. [2025-03-04 02:20:00,286 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 241 transitions, 3341 flow [2025-03-04 02:20:00,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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-03-04 02:20:00,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:00,286 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:00,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:20:00,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:00,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:00,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash 443689368, now seen corresponding path program 1 times [2025-03-04 02:20:00,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:00,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253043929] [2025-03-04 02:20:00,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:00,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:00,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:20:00,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:00,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:00,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:00,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:00,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253043929] [2025-03-04 02:20:00,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253043929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:00,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240333892] [2025-03-04 02:20:00,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:00,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:00,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:00,735 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:00,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:20:00,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:20:00,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:00,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:00,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:00,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:20:00,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:01,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:01,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240333892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:01,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:01,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 16 [2025-03-04 02:20:01,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464407183] [2025-03-04 02:20:01,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:01,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:20:01,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:01,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:20:01,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:20:01,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:20:01,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 241 transitions, 3341 flow. Second operand has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 states have internal predecessors, (126), 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-03-04 02:20:01,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:01,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:20:01,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:12,158 INFO L124 PetriNetUnfolderBase]: 2097/3586 cut-off events. [2025-03-04 02:20:12,158 INFO L125 PetriNetUnfolderBase]: For 24224/24224 co-relation queries the response was YES. [2025-03-04 02:20:12,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21352 conditions, 3586 events. 2097/3586 cut-off events. For 24224/24224 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 20326 event pairs, 164 based on Foata normal form. 16/3601 useless extension candidates. Maximal degree in co-relation 20076. Up to 2101 conditions per place. [2025-03-04 02:20:12,183 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 327 selfloop transitions, 164 changer transitions 6/500 dead transitions. [2025-03-04 02:20:12,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 500 transitions, 7277 flow [2025-03-04 02:20:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:20:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:20:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 242 transitions. [2025-03-04 02:20:12,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6368421052631579 [2025-03-04 02:20:12,184 INFO L175 Difference]: Start difference. First operand has 93 places, 241 transitions, 3341 flow. Second operand 19 states and 242 transitions. [2025-03-04 02:20:12,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 500 transitions, 7277 flow [2025-03-04 02:20:12,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 500 transitions, 7134 flow, removed 60 selfloop flow, removed 6 redundant places. [2025-03-04 02:20:12,234 INFO L231 Difference]: Finished difference. Result has 116 places, 365 transitions, 5788 flow [2025-03-04 02:20:12,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3256, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5788, PETRI_PLACES=116, PETRI_TRANSITIONS=365} [2025-03-04 02:20:12,235 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 95 predicate places. [2025-03-04 02:20:12,235 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 365 transitions, 5788 flow [2025-03-04 02:20:12,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 states have internal predecessors, (126), 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-03-04 02:20:12,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:12,235 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:12,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:12,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:12,436 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:12,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:12,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1230853478, now seen corresponding path program 2 times [2025-03-04 02:20:12,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:12,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678024987] [2025-03-04 02:20:12,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:12,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:12,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:20:12,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:12,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:12,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:12,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:12,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678024987] [2025-03-04 02:20:12,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678024987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:12,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632559554] [2025-03-04 02:20:12,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:12,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:12,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:12,685 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:12,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:20:12,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:20:12,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:12,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:12,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:12,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:20:12,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:13,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:13,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632559554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:13,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:13,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 16 [2025-03-04 02:20:13,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626172128] [2025-03-04 02:20:13,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:13,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:20:13,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:13,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:20:13,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:20:13,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:20:13,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 365 transitions, 5788 flow. Second operand has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 states have internal predecessors, (126), 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-03-04 02:20:13,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:13,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:20:13,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:15,024 INFO L124 PetriNetUnfolderBase]: 2916/5016 cut-off events. [2025-03-04 02:20:15,024 INFO L125 PetriNetUnfolderBase]: For 45985/45985 co-relation queries the response was YES. [2025-03-04 02:20:15,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32639 conditions, 5016 events. 2916/5016 cut-off events. For 45985/45985 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 31038 event pairs, 285 based on Foata normal form. 6/5021 useless extension candidates. Maximal degree in co-relation 30661. Up to 3552 conditions per place. [2025-03-04 02:20:15,069 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 466 selfloop transitions, 191 changer transitions 8/668 dead transitions. [2025-03-04 02:20:15,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 668 transitions, 11080 flow [2025-03-04 02:20:15,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 02:20:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 02:20:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 295 transitions. [2025-03-04 02:20:15,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6704545454545454 [2025-03-04 02:20:15,074 INFO L175 Difference]: Start difference. First operand has 116 places, 365 transitions, 5788 flow. Second operand 22 states and 295 transitions. [2025-03-04 02:20:15,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 668 transitions, 11080 flow [2025-03-04 02:20:15,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 668 transitions, 10445 flow, removed 306 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:15,204 INFO L231 Difference]: Finished difference. Result has 145 places, 527 transitions, 8964 flow [2025-03-04 02:20:15,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=5447, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8964, PETRI_PLACES=145, PETRI_TRANSITIONS=527} [2025-03-04 02:20:15,205 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 124 predicate places. [2025-03-04 02:20:15,205 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 527 transitions, 8964 flow [2025-03-04 02:20:15,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 states have internal predecessors, (126), 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-03-04 02:20:15,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:15,205 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:15,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:15,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:15,406 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:15,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash -600252973, now seen corresponding path program 3 times [2025-03-04 02:20:15,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:15,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520892418] [2025-03-04 02:20:15,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:15,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-03-04 02:20:15,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 18 statements. [2025-03-04 02:20:15,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:15,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:15,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520892418] [2025-03-04 02:20:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520892418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680354934] [2025-03-04 02:20:15,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:15,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:15,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:15,459 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:15,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:20:15,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-03-04 02:20:15,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 18 statements. [2025-03-04 02:20:15,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:15,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:15,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:20:15,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:15,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:15,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680354934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:15,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:15,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 02:20:15,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936916531] [2025-03-04 02:20:15,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:15,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:15,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:15,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:15,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:15,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:20:15,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 527 transitions, 8964 flow. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-03-04 02:20:15,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:15,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:20:15,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:16,655 INFO L124 PetriNetUnfolderBase]: 3981/7044 cut-off events. [2025-03-04 02:20:16,655 INFO L125 PetriNetUnfolderBase]: For 82968/82968 co-relation queries the response was YES. [2025-03-04 02:20:16,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47087 conditions, 7044 events. 3981/7044 cut-off events. For 82968/82968 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 49274 event pairs, 63 based on Foata normal form. 63/7106 useless extension candidates. Maximal degree in co-relation 45128. Up to 2131 conditions per place. [2025-03-04 02:20:16,700 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 695 selfloop transitions, 256 changer transitions 13/967 dead transitions. [2025-03-04 02:20:16,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 967 transitions, 17252 flow [2025-03-04 02:20:16,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:20:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:20:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2025-03-04 02:20:16,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5875 [2025-03-04 02:20:16,702 INFO L175 Difference]: Start difference. First operand has 145 places, 527 transitions, 8964 flow. Second operand 12 states and 141 transitions. [2025-03-04 02:20:16,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 967 transitions, 17252 flow [2025-03-04 02:20:16,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 967 transitions, 16433 flow, removed 389 selfloop flow, removed 7 redundant places. [2025-03-04 02:20:16,944 INFO L231 Difference]: Finished difference. Result has 156 places, 660 transitions, 11795 flow [2025-03-04 02:20:16,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=8339, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11795, PETRI_PLACES=156, PETRI_TRANSITIONS=660} [2025-03-04 02:20:16,945 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 135 predicate places. [2025-03-04 02:20:16,945 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 660 transitions, 11795 flow [2025-03-04 02:20:16,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-03-04 02:20:16,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:16,945 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:16,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 02:20:17,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 02:20:17,146 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:17,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1946660479, now seen corresponding path program 4 times [2025-03-04 02:20:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:17,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362831704] [2025-03-04 02:20:17,146 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:17,149 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:20:17,153 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:17,153 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:17,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:17,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:17,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362831704] [2025-03-04 02:20:17,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362831704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:17,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577792096] [2025-03-04 02:20:17,186 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:17,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:17,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:17,188 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:17,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:20:17,216 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:20:17,226 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:17,226 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:17,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:17,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:20:17,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:17,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:17,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577792096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:17,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:17,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 8 [2025-03-04 02:20:17,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50661112] [2025-03-04 02:20:17,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:17,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:20:17,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:17,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:20:17,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:20:17,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:20:17,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 660 transitions, 11795 flow. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-03-04 02:20:17,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:17,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:20:17,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:18,936 INFO L124 PetriNetUnfolderBase]: 4465/8233 cut-off events. [2025-03-04 02:20:18,936 INFO L125 PetriNetUnfolderBase]: For 113489/113489 co-relation queries the response was YES. [2025-03-04 02:20:18,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59674 conditions, 8233 events. 4465/8233 cut-off events. For 113489/113489 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 61946 event pairs, 386 based on Foata normal form. 32/8264 useless extension candidates. Maximal degree in co-relation 59093. Up to 3296 conditions per place. [2025-03-04 02:20:18,998 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 556 selfloop transitions, 492 changer transitions 5/1056 dead transitions. [2025-03-04 02:20:18,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 1056 transitions, 20343 flow [2025-03-04 02:20:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:20:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:20:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 159 transitions. [2025-03-04 02:20:18,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5678571428571428 [2025-03-04 02:20:18,999 INFO L175 Difference]: Start difference. First operand has 156 places, 660 transitions, 11795 flow. Second operand 14 states and 159 transitions. [2025-03-04 02:20:18,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 1056 transitions, 20343 flow [2025-03-04 02:20:19,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 1056 transitions, 19694 flow, removed 317 selfloop flow, removed 3 redundant places. [2025-03-04 02:20:19,623 INFO L231 Difference]: Finished difference. Result has 170 places, 804 transitions, 15522 flow [2025-03-04 02:20:19,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=11226, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=354, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=15522, PETRI_PLACES=170, PETRI_TRANSITIONS=804} [2025-03-04 02:20:19,624 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 149 predicate places. [2025-03-04 02:20:19,624 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 804 transitions, 15522 flow [2025-03-04 02:20:19,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-03-04 02:20:19,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:19,624 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:19,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 02:20:19,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:19,825 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:19,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:19,825 INFO L85 PathProgramCache]: Analyzing trace with hash 724771796, now seen corresponding path program 5 times [2025-03-04 02:20:19,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:19,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663719173] [2025-03-04 02:20:19,825 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:19,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:19,830 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:20:19,836 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:19,836 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:19,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:20,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:20,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663719173] [2025-03-04 02:20:20,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663719173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:20,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848916877] [2025-03-04 02:20:20,065 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:20,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:20,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:20,073 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:20,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:20:20,120 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:20:20,146 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:20,146 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:20,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:20,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:20:20,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:20,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:20,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848916877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:20,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:20,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 16 [2025-03-04 02:20:20,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885490808] [2025-03-04 02:20:20,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:20,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:20:20,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:20,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:20:20,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:20:20,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:20:20,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 804 transitions, 15522 flow. Second operand has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 states have internal predecessors, (126), 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-03-04 02:20:20,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:20,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:20:20,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:23,441 INFO L124 PetriNetUnfolderBase]: 5160/9494 cut-off events. [2025-03-04 02:20:23,441 INFO L125 PetriNetUnfolderBase]: For 152647/152647 co-relation queries the response was YES. [2025-03-04 02:20:23,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73225 conditions, 9494 events. 5160/9494 cut-off events. For 152647/152647 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 73260 event pairs, 410 based on Foata normal form. 10/9503 useless extension candidates. Maximal degree in co-relation 70372. Up to 4792 conditions per place. [2025-03-04 02:20:23,526 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 442 selfloop transitions, 664 changer transitions 12/1121 dead transitions. [2025-03-04 02:20:23,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1121 transitions, 23487 flow [2025-03-04 02:20:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:20:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:20:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 237 transitions. [2025-03-04 02:20:23,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925 [2025-03-04 02:20:23,528 INFO L175 Difference]: Start difference. First operand has 170 places, 804 transitions, 15522 flow. Second operand 20 states and 237 transitions. [2025-03-04 02:20:23,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1121 transitions, 23487 flow [2025-03-04 02:20:24,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 1121 transitions, 23164 flow, removed 148 selfloop flow, removed 3 redundant places. [2025-03-04 02:20:24,594 INFO L231 Difference]: Finished difference. Result has 196 places, 1025 transitions, 22919 flow [2025-03-04 02:20:24,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=15293, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=463, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=22919, PETRI_PLACES=196, PETRI_TRANSITIONS=1025} [2025-03-04 02:20:24,595 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 175 predicate places. [2025-03-04 02:20:24,595 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 1025 transitions, 22919 flow [2025-03-04 02:20:24,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 17 states have internal predecessors, (126), 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-03-04 02:20:24,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:24,595 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:24,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 02:20:24,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 02:20:24,800 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:24,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash -52377803, now seen corresponding path program 6 times [2025-03-04 02:20:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436654705] [2025-03-04 02:20:24,801 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:24,806 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:20:24,812 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:24,813 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:20:24,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:24,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:24,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436654705] [2025-03-04 02:20:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436654705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:24,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098264299] [2025-03-04 02:20:24,857 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:24,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:24,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:24,859 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:24,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:20:24,887 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:20:24,898 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:24,898 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:20:24,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:24,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:20:24,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:24,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098264299] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:24,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:24,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 02:20:24,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104317457] [2025-03-04 02:20:24,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:24,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:24,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:24,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:24,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:20:24,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 1025 transitions, 22919 flow. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-03-04 02:20:24,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:24,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:20:24,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:27,925 INFO L124 PetriNetUnfolderBase]: 6044/10989 cut-off events. [2025-03-04 02:20:27,925 INFO L125 PetriNetUnfolderBase]: For 204147/204147 co-relation queries the response was YES. [2025-03-04 02:20:27,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92129 conditions, 10989 events. 6044/10989 cut-off events. For 204147/204147 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 86317 event pairs, 440 based on Foata normal form. 146/11134 useless extension candidates. Maximal degree in co-relation 88624. Up to 4523 conditions per place. [2025-03-04 02:20:28,041 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 789 selfloop transitions, 719 changer transitions 0/1511 dead transitions. [2025-03-04 02:20:28,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 1511 transitions, 34957 flow [2025-03-04 02:20:28,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:20:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:20:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 163 transitions. [2025-03-04 02:20:28,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5821428571428572 [2025-03-04 02:20:28,042 INFO L175 Difference]: Start difference. First operand has 196 places, 1025 transitions, 22919 flow. Second operand 14 states and 163 transitions. [2025-03-04 02:20:28,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 1511 transitions, 34957 flow [2025-03-04 02:20:29,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 1511 transitions, 33850 flow, removed 546 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:29,687 INFO L231 Difference]: Finished difference. Result has 213 places, 1218 transitions, 29449 flow [2025-03-04 02:20:29,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=21936, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1025, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=535, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=29449, PETRI_PLACES=213, PETRI_TRANSITIONS=1218} [2025-03-04 02:20:29,688 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 192 predicate places. [2025-03-04 02:20:29,688 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 1218 transitions, 29449 flow [2025-03-04 02:20:29,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-03-04 02:20:29,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:29,688 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:29,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 02:20:29,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 02:20:29,889 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:29,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:29,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1715388439, now seen corresponding path program 7 times [2025-03-04 02:20:29,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:29,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056374762] [2025-03-04 02:20:29,889 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:29,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:29,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:20:29,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:29,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:29,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:29,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:29,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056374762] [2025-03-04 02:20:29,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056374762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:29,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:29,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:29,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138773547] [2025-03-04 02:20:29,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:29,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:29,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:29,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:29,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:29,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:20:29,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 1218 transitions, 29449 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-03-04 02:20:29,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:29,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:20:29,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:33,244 INFO L124 PetriNetUnfolderBase]: 6046/11035 cut-off events. [2025-03-04 02:20:33,244 INFO L125 PetriNetUnfolderBase]: For 263347/263347 co-relation queries the response was YES. [2025-03-04 02:20:33,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101653 conditions, 11035 events. 6046/11035 cut-off events. For 263347/263347 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 87829 event pairs, 133 based on Foata normal form. 54/11088 useless extension candidates. Maximal degree in co-relation 98768. Up to 3257 conditions per place. [2025-03-04 02:20:33,342 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 992 selfloop transitions, 491 changer transitions 0/1486 dead transitions. [2025-03-04 02:20:33,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 1486 transitions, 35853 flow [2025-03-04 02:20:33,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:20:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:20:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2025-03-04 02:20:33,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 02:20:33,344 INFO L175 Difference]: Start difference. First operand has 213 places, 1218 transitions, 29449 flow. Second operand 7 states and 84 transitions. [2025-03-04 02:20:33,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 1486 transitions, 35853 flow [2025-03-04 02:20:35,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 1486 transitions, 35588 flow, removed 126 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:35,611 INFO L231 Difference]: Finished difference. Result has 221 places, 1221 transitions, 30959 flow [2025-03-04 02:20:35,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=28745, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=471, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=30959, PETRI_PLACES=221, PETRI_TRANSITIONS=1221} [2025-03-04 02:20:35,612 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 200 predicate places. [2025-03-04 02:20:35,612 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 1221 transitions, 30959 flow [2025-03-04 02:20:35,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-03-04 02:20:35,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:35,612 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:35,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:20:35,612 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:35,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:35,613 INFO L85 PathProgramCache]: Analyzing trace with hash -41133274, now seen corresponding path program 8 times [2025-03-04 02:20:35,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:35,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585371570] [2025-03-04 02:20:35,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:35,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:35,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:20:35,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:35,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:35,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:35,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:35,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585371570] [2025-03-04 02:20:35,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585371570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:35,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972866397] [2025-03-04 02:20:35,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:35,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:35,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:35,776 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:35,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:20:35,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:20:35,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:35,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:35,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:35,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:20:35,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:36,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972866397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:36,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:36,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 16 [2025-03-04 02:20:36,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136016272] [2025-03-04 02:20:36,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:36,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:20:36,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:36,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:20:36,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:20:36,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:20:36,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 1221 transitions, 30959 flow. Second operand has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 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-03-04 02:20:36,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:36,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:20:36,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:42,397 INFO L124 PetriNetUnfolderBase]: 8123/14990 cut-off events. [2025-03-04 02:20:42,397 INFO L125 PetriNetUnfolderBase]: For 419740/419740 co-relation queries the response was YES. [2025-03-04 02:20:42,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146463 conditions, 14990 events. 8123/14990 cut-off events. For 419740/419740 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 123652 event pairs, 624 based on Foata normal form. 44/15033 useless extension candidates. Maximal degree in co-relation 141719. Up to 6140 conditions per place. [2025-03-04 02:20:42,623 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 715 selfloop transitions, 1186 changer transitions 19/1923 dead transitions. [2025-03-04 02:20:42,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1923 transitions, 52611 flow [2025-03-04 02:20:42,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:20:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:20:42,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 301 transitions. [2025-03-04 02:20:42,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.602 [2025-03-04 02:20:42,624 INFO L175 Difference]: Start difference. First operand has 221 places, 1221 transitions, 30959 flow. Second operand 25 states and 301 transitions. [2025-03-04 02:20:42,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 1923 transitions, 52611 flow [2025-03-04 02:20:46,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 1923 transitions, 52074 flow, removed 20 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:46,540 INFO L231 Difference]: Finished difference. Result has 259 places, 1742 transitions, 50228 flow [2025-03-04 02:20:46,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=30660, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=760, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=50228, PETRI_PLACES=259, PETRI_TRANSITIONS=1742} [2025-03-04 02:20:46,541 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 238 predicate places. [2025-03-04 02:20:46,541 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 1742 transitions, 50228 flow [2025-03-04 02:20:46,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 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-03-04 02:20:46,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:46,542 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:46,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:46,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:20:46,743 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:46,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash -202017758, now seen corresponding path program 9 times [2025-03-04 02:20:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:46,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775250593] [2025-03-04 02:20:46,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:46,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:20:46,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:46,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:46,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:46,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:46,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775250593] [2025-03-04 02:20:46,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775250593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:46,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626269926] [2025-03-04 02:20:46,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:46,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:46,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:46,869 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:46,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:20:46,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:20:46,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:20:46,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:46,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:46,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:20:46,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:47,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626269926] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:47,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:47,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 16 [2025-03-04 02:20:47,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555433049] [2025-03-04 02:20:47,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:47,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:20:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:47,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:20:47,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:20:47,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:20:47,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 1742 transitions, 50228 flow. Second operand has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 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-03-04 02:20:47,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:47,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:20:47,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:57,166 INFO L124 PetriNetUnfolderBase]: 11198/20695 cut-off events. [2025-03-04 02:20:57,166 INFO L125 PetriNetUnfolderBase]: For 696829/696829 co-relation queries the response was YES. [2025-03-04 02:20:57,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219633 conditions, 20695 events. 11198/20695 cut-off events. For 696829/696829 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 177265 event pairs, 967 based on Foata normal form. 29/20723 useless extension candidates. Maximal degree in co-relation 213962. Up to 8875 conditions per place. [2025-03-04 02:20:57,505 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 849 selfloop transitions, 1893 changer transitions 27/2772 dead transitions. [2025-03-04 02:20:57,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 2772 transitions, 86674 flow [2025-03-04 02:20:57,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 02:20:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 02:20:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 378 transitions. [2025-03-04 02:20:57,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2025-03-04 02:20:57,506 INFO L175 Difference]: Start difference. First operand has 259 places, 1742 transitions, 50228 flow. Second operand 33 states and 378 transitions. [2025-03-04 02:20:57,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 2772 transitions, 86674 flow [2025-03-04 02:21:05,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 2772 transitions, 81728 flow, removed 2362 selfloop flow, removed 4 redundant places. [2025-03-04 02:21:05,481 INFO L231 Difference]: Finished difference. Result has 308 places, 2591 transitions, 81257 flow [2025-03-04 02:21:05,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=47665, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=81257, PETRI_PLACES=308, PETRI_TRANSITIONS=2591} [2025-03-04 02:21:05,483 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 287 predicate places. [2025-03-04 02:21:05,483 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 2591 transitions, 81257 flow [2025-03-04 02:21:05,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 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-03-04 02:21:05,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:05,484 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:21:05,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 02:21:05,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 02:21:05,684 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:21:05,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:05,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1132692169, now seen corresponding path program 10 times [2025-03-04 02:21:05,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:05,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222154387] [2025-03-04 02:21:05,685 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:21:05,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:05,687 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:21:05,690 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:21:05,690 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:21:05,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:21:05,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:05,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222154387] [2025-03-04 02:21:05,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222154387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:05,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121610457] [2025-03-04 02:21:05,722 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:21:05,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:05,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:05,724 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:05,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:21:05,757 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:21:05,768 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:21:05,768 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:21:05,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:05,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:21:05,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:21:05,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:21:05,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121610457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:05,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:05,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 02:21:05,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765859711] [2025-03-04 02:21:05,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:05,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:21:05,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:05,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:21:05,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:21:05,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:21:05,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 2591 transitions, 81257 flow. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:05,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:05,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:21:05,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:18,525 INFO L124 PetriNetUnfolderBase]: 11342/20658 cut-off events. [2025-03-04 02:21:18,525 INFO L125 PetriNetUnfolderBase]: For 766402/766402 co-relation queries the response was YES. [2025-03-04 02:21:18,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229250 conditions, 20658 events. 11342/20658 cut-off events. For 766402/766402 co-relation queries the response was YES. Maximal size of possible extension queue 1222. Compared 173346 event pairs, 968 based on Foata normal form. 995/21652 useless extension candidates. Maximal degree in co-relation 226681. Up to 16986 conditions per place. [2025-03-04 02:21:18,851 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 2465 selfloop transitions, 483 changer transitions 0/2951 dead transitions. [2025-03-04 02:21:18,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 2951 transitions, 95955 flow [2025-03-04 02:21:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:21:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:21:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 158 transitions. [2025-03-04 02:21:18,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076923076923076 [2025-03-04 02:21:18,853 INFO L175 Difference]: Start difference. First operand has 308 places, 2591 transitions, 81257 flow. Second operand 13 states and 158 transitions. [2025-03-04 02:21:18,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 2951 transitions, 95955 flow [2025-03-04 02:21:29,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 2951 transitions, 90844 flow, removed 2548 selfloop flow, removed 3 redundant places. [2025-03-04 02:21:29,421 INFO L231 Difference]: Finished difference. Result has 324 places, 2786 transitions, 83570 flow [2025-03-04 02:21:29,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=73669, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=83570, PETRI_PLACES=324, PETRI_TRANSITIONS=2786} [2025-03-04 02:21:29,423 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 303 predicate places. [2025-03-04 02:21:29,423 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 2786 transitions, 83570 flow [2025-03-04 02:21:29,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:29,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:29,424 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:21:29,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 02:21:29,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:29,624 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:21:29,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1669807198, now seen corresponding path program 11 times [2025-03-04 02:21:29,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:29,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319446972] [2025-03-04 02:21:29,625 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:21:29,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:29,627 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-03-04 02:21:29,627 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 20 statements. [2025-03-04 02:21:29,628 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:21:29,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:21:29,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:29,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319446972] [2025-03-04 02:21:29,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319446972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:29,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817083453] [2025-03-04 02:21:29,641 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:21:29,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:29,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:29,644 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:29,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:21:29,674 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-03-04 02:21:29,677 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 20 statements. [2025-03-04 02:21:29,677 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:21:29,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:29,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:21:29,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:21:29,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:21:29,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817083453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:29,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:29,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-04 02:21:29,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500657719] [2025-03-04 02:21:29,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:29,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:21:29,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:29,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:21:29,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:21:29,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2025-03-04 02:21:29,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 2786 transitions, 83570 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:29,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:29,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2025-03-04 02:21:29,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand