./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/parallel-misc-2.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 c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:32:02,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:32:02,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:32:02,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:32:02,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:32:02,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:32:02,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:32:02,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:32:02,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:32:02,205 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:32:02,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:32:02,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:32:02,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:32:02,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:32:02,206 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:32:02,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:32:02,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:32:02,206 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:32:02,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:32:02,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:32:02,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:32:02,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:32:02,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:32:02,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:32:02,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:32:02,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:32:02,207 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:32:02,207 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:32:02,207 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:32:02,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:32:02,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:32:02,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:32:02,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:32:02,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:32:02,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:32:02,208 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:32:02,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:32:02,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:32:02,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:32:02,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:32:02,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:32:02,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:32:02,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:32:02,208 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf [2025-03-08 17:32:02,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:32:02,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:32:02,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:32:02,411 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:32:02,411 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:32:02,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-03-08 17:32:03,527 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256c067f8/731baab3c09343a8a2581aa3e5408cc0/FLAGe5fe49b0c [2025-03-08 17:32:03,759 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:32:03,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-03-08 17:32:03,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256c067f8/731baab3c09343a8a2581aa3e5408cc0/FLAGe5fe49b0c [2025-03-08 17:32:04,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256c067f8/731baab3c09343a8a2581aa3e5408cc0 [2025-03-08 17:32:04,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:32:04,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:32:04,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:32:04,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:32:04,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:32:04,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264b7190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04, skipping insertion in model container [2025-03-08 17:32:04,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:32:04,224 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/parallel-misc-2.wvr.c[2249,2262] [2025-03-08 17:32:04,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:32:04,233 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:32:04,249 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/parallel-misc-2.wvr.c[2249,2262] [2025-03-08 17:32:04,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:32:04,260 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:32:04,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04 WrapperNode [2025-03-08 17:32:04,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:32:04,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:32:04,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:32:04,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:32:04,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,279 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-03-08 17:32:04,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:32:04,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:32:04,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:32:04,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:32:04,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,295 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-08 17:32:04,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:32:04,302 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:32:04,302 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:32:04,302 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:32:04,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (1/1) ... [2025-03-08 17:32:04,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:32:04,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:04,331 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-08 17:32:04,333 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-08 17:32:04,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:32:04,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:32:04,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:32:04,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:32:04,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:32:04,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:32:04,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:32:04,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:32:04,348 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:32:04,411 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:32:04,413 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:32:04,545 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:32:04,545 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:32:04,663 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:32:04,664 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:32:04,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:04 BoogieIcfgContainer [2025-03-08 17:32:04,664 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:32:04,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:32:04,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:32:04,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:32:04,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:32:04" (1/3) ... [2025-03-08 17:32:04,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e05a5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:04, skipping insertion in model container [2025-03-08 17:32:04,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:04" (2/3) ... [2025-03-08 17:32:04,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e05a5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:04, skipping insertion in model container [2025-03-08 17:32:04,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:04" (3/3) ... [2025-03-08 17:32:04,671 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-03-08 17:32:04,682 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:32:04,683 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 29 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 17:32:04,683 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:32:04,718 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 17:32:04,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 78 flow [2025-03-08 17:32:04,761 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-08 17:32:04,762 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:32:04,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 4/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-08 17:32:04,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 78 flow [2025-03-08 17:32:04,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 29 transitions, 70 flow [2025-03-08 17:32:04,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:32:04,780 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;@5bcea565, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:32:04,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 17:32:04,786 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:32:04,787 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-08 17:32:04,787 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:32:04,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:04,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:04,788 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-08 17:32:04,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:04,791 INFO L85 PathProgramCache]: Analyzing trace with hash -123945489, now seen corresponding path program 1 times [2025-03-08 17:32:04,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:04,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727302449] [2025-03-08 17:32:04,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:04,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:04,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:32:04,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:32:04,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:04,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:05,042 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-08 17:32:05,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:05,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727302449] [2025-03-08 17:32:05,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727302449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:05,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:05,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:32:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911870512] [2025-03-08 17:32:05,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:05,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:32:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:05,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:32:05,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:32:05,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-03-08 17:32:05,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-08 17:32:05,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:05,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-03-08 17:32:05,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:05,189 INFO L124 PetriNetUnfolderBase]: 146/286 cut-off events. [2025-03-08 17:32:05,189 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-08 17:32:05,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 286 events. 146/286 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1140 event pairs, 12 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 458. Up to 186 conditions per place. [2025-03-08 17:32:05,196 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 21 selfloop transitions, 7 changer transitions 1/40 dead transitions. [2025-03-08 17:32:05,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 159 flow [2025-03-08 17:32:05,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:32:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:32:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-08 17:32:05,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-08 17:32:05,207 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 70 flow. Second operand 3 states and 69 transitions. [2025-03-08 17:32:05,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 159 flow [2025-03-08 17:32:05,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 17:32:05,212 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 101 flow [2025-03-08 17:32:05,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2025-03-08 17:32:05,216 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2025-03-08 17:32:05,216 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 101 flow [2025-03-08 17:32:05,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-08 17:32:05,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:05,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:05,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:32:05,217 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-08 17:32:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1666846895, now seen corresponding path program 1 times [2025-03-08 17:32:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014009854] [2025-03-08 17:32:05,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:05,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:32:05,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:32:05,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:05,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:05,351 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-08 17:32:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014009854] [2025-03-08 17:32:05,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014009854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:05,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:05,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:32:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888332656] [2025-03-08 17:32:05,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:05,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:05,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:05,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:05,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:05,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-08 17:32:05,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:05,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:05,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-08 17:32:05,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:05,497 INFO L124 PetriNetUnfolderBase]: 225/415 cut-off events. [2025-03-08 17:32:05,498 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-03-08 17:32:05,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 415 events. 225/415 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1866 event pairs, 26 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 322. Up to 182 conditions per place. [2025-03-08 17:32:05,501 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 45 selfloop transitions, 10 changer transitions 5/69 dead transitions. [2025-03-08 17:32:05,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 69 transitions, 326 flow [2025-03-08 17:32:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:32:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:32:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-08 17:32:05,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-03-08 17:32:05,502 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 101 flow. Second operand 5 states and 110 transitions. [2025-03-08 17:32:05,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 69 transitions, 326 flow [2025-03-08 17:32:05,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 69 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:05,504 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 155 flow [2025-03-08 17:32:05,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2025-03-08 17:32:05,504 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2025-03-08 17:32:05,505 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 155 flow [2025-03-08 17:32:05,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:05,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:05,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:05,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:32:05,505 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-08 17:32:05,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash -651606797, now seen corresponding path program 2 times [2025-03-08 17:32:05,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:05,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783723352] [2025-03-08 17:32:05,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:32:05,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:05,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:32:05,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:32:05,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:32:05,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:05,612 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-08 17:32:05,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:05,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783723352] [2025-03-08 17:32:05,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783723352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:05,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:05,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:32:05,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852361494] [2025-03-08 17:32:05,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:05,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:05,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:05,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:05,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-08 17:32:05,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:05,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:05,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-08 17:32:05,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:05,762 INFO L124 PetriNetUnfolderBase]: 213/424 cut-off events. [2025-03-08 17:32:05,762 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-03-08 17:32:05,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 424 events. 213/424 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1946 event pairs, 12 based on Foata normal form. 12/404 useless extension candidates. Maximal degree in co-relation 393. Up to 112 conditions per place. [2025-03-08 17:32:05,767 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 44 selfloop transitions, 12 changer transitions 4/69 dead transitions. [2025-03-08 17:32:05,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 69 transitions, 382 flow [2025-03-08 17:32:05,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:32:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:32:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-08 17:32:05,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-03-08 17:32:05,768 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 155 flow. Second operand 5 states and 107 transitions. [2025-03-08 17:32:05,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 69 transitions, 382 flow [2025-03-08 17:32:05,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 69 transitions, 382 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:05,773 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 241 flow [2025-03-08 17:32:05,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2025-03-08 17:32:05,774 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2025-03-08 17:32:05,774 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 241 flow [2025-03-08 17:32:05,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:05,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:05,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:05,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:32:05,774 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-08 17:32:05,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1067980211, now seen corresponding path program 1 times [2025-03-08 17:32:05,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:05,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043953149] [2025-03-08 17:32:05,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:05,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 17:32:05,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:32:05,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:05,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:05,852 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-08 17:32:05,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043953149] [2025-03-08 17:32:05,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043953149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:05,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:05,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:32:05,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653775986] [2025-03-08 17:32:05,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:05,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:05,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:05,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:05,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:05,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-08 17:32:05,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:05,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:05,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-08 17:32:05,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:05,964 INFO L124 PetriNetUnfolderBase]: 212/413 cut-off events. [2025-03-08 17:32:05,964 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-03-08 17:32:05,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 413 events. 212/413 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1937 event pairs, 22 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 668. Up to 191 conditions per place. [2025-03-08 17:32:05,967 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 52 selfloop transitions, 9 changer transitions 2/72 dead transitions. [2025-03-08 17:32:05,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 482 flow [2025-03-08 17:32:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:32:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:32:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-03-08 17:32:05,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-03-08 17:32:05,968 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 241 flow. Second operand 5 states and 106 transitions. [2025-03-08 17:32:05,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 482 flow [2025-03-08 17:32:05,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 478 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:05,975 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 292 flow [2025-03-08 17:32:05,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-03-08 17:32:05,976 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2025-03-08 17:32:05,976 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 292 flow [2025-03-08 17:32:05,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:05,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:05,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:05,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:32:05,976 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-08 17:32:05,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:05,977 INFO L85 PathProgramCache]: Analyzing trace with hash -465607505, now seen corresponding path program 2 times [2025-03-08 17:32:05,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:05,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897241299] [2025-03-08 17:32:05,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:32:05,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:05,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-03-08 17:32:05,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:32:05,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:32:05,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:06,033 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-08 17:32:06,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:06,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897241299] [2025-03-08 17:32:06,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897241299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:06,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:06,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:32:06,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579883912] [2025-03-08 17:32:06,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:06,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:06,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:06,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:06,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:06,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-08 17:32:06,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:06,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:06,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-08 17:32:06,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:06,149 INFO L124 PetriNetUnfolderBase]: 201/418 cut-off events. [2025-03-08 17:32:06,150 INFO L125 PetriNetUnfolderBase]: For 835/835 co-relation queries the response was YES. [2025-03-08 17:32:06,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 418 events. 201/418 cut-off events. For 835/835 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1834 event pairs, 10 based on Foata normal form. 17/401 useless extension candidates. Maximal degree in co-relation 896. Up to 117 conditions per place. [2025-03-08 17:32:06,153 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 50 selfloop transitions, 12 changer transitions 1/72 dead transitions. [2025-03-08 17:32:06,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 534 flow [2025-03-08 17:32:06,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:32:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:32:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-03-08 17:32:06,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64375 [2025-03-08 17:32:06,154 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 292 flow. Second operand 5 states and 103 transitions. [2025-03-08 17:32:06,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 534 flow [2025-03-08 17:32:06,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 518 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:06,157 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 355 flow [2025-03-08 17:32:06,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-03-08 17:32:06,160 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2025-03-08 17:32:06,161 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 355 flow [2025-03-08 17:32:06,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:32:06,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:06,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:06,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:32:06,163 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-08 17:32:06,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1065239863, now seen corresponding path program 1 times [2025-03-08 17:32:06,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:06,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142412540] [2025-03-08 17:32:06,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:06,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:32:06,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:32:06,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:06,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:06,385 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-08 17:32:06,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:06,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142412540] [2025-03-08 17:32:06,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142412540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:06,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:06,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:32:06,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306848441] [2025-03-08 17:32:06,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:06,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:32:06,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:06,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:32:06,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:32:06,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-08 17:32:06,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-08 17:32:06,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:06,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-08 17:32:06,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:06,545 INFO L124 PetriNetUnfolderBase]: 251/511 cut-off events. [2025-03-08 17:32:06,545 INFO L125 PetriNetUnfolderBase]: For 1446/1494 co-relation queries the response was YES. [2025-03-08 17:32:06,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 511 events. 251/511 cut-off events. For 1446/1494 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2388 event pairs, 14 based on Foata normal form. 20/470 useless extension candidates. Maximal degree in co-relation 712. Up to 163 conditions per place. [2025-03-08 17:32:06,550 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 47 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2025-03-08 17:32:06,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 694 flow [2025-03-08 17:32:06,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:32:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:32:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-03-08 17:32:06,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-03-08 17:32:06,552 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 355 flow. Second operand 6 states and 123 transitions. [2025-03-08 17:32:06,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 694 flow [2025-03-08 17:32:06,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 679 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:06,557 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 490 flow [2025-03-08 17:32:06,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2025-03-08 17:32:06,558 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2025-03-08 17:32:06,558 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 490 flow [2025-03-08 17:32:06,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-08 17:32:06,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:06,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:06,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:32:06,559 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-08 17:32:06,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1321531165, now seen corresponding path program 2 times [2025-03-08 17:32:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:06,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636328044] [2025-03-08 17:32:06,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:32:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:06,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-08 17:32:06,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 24 statements. [2025-03-08 17:32:06,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:32:06,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:32:06,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:06,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636328044] [2025-03-08 17:32:06,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636328044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:06,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:06,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:32:06,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438260410] [2025-03-08 17:32:06,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:06,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:32:06,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:06,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:32:06,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:32:06,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-03-08 17:32:06,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-08 17:32:06,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:06,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-03-08 17:32:06,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:06,783 INFO L124 PetriNetUnfolderBase]: 299/616 cut-off events. [2025-03-08 17:32:06,784 INFO L125 PetriNetUnfolderBase]: For 2110/2158 co-relation queries the response was YES. [2025-03-08 17:32:06,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2278 conditions, 616 events. 299/616 cut-off events. For 2110/2158 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2969 event pairs, 32 based on Foata normal form. 8/554 useless extension candidates. Maximal degree in co-relation 928. Up to 172 conditions per place. [2025-03-08 17:32:06,788 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 56 selfloop transitions, 17 changer transitions 0/87 dead transitions. [2025-03-08 17:32:06,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 812 flow [2025-03-08 17:32:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:32:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:32:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-03-08 17:32:06,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-03-08 17:32:06,790 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 490 flow. Second operand 5 states and 106 transitions. [2025-03-08 17:32:06,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 812 flow [2025-03-08 17:32:06,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 799 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:06,798 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 589 flow [2025-03-08 17:32:06,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=589, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-03-08 17:32:06,799 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2025-03-08 17:32:06,800 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 589 flow [2025-03-08 17:32:06,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-08 17:32:06,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:06,800 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:06,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:32:06,800 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-08 17:32:06,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:06,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1258490189, now seen corresponding path program 3 times [2025-03-08 17:32:06,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:06,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200373178] [2025-03-08 17:32:06,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:32:06,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:06,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:32:06,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 29 statements. [2025-03-08 17:32:06,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:32:06,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:32:06,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:06,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200373178] [2025-03-08 17:32:06,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200373178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:06,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:06,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:32:06,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283303250] [2025-03-08 17:32:06,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:06,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:32:06,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:06,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:32:06,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:32:06,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-08 17:32:06,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 589 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-08 17:32:06,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:06,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-08 17:32:06,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:07,149 INFO L124 PetriNetUnfolderBase]: 419/807 cut-off events. [2025-03-08 17:32:07,149 INFO L125 PetriNetUnfolderBase]: For 3730/3730 co-relation queries the response was YES. [2025-03-08 17:32:07,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 807 events. 419/807 cut-off events. For 3730/3730 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3894 event pairs, 31 based on Foata normal form. 19/772 useless extension candidates. Maximal degree in co-relation 2024. Up to 268 conditions per place. [2025-03-08 17:32:07,155 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 67 selfloop transitions, 22 changer transitions 0/98 dead transitions. [2025-03-08 17:32:07,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 98 transitions, 1054 flow [2025-03-08 17:32:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:32:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:32:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-03-08 17:32:07,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2025-03-08 17:32:07,156 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 589 flow. Second operand 7 states and 134 transitions. [2025-03-08 17:32:07,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 98 transitions, 1054 flow [2025-03-08 17:32:07,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 98 transitions, 1020 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:07,166 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 693 flow [2025-03-08 17:32:07,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=693, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-03-08 17:32:07,167 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2025-03-08 17:32:07,168 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 693 flow [2025-03-08 17:32:07,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-08 17:32:07,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:07,169 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:07,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:32:07,169 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-08 17:32:07,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1517696591, now seen corresponding path program 4 times [2025-03-08 17:32:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864137659] [2025-03-08 17:32:07,169 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:32:07,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:07,177 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:32:07,186 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:32:07,187 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:32:07,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:07,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:07,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864137659] [2025-03-08 17:32:07,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864137659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:07,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:07,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:32:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585004193] [2025-03-08 17:32:07,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:07,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:07,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:07,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:07,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:07,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-08 17:32:07,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 693 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-08 17:32:07,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:07,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-08 17:32:07,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:07,471 INFO L124 PetriNetUnfolderBase]: 572/1133 cut-off events. [2025-03-08 17:32:07,472 INFO L125 PetriNetUnfolderBase]: For 5997/6044 co-relation queries the response was YES. [2025-03-08 17:32:07,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 1133 events. 572/1133 cut-off events. For 5997/6044 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6083 event pairs, 57 based on Foata normal form. 5/1048 useless extension candidates. Maximal degree in co-relation 2768. Up to 405 conditions per place. [2025-03-08 17:32:07,482 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 65 selfloop transitions, 24 changer transitions 0/113 dead transitions. [2025-03-08 17:32:07,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 113 transitions, 1333 flow [2025-03-08 17:32:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:32:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:32:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-08 17:32:07,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2025-03-08 17:32:07,484 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 693 flow. Second operand 4 states and 87 transitions. [2025-03-08 17:32:07,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 113 transitions, 1333 flow [2025-03-08 17:32:07,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 113 transitions, 1311 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-08 17:32:07,498 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 943 flow [2025-03-08 17:32:07,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=943, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2025-03-08 17:32:07,499 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2025-03-08 17:32:07,499 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 943 flow [2025-03-08 17:32:07,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-08 17:32:07,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:07,500 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:07,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:32:07,500 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-08 17:32:07,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1088200312, now seen corresponding path program 1 times [2025-03-08 17:32:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:07,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488999950] [2025-03-08 17:32:07,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:07,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:07,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:32:07,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:32:07,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:07,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:32:07,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:07,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488999950] [2025-03-08 17:32:07,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488999950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:07,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:07,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:32:07,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465829990] [2025-03-08 17:32:07,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:07,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:32:07,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:07,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:32:07,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:32:07,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-08 17:32:07,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 943 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-08 17:32:07,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:07,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-08 17:32:07,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:07,834 INFO L124 PetriNetUnfolderBase]: 840/1613 cut-off events. [2025-03-08 17:32:07,836 INFO L125 PetriNetUnfolderBase]: For 11970/11970 co-relation queries the response was YES. [2025-03-08 17:32:07,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7590 conditions, 1613 events. 840/1613 cut-off events. For 11970/11970 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9207 event pairs, 76 based on Foata normal form. 30/1552 useless extension candidates. Maximal degree in co-relation 4294. Up to 552 conditions per place. [2025-03-08 17:32:07,848 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 97 selfloop transitions, 13 changer transitions 0/121 dead transitions. [2025-03-08 17:32:07,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 121 transitions, 1599 flow [2025-03-08 17:32:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:32:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:32:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-03-08 17:32:07,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64375 [2025-03-08 17:32:07,849 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 943 flow. Second operand 5 states and 103 transitions. [2025-03-08 17:32:07,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 121 transitions, 1599 flow [2025-03-08 17:32:07,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 121 transitions, 1599 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:07,862 INFO L231 Difference]: Finished difference. Result has 83 places, 85 transitions, 1055 flow [2025-03-08 17:32:07,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1055, PETRI_PLACES=83, PETRI_TRANSITIONS=85} [2025-03-08 17:32:07,863 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2025-03-08 17:32:07,864 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 85 transitions, 1055 flow [2025-03-08 17:32:07,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-08 17:32:07,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:07,864 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:07,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:32:07,864 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-08 17:32:07,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1301337218, now seen corresponding path program 2 times [2025-03-08 17:32:07,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:07,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071205264] [2025-03-08 17:32:07,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:32:07,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:07,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-08 17:32:07,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:32:07,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:07,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:32:07,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071205264] [2025-03-08 17:32:07,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071205264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:07,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:07,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:32:07,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550507190] [2025-03-08 17:32:07,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:07,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:32:07,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:07,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:32:07,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:32:07,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-08 17:32:07,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 85 transitions, 1055 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-08 17:32:07,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:07,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-08 17:32:07,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:08,255 INFO L124 PetriNetUnfolderBase]: 1339/2615 cut-off events. [2025-03-08 17:32:08,255 INFO L125 PetriNetUnfolderBase]: For 23548/23672 co-relation queries the response was YES. [2025-03-08 17:32:08,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13161 conditions, 2615 events. 1339/2615 cut-off events. For 23548/23672 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 17998 event pairs, 248 based on Foata normal form. 28/2513 useless extension candidates. Maximal degree in co-relation 6740. Up to 1023 conditions per place. [2025-03-08 17:32:08,272 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 87 selfloop transitions, 30 changer transitions 0/143 dead transitions. [2025-03-08 17:32:08,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 143 transitions, 2125 flow [2025-03-08 17:32:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:32:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:32:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-03-08 17:32:08,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-08 17:32:08,273 INFO L175 Difference]: Start difference. First operand has 83 places, 85 transitions, 1055 flow. Second operand 4 states and 84 transitions. [2025-03-08 17:32:08,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 143 transitions, 2125 flow [2025-03-08 17:32:08,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 143 transitions, 2118 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:08,295 INFO L231 Difference]: Finished difference. Result has 88 places, 100 transitions, 1396 flow [2025-03-08 17:32:08,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1396, PETRI_PLACES=88, PETRI_TRANSITIONS=100} [2025-03-08 17:32:08,295 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2025-03-08 17:32:08,295 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 100 transitions, 1396 flow [2025-03-08 17:32:08,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-08 17:32:08,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:08,296 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:08,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:32:08,296 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-08 17:32:08,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1805401978, now seen corresponding path program 1 times [2025-03-08 17:32:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:08,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653622927] [2025-03-08 17:32:08,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:08,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:08,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 17:32:08,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:32:08,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:08,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:08,411 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-08 17:32:08,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:08,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653622927] [2025-03-08 17:32:08,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653622927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:08,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494025807] [2025-03-08 17:32:08,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:32:08,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:08,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:08,414 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-08 17:32:08,416 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-08 17:32:08,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 17:32:08,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:32:08,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:08,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:08,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 17:32:08,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:08,566 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-08 17:32:08,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:08,654 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-08 17:32:08,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494025807] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:08,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:08,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-08 17:32:08,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31544817] [2025-03-08 17:32:08,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:08,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:32:08,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:08,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:32:08,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:32:08,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-03-08 17:32:08,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 100 transitions, 1396 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-08 17:32:08,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:08,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-03-08 17:32:08,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:09,031 INFO L124 PetriNetUnfolderBase]: 1675/3618 cut-off events. [2025-03-08 17:32:09,031 INFO L125 PetriNetUnfolderBase]: For 39696/39852 co-relation queries the response was YES. [2025-03-08 17:32:09,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19910 conditions, 3618 events. 1675/3618 cut-off events. For 39696/39852 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 27379 event pairs, 332 based on Foata normal form. 24/3543 useless extension candidates. Maximal degree in co-relation 8775. Up to 1633 conditions per place. [2025-03-08 17:32:09,094 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 144 selfloop transitions, 20 changer transitions 1/195 dead transitions. [2025-03-08 17:32:09,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 195 transitions, 3129 flow [2025-03-08 17:32:09,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:32:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:32:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-03-08 17:32:09,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7625 [2025-03-08 17:32:09,095 INFO L175 Difference]: Start difference. First operand has 88 places, 100 transitions, 1396 flow. Second operand 5 states and 122 transitions. [2025-03-08 17:32:09,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 195 transitions, 3129 flow [2025-03-08 17:32:09,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 195 transitions, 3129 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:09,123 INFO L231 Difference]: Finished difference. Result has 93 places, 111 transitions, 1505 flow [2025-03-08 17:32:09,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1505, PETRI_PLACES=93, PETRI_TRANSITIONS=111} [2025-03-08 17:32:09,124 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 61 predicate places. [2025-03-08 17:32:09,124 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 111 transitions, 1505 flow [2025-03-08 17:32:09,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-08 17:32:09,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:09,125 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:09,131 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-08 17:32:09,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 17:32:09,329 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-08 17:32:09,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:09,330 INFO L85 PathProgramCache]: Analyzing trace with hash 487767274, now seen corresponding path program 2 times [2025-03-08 17:32:09,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:09,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741290952] [2025-03-08 17:32:09,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:32:09,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:09,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-08 17:32:09,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:32:09,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:09,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:09,494 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-08 17:32:09,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741290952] [2025-03-08 17:32:09,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741290952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22981298] [2025-03-08 17:32:09,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:32:09,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:09,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:09,497 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-08 17:32:09,498 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-08 17:32:09,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-08 17:32:09,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:32:09,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:09,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:09,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 17:32:09,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:09,615 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-08 17:32:09,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:09,684 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-08 17:32:09,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22981298] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:09,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:09,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-08 17:32:09,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986904738] [2025-03-08 17:32:09,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:09,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:32:09,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:09,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:32:09,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:32:09,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-03-08 17:32:09,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 111 transitions, 1505 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-08 17:32:09,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:09,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-03-08 17:32:09,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:10,183 INFO L124 PetriNetUnfolderBase]: 1992/4331 cut-off events. [2025-03-08 17:32:10,183 INFO L125 PetriNetUnfolderBase]: For 50382/50674 co-relation queries the response was YES. [2025-03-08 17:32:10,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25240 conditions, 4331 events. 1992/4331 cut-off events. For 50382/50674 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 33924 event pairs, 391 based on Foata normal form. 67/4292 useless extension candidates. Maximal degree in co-relation 10471. Up to 1438 conditions per place. [2025-03-08 17:32:10,211 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 172 selfloop transitions, 28 changer transitions 1/231 dead transitions. [2025-03-08 17:32:10,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 231 transitions, 3796 flow [2025-03-08 17:32:10,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:32:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:32:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-08 17:32:10,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2025-03-08 17:32:10,212 INFO L175 Difference]: Start difference. First operand has 93 places, 111 transitions, 1505 flow. Second operand 6 states and 145 transitions. [2025-03-08 17:32:10,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 231 transitions, 3796 flow [2025-03-08 17:32:10,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 231 transitions, 3758 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:10,252 INFO L231 Difference]: Finished difference. Result has 99 places, 119 transitions, 1600 flow [2025-03-08 17:32:10,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1600, PETRI_PLACES=99, PETRI_TRANSITIONS=119} [2025-03-08 17:32:10,252 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2025-03-08 17:32:10,252 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 119 transitions, 1600 flow [2025-03-08 17:32:10,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-08 17:32:10,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:10,253 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:10,259 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-08 17:32:10,453 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,SelfDestructingSolverStorable12 [2025-03-08 17:32:10,453 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-08 17:32:10,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:10,454 INFO L85 PathProgramCache]: Analyzing trace with hash -852121092, now seen corresponding path program 3 times [2025-03-08 17:32:10,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:10,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162646000] [2025-03-08 17:32:10,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:32:10,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:10,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-03-08 17:32:10,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:32:10,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:32:10,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:10,576 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-08 17:32:10,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:10,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162646000] [2025-03-08 17:32:10,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162646000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:10,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200046182] [2025-03-08 17:32:10,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:32:10,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:10,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:10,580 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-08 17:32:10,580 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-08 17:32:10,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-03-08 17:32:10,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:32:10,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:32:10,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:10,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 17:32:10,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:10,685 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-08 17:32:10,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:10,747 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-08 17:32:10,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200046182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:10,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:10,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-08 17:32:10,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562514031] [2025-03-08 17:32:10,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:10,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:32:10,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:10,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:32:10,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:32:10,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-03-08 17:32:10,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 119 transitions, 1600 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-08 17:32:10,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:10,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-03-08 17:32:10,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:11,369 INFO L124 PetriNetUnfolderBase]: 2723/5963 cut-off events. [2025-03-08 17:32:11,369 INFO L125 PetriNetUnfolderBase]: For 71290/71548 co-relation queries the response was YES. [2025-03-08 17:32:11,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35341 conditions, 5963 events. 2723/5963 cut-off events. For 71290/71548 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 49733 event pairs, 463 based on Foata normal form. 43/5858 useless extension candidates. Maximal degree in co-relation 12251. Up to 2661 conditions per place. [2025-03-08 17:32:11,408 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 204 selfloop transitions, 29 changer transitions 1/264 dead transitions. [2025-03-08 17:32:11,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 264 transitions, 4307 flow [2025-03-08 17:32:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:32:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:32:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-03-08 17:32:11,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.765625 [2025-03-08 17:32:11,410 INFO L175 Difference]: Start difference. First operand has 99 places, 119 transitions, 1600 flow. Second operand 6 states and 147 transitions. [2025-03-08 17:32:11,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 264 transitions, 4307 flow [2025-03-08 17:32:11,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 264 transitions, 4241 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-03-08 17:32:11,457 INFO L231 Difference]: Finished difference. Result has 105 places, 138 transitions, 1772 flow [2025-03-08 17:32:11,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1571, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1772, PETRI_PLACES=105, PETRI_TRANSITIONS=138} [2025-03-08 17:32:11,458 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 73 predicate places. [2025-03-08 17:32:11,458 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 138 transitions, 1772 flow [2025-03-08 17:32:11,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-08 17:32:11,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:11,458 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:11,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 17:32:11,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:11,661 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-08 17:32:11,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1233407382, now seen corresponding path program 4 times [2025-03-08 17:32:11,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:11,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184959503] [2025-03-08 17:32:11,662 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:32:11,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:11,667 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-08 17:32:11,675 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:32:11,675 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:32:11,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:11,818 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-08 17:32:11,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:11,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184959503] [2025-03-08 17:32:11,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184959503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:11,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797142103] [2025-03-08 17:32:11,818 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:32:11,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:11,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:11,820 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-08 17:32:11,822 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-08 17:32:11,855 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-08 17:32:11,868 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:32:11,868 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:32:11,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:11,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 17:32:11,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:11,936 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-08 17:32:11,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:11,996 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-08 17:32:11,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797142103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:11,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:11,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-08 17:32:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440010514] [2025-03-08 17:32:11,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:11,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:32:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:11,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:32:11,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:32:11,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-03-08 17:32:11,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 138 transitions, 1772 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-08 17:32:11,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:11,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-03-08 17:32:11,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:12,757 INFO L124 PetriNetUnfolderBase]: 3200/7054 cut-off events. [2025-03-08 17:32:12,757 INFO L125 PetriNetUnfolderBase]: For 85299/85611 co-relation queries the response was YES. [2025-03-08 17:32:12,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42111 conditions, 7054 events. 3200/7054 cut-off events. For 85299/85611 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 60862 event pairs, 537 based on Foata normal form. 91/6982 useless extension candidates. Maximal degree in co-relation 19222. Up to 2695 conditions per place. [2025-03-08 17:32:12,815 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 206 selfloop transitions, 44 changer transitions 1/281 dead transitions. [2025-03-08 17:32:12,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 281 transitions, 4500 flow [2025-03-08 17:32:12,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:32:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:32:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-03-08 17:32:12,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.765625 [2025-03-08 17:32:12,816 INFO L175 Difference]: Start difference. First operand has 105 places, 138 transitions, 1772 flow. Second operand 6 states and 147 transitions. [2025-03-08 17:32:12,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 281 transitions, 4500 flow [2025-03-08 17:32:12,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 281 transitions, 4478 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:12,889 INFO L231 Difference]: Finished difference. Result has 113 places, 155 transitions, 2039 flow [2025-03-08 17:32:12,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2039, PETRI_PLACES=113, PETRI_TRANSITIONS=155} [2025-03-08 17:32:12,889 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 81 predicate places. [2025-03-08 17:32:12,889 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 155 transitions, 2039 flow [2025-03-08 17:32:12,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-08 17:32:12,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:12,890 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:12,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 17:32:13,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 17:32:13,094 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-08 17:32:13,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash -833794648, now seen corresponding path program 5 times [2025-03-08 17:32:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:13,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626472599] [2025-03-08 17:32:13,095 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:32:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:13,101 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-08 17:32:13,114 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:32:13,114 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:13,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:13,212 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-08 17:32:13,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:13,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626472599] [2025-03-08 17:32:13,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626472599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:13,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944919643] [2025-03-08 17:32:13,213 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:32:13,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:13,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:13,215 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-08 17:32:13,217 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-08 17:32:13,248 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-08 17:32:13,262 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:32:13,262 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:13,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:13,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 17:32:13,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:13,321 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-08 17:32:13,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:13,383 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-08 17:32:13,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944919643] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:13,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:13,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-08 17:32:13,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075156691] [2025-03-08 17:32:13,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:13,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:32:13,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:13,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:32:13,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:32:13,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-03-08 17:32:13,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 155 transitions, 2039 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-08 17:32:13,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:13,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-03-08 17:32:13,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:14,170 INFO L124 PetriNetUnfolderBase]: 3402/7569 cut-off events. [2025-03-08 17:32:14,170 INFO L125 PetriNetUnfolderBase]: For 95769/96103 co-relation queries the response was YES. [2025-03-08 17:32:14,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46503 conditions, 7569 events. 3402/7569 cut-off events. For 95769/96103 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 66524 event pairs, 678 based on Foata normal form. 103/7531 useless extension candidates. Maximal degree in co-relation 22042. Up to 3821 conditions per place. [2025-03-08 17:32:14,216 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 218 selfloop transitions, 33 changer transitions 1/282 dead transitions. [2025-03-08 17:32:14,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 282 transitions, 4518 flow [2025-03-08 17:32:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:32:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:32:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-08 17:32:14,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2025-03-08 17:32:14,217 INFO L175 Difference]: Start difference. First operand has 113 places, 155 transitions, 2039 flow. Second operand 6 states and 145 transitions. [2025-03-08 17:32:14,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 282 transitions, 4518 flow [2025-03-08 17:32:14,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 282 transitions, 4510 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-08 17:32:14,291 INFO L231 Difference]: Finished difference. Result has 121 places, 170 transitions, 2292 flow [2025-03-08 17:32:14,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2031, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2292, PETRI_PLACES=121, PETRI_TRANSITIONS=170} [2025-03-08 17:32:14,292 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 89 predicate places. [2025-03-08 17:32:14,292 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 170 transitions, 2292 flow [2025-03-08 17:32:14,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-08 17:32:14,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:14,292 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:14,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 17:32:14,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 17:32:14,493 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-08 17:32:14,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:14,494 INFO L85 PathProgramCache]: Analyzing trace with hash 987658096, now seen corresponding path program 6 times [2025-03-08 17:32:14,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:14,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597834884] [2025-03-08 17:32:14,494 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:32:14,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:14,498 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 3 equivalence classes. [2025-03-08 17:32:14,520 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 17:32:14,520 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 17:32:14,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:32:14,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:14,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597834884] [2025-03-08 17:32:14,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597834884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:14,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990835598] [2025-03-08 17:32:14,660 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:32:14,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:14,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:14,662 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-08 17:32:14,664 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-08 17:32:14,692 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 3 equivalence classes. [2025-03-08 17:32:14,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 17:32:14,740 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 17:32:14,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:14,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 17:32:14,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:15,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:15,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990835598] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:15,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:15,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-03-08 17:32:15,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971276368] [2025-03-08 17:32:15,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:15,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 17:32:15,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:15,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 17:32:15,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-08 17:32:15,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-08 17:32:15,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 170 transitions, 2292 flow. Second operand has 19 states, 19 states have (on average 14.68421052631579) internal successors, (279), 19 states have internal predecessors, (279), 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-08 17:32:15,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:15,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-08 17:32:15,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:18,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 17:32:23,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 17:32:29,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 17:32:31,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 17:32:39,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 17:32:49,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 17:33:03,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 17:33:05,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 17:33:14,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 17:33:16,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 17:33:32,695 INFO L124 PetriNetUnfolderBase]: 19607/39318 cut-off events. [2025-03-08 17:33:32,696 INFO L125 PetriNetUnfolderBase]: For 506351/506351 co-relation queries the response was YES. [2025-03-08 17:33:32,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245241 conditions, 39318 events. 19607/39318 cut-off events. For 506351/506351 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 386674 event pairs, 466 based on Foata normal form. 2006/41323 useless extension candidates. Maximal degree in co-relation 155107. Up to 7179 conditions per place. [2025-03-08 17:33:32,978 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1552 selfloop transitions, 326 changer transitions 1/1892 dead transitions. [2025-03-08 17:33:32,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1892 transitions, 25344 flow [2025-03-08 17:33:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-08 17:33:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-08 17:33:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 1095 transitions. [2025-03-08 17:33:32,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.600328947368421 [2025-03-08 17:33:32,981 INFO L175 Difference]: Start difference. First operand has 121 places, 170 transitions, 2292 flow. Second operand 57 states and 1095 transitions. [2025-03-08 17:33:32,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1892 transitions, 25344 flow [2025-03-08 17:33:33,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1892 transitions, 24829 flow, removed 231 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:33,608 INFO L231 Difference]: Finished difference. Result has 209 places, 468 transitions, 8900 flow [2025-03-08 17:33:33,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=8900, PETRI_PLACES=209, PETRI_TRANSITIONS=468} [2025-03-08 17:33:33,608 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2025-03-08 17:33:33,608 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 468 transitions, 8900 flow [2025-03-08 17:33:33,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.68421052631579) internal successors, (279), 19 states have internal predecessors, (279), 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-08 17:33:33,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:33,609 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:33,615 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-08 17:33:33,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 17:33:33,809 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-08 17:33:33,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:33,810 INFO L85 PathProgramCache]: Analyzing trace with hash -984368916, now seen corresponding path program 7 times [2025-03-08 17:33:33,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:33,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479663128] [2025-03-08 17:33:33,810 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:33:33,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:33,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 17:33:33,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 17:33:33,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:33,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:34,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:34,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479663128] [2025-03-08 17:33:34,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479663128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:34,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826258309] [2025-03-08 17:33:34,042 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:33:34,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:34,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:34,044 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-08 17:33:34,046 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-08 17:33:34,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 17:33:34,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 17:33:34,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:34,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:34,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 17:33:34,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:34,390 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-08 17:33:34,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:33:34,856 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-08 17:33:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826258309] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:33:34,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:33:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2025-03-08 17:33:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116728762] [2025-03-08 17:33:34,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:33:34,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 17:33:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:34,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 17:33:34,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-08 17:33:34,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-03-08 17:33:34,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 468 transitions, 8900 flow. Second operand has 21 states, 21 states have (on average 14.428571428571429) internal successors, (303), 21 states have internal predecessors, (303), 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-08 17:33:34,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:34,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-03-08 17:33:34,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:36,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []