./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/pthread/triangular-longer-2.i -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 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:26:12,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:26:12,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:26:12,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:26:12,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:26:12,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:26:12,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:26:12,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:26:12,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:26:12,553 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:26:12,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:26:12,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:26:12,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:26:12,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:26:12,554 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:26:12,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:26:12,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:26:12,554 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:26:12,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:26:12,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:26:12,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:26:12,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:26:12,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:26:12,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:26:12,555 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:26:12,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:26:12,555 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:26:12,555 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:26:12,555 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:26:12,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:26:12,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:26:12,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:26:12,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:26:12,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:26:12,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:26:12,555 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:26:12,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:26:12,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:26:12,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:26:12,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:26:12,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:26:12,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:26:12,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:26:12,556 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 -> 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 [2025-03-13 21:26:12,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:26:12,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:26:12,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:26:12,825 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:26:12,825 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:26:12,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longer-2.i [2025-03-13 21:26:14,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529c753a7/ed9c82cf9cab4d7695ce5cdc65c94e08/FLAG57ac36d5b [2025-03-13 21:26:14,517 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:26:14,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i [2025-03-13 21:26:14,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529c753a7/ed9c82cf9cab4d7695ce5cdc65c94e08/FLAG57ac36d5b [2025-03-13 21:26:14,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529c753a7/ed9c82cf9cab4d7695ce5cdc65c94e08 [2025-03-13 21:26:14,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:26:14,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:26:14,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:26:14,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:26:14,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:26:14,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14, skipping insertion in model container [2025-03-13 21:26:14,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:26:14,822 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/pthread/triangular-longer-2.i[30963,30976] [2025-03-13 21:26:14,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:26:14,833 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:26:14,861 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/pthread/triangular-longer-2.i[30963,30976] [2025-03-13 21:26:14,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:26:14,887 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:26:14,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14 WrapperNode [2025-03-13 21:26:14,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:26:14,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:26:14,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:26:14,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:26:14,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,914 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-03-13 21:26:14,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:26:14,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:26:14,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:26:14,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:26:14,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,931 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-13 21:26:14,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:26:14,941 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:26:14,941 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:26:14,941 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:26:14,942 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (1/1) ... [2025-03-13 21:26:14,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:26:14,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:14,967 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-13 21:26:14,974 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-13 21:26:14,986 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-13 21:26:14,986 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-13 21:26:14,986 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-13 21:26:14,986 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-13 21:26:14,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:26:14,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:26:14,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:26:14,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:26:14,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:26:14,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:26:14,987 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:26:15,079 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:26:15,081 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:26:15,199 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:26:15,200 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:26:15,200 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:26:15,307 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:26:15,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:15 BoogieIcfgContainer [2025-03-13 21:26:15,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:26:15,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:26:15,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:26:15,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:26:15,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:26:14" (1/3) ... [2025-03-13 21:26:15,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc058d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:26:15, skipping insertion in model container [2025-03-13 21:26:15,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:14" (2/3) ... [2025-03-13 21:26:15,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc058d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:26:15, skipping insertion in model container [2025-03-13 21:26:15,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:15" (3/3) ... [2025-03-13 21:26:15,318 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2025-03-13 21:26:15,329 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:26:15,330 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-2.i that has 3 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-13 21:26:15,330 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:26:15,365 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:26:15,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2025-03-13 21:26:15,416 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-03-13 21:26:15,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:26:15,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-03-13 21:26:15,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2025-03-13 21:26:15,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2025-03-13 21:26:15,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:26:15,443 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;@c90ac6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:26:15,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:26:15,451 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:26:15,452 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-13 21:26:15,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:26:15,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:15,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:15,455 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-13 21:26:15,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash 341173780, now seen corresponding path program 1 times [2025-03-13 21:26:15,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:15,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912251842] [2025-03-13 21:26:15,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:15,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:26:15,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:26:15,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:15,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:15,807 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-13 21:26:15,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:15,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912251842] [2025-03-13 21:26:15,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912251842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:15,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:15,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:26:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111917212] [2025-03-13 21:26:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:15,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:26:15,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:15,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:26:15,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:26:15,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:15,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:15,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:15,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:15,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:16,093 INFO L124 PetriNetUnfolderBase]: 385/645 cut-off events. [2025-03-13 21:26:16,094 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 21:26:16,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 645 events. 385/645 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2655 event pairs, 57 based on Foata normal form. 15/641 useless extension candidates. Maximal degree in co-relation 1249. Up to 303 conditions per place. [2025-03-13 21:26:16,101 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 29 selfloop transitions, 7 changer transitions 31/70 dead transitions. [2025-03-13 21:26:16,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 70 transitions, 283 flow [2025-03-13 21:26:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:26:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:26:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-03-13 21:26:16,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578125 [2025-03-13 21:26:16,115 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 8 states and 111 transitions. [2025-03-13 21:26:16,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 70 transitions, 283 flow [2025-03-13 21:26:16,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 70 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:26:16,123 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 97 flow [2025-03-13 21:26:16,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=97, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2025-03-13 21:26:16,127 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2025-03-13 21:26:16,130 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 97 flow [2025-03-13 21:26:16,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:16,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:16,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:16,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:26:16,131 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-13 21:26:16,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:16,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1510706617, now seen corresponding path program 1 times [2025-03-13 21:26:16,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:16,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43343860] [2025-03-13 21:26:16,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:16,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:16,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:26:16,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:26:16,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:16,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:16,290 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-13 21:26:16,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:16,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43343860] [2025-03-13 21:26:16,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43343860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:16,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:16,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:26:16,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184772477] [2025-03-13 21:26:16,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:16,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:26:16,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:16,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:26:16,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:26:16,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:16,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:16,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:16,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:16,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:16,486 INFO L124 PetriNetUnfolderBase]: 247/445 cut-off events. [2025-03-13 21:26:16,486 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2025-03-13 21:26:16,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 445 events. 247/445 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1777 event pairs, 63 based on Foata normal form. 18/458 useless extension candidates. Maximal degree in co-relation 1157. Up to 190 conditions per place. [2025-03-13 21:26:16,492 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 27 selfloop transitions, 8 changer transitions 15/53 dead transitions. [2025-03-13 21:26:16,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 53 transitions, 291 flow [2025-03-13 21:26:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:26:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:26:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2025-03-13 21:26:16,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-03-13 21:26:16,493 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 97 flow. Second operand 6 states and 76 transitions. [2025-03-13 21:26:16,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 53 transitions, 291 flow [2025-03-13 21:26:16,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 53 transitions, 287 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:26:16,496 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 141 flow [2025-03-13 21:26:16,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2025-03-13 21:26:16,498 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2025-03-13 21:26:16,499 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 141 flow [2025-03-13 21:26:16,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:16,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:16,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:16,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:26:16,499 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-13 21:26:16,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1329042648, now seen corresponding path program 1 times [2025-03-13 21:26:16,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:16,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740023880] [2025-03-13 21:26:16,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:16,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:16,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:26:16,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:26:16,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:16,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:16,634 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-13 21:26:16,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:16,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740023880] [2025-03-13 21:26:16,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740023880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:16,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:16,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:26:16,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842603899] [2025-03-13 21:26:16,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:16,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:26:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:16,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:26:16,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:26:16,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:16,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:16,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:16,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:16,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:16,823 INFO L124 PetriNetUnfolderBase]: 391/708 cut-off events. [2025-03-13 21:26:16,824 INFO L125 PetriNetUnfolderBase]: For 1142/1142 co-relation queries the response was YES. [2025-03-13 21:26:16,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2113 conditions, 708 events. 391/708 cut-off events. For 1142/1142 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3035 event pairs, 95 based on Foata normal form. 27/731 useless extension candidates. Maximal degree in co-relation 2093. Up to 264 conditions per place. [2025-03-13 21:26:16,827 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 47 selfloop transitions, 11 changer transitions 20/81 dead transitions. [2025-03-13 21:26:16,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 81 transitions, 515 flow [2025-03-13 21:26:16,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:26:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:26:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-03-13 21:26:16,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-13 21:26:16,832 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 141 flow. Second operand 9 states and 117 transitions. [2025-03-13 21:26:16,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 81 transitions, 515 flow [2025-03-13 21:26:16,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 81 transitions, 473 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-03-13 21:26:16,839 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 237 flow [2025-03-13 21:26:16,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2025-03-13 21:26:16,840 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-03-13 21:26:16,840 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 237 flow [2025-03-13 21:26:16,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:16,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:16,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:16,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:26:16,841 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-13 21:26:16,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:16,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1984146738, now seen corresponding path program 2 times [2025-03-13 21:26:16,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:16,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722987338] [2025-03-13 21:26:16,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:16,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:16,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:26:16,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:26:16,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:26:16,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:16,985 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-13 21:26:16,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:16,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722987338] [2025-03-13 21:26:16,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722987338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:16,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:16,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:26:16,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495780625] [2025-03-13 21:26:16,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:16,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:26:16,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:16,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:26:16,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:26:16,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:16,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:16,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:16,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:16,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:17,191 INFO L124 PetriNetUnfolderBase]: 328/603 cut-off events. [2025-03-13 21:26:17,192 INFO L125 PetriNetUnfolderBase]: For 1875/1875 co-relation queries the response was YES. [2025-03-13 21:26:17,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 603 events. 328/603 cut-off events. For 1875/1875 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2493 event pairs, 95 based on Foata normal form. 45/644 useless extension candidates. Maximal degree in co-relation 2015. Up to 234 conditions per place. [2025-03-13 21:26:17,195 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 11 changer transitions 28/80 dead transitions. [2025-03-13 21:26:17,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 80 transitions, 609 flow [2025-03-13 21:26:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:26:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:26:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-03-13 21:26:17,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-03-13 21:26:17,196 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 237 flow. Second operand 8 states and 103 transitions. [2025-03-13 21:26:17,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 80 transitions, 609 flow [2025-03-13 21:26:17,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 80 transitions, 565 flow, removed 22 selfloop flow, removed 2 redundant places. [2025-03-13 21:26:17,201 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 268 flow [2025-03-13 21:26:17,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=268, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2025-03-13 21:26:17,202 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2025-03-13 21:26:17,202 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 268 flow [2025-03-13 21:26:17,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:17,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:17,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:17,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:26:17,202 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-13 21:26:17,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:17,203 INFO L85 PathProgramCache]: Analyzing trace with hash 765975209, now seen corresponding path program 1 times [2025-03-13 21:26:17,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:17,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186422006] [2025-03-13 21:26:17,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:17,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:17,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 21:26:17,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:26:17,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:17,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:17,369 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-13 21:26:17,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:17,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186422006] [2025-03-13 21:26:17,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186422006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:17,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:17,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:26:17,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942454719] [2025-03-13 21:26:17,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:17,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:26:17,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:17,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:26:17,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:26:17,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:17,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-13 21:26:17,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:17,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:17,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:17,562 INFO L124 PetriNetUnfolderBase]: 364/664 cut-off events. [2025-03-13 21:26:17,562 INFO L125 PetriNetUnfolderBase]: For 2964/2964 co-relation queries the response was YES. [2025-03-13 21:26:17,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 664 events. 364/664 cut-off events. For 2964/2964 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2765 event pairs, 65 based on Foata normal form. 27/686 useless extension candidates. Maximal degree in co-relation 2387. Up to 148 conditions per place. [2025-03-13 21:26:17,565 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 40 selfloop transitions, 18 changer transitions 28/89 dead transitions. [2025-03-13 21:26:17,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 712 flow [2025-03-13 21:26:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:26:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:26:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-03-13 21:26:17,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-03-13 21:26:17,566 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 268 flow. Second operand 10 states and 125 transitions. [2025-03-13 21:26:17,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 712 flow [2025-03-13 21:26:17,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 643 flow, removed 25 selfloop flow, removed 7 redundant places. [2025-03-13 21:26:17,571 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 347 flow [2025-03-13 21:26:17,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=347, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2025-03-13 21:26:17,572 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2025-03-13 21:26:17,572 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 347 flow [2025-03-13 21:26:17,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-13 21:26:17,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:17,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:17,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:26:17,573 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-13 21:26:17,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash -812822151, now seen corresponding path program 2 times [2025-03-13 21:26:17,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:17,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038874841] [2025-03-13 21:26:17,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:17,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-13 21:26:17,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:26:17,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:26:17,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:17,669 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-13 21:26:17,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:17,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038874841] [2025-03-13 21:26:17,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038874841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:17,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:17,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:26:17,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294941690] [2025-03-13 21:26:17,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:17,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:26:17,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:17,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:26:17,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:26:17,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:17,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 347 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-13 21:26:17,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:17,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:17,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:17,838 INFO L124 PetriNetUnfolderBase]: 409/753 cut-off events. [2025-03-13 21:26:17,838 INFO L125 PetriNetUnfolderBase]: For 4019/4019 co-relation queries the response was YES. [2025-03-13 21:26:17,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 753 events. 409/753 cut-off events. For 4019/4019 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3372 event pairs, 116 based on Foata normal form. 18/767 useless extension candidates. Maximal degree in co-relation 2888. Up to 348 conditions per place. [2025-03-13 21:26:17,842 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 47 selfloop transitions, 16 changer transitions 21/87 dead transitions. [2025-03-13 21:26:17,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 779 flow [2025-03-13 21:26:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:26:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:26:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2025-03-13 21:26:17,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2025-03-13 21:26:17,843 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 347 flow. Second operand 9 states and 113 transitions. [2025-03-13 21:26:17,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 779 flow [2025-03-13 21:26:17,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 700 flow, removed 31 selfloop flow, removed 6 redundant places. [2025-03-13 21:26:17,850 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 401 flow [2025-03-13 21:26:17,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=401, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2025-03-13 21:26:17,850 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 38 predicate places. [2025-03-13 21:26:17,850 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 401 flow [2025-03-13 21:26:17,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-13 21:26:17,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:17,851 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:17,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:26:17,851 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-13 21:26:17,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1467249336, now seen corresponding path program 1 times [2025-03-13 21:26:17,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:17,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305954978] [2025-03-13 21:26:17,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:17,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:17,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:26:17,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:26:17,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:17,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:17,957 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-13 21:26:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:17,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305954978] [2025-03-13 21:26:17,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305954978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:17,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:17,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:26:17,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567234557] [2025-03-13 21:26:17,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:17,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:26:17,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:17,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:26:17,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:26:17,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:17,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 401 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:17,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:17,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:17,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:18,162 INFO L124 PetriNetUnfolderBase]: 454/835 cut-off events. [2025-03-13 21:26:18,163 INFO L125 PetriNetUnfolderBase]: For 4788/4788 co-relation queries the response was YES. [2025-03-13 21:26:18,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3262 conditions, 835 events. 454/835 cut-off events. For 4788/4788 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3767 event pairs, 59 based on Foata normal form. 18/848 useless extension candidates. Maximal degree in co-relation 3228. Up to 157 conditions per place. [2025-03-13 21:26:18,168 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 44 selfloop transitions, 26 changer transitions 23/96 dead transitions. [2025-03-13 21:26:18,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 881 flow [2025-03-13 21:26:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:26:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:26:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-03-13 21:26:18,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-03-13 21:26:18,170 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 401 flow. Second operand 10 states and 125 transitions. [2025-03-13 21:26:18,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 881 flow [2025-03-13 21:26:18,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 834 flow, removed 17 selfloop flow, removed 4 redundant places. [2025-03-13 21:26:18,179 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 494 flow [2025-03-13 21:26:18,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=494, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2025-03-13 21:26:18,180 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 45 predicate places. [2025-03-13 21:26:18,180 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 494 flow [2025-03-13 21:26:18,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:18,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:18,180 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:18,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:26:18,181 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-13 21:26:18,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:18,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1363386589, now seen corresponding path program 1 times [2025-03-13 21:26:18,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:18,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036072472] [2025-03-13 21:26:18,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:18,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:18,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:26:18,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:26:18,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:18,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:18,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036072472] [2025-03-13 21:26:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036072472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080262559] [2025-03-13 21:26:18,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:18,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:18,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:18,282 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-13 21:26:18,283 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-13 21:26:18,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:26:18,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:26:18,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:18,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:18,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:26:18,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:18,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:18,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080262559] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:18,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:18,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-13 21:26:18,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125606838] [2025-03-13 21:26:18,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:18,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:26:18,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:18,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:26:18,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:26:18,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:18,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 48 transitions, 494 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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-13 21:26:18,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:18,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:18,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:19,011 INFO L124 PetriNetUnfolderBase]: 598/1110 cut-off events. [2025-03-13 21:26:19,011 INFO L125 PetriNetUnfolderBase]: For 10228/10228 co-relation queries the response was YES. [2025-03-13 21:26:19,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4875 conditions, 1110 events. 598/1110 cut-off events. For 10228/10228 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4789 event pairs, 149 based on Foata normal form. 63/1169 useless extension candidates. Maximal degree in co-relation 4839. Up to 504 conditions per place. [2025-03-13 21:26:19,017 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 65 selfloop transitions, 19 changer transitions 67/154 dead transitions. [2025-03-13 21:26:19,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 154 transitions, 1562 flow [2025-03-13 21:26:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:26:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:26:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2025-03-13 21:26:19,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-03-13 21:26:19,018 INFO L175 Difference]: Start difference. First operand has 71 places, 48 transitions, 494 flow. Second operand 19 states and 231 transitions. [2025-03-13 21:26:19,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 154 transitions, 1562 flow [2025-03-13 21:26:19,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 154 transitions, 1466 flow, removed 31 selfloop flow, removed 7 redundant places. [2025-03-13 21:26:19,028 INFO L231 Difference]: Finished difference. Result has 93 places, 54 transitions, 631 flow [2025-03-13 21:26:19,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=631, PETRI_PLACES=93, PETRI_TRANSITIONS=54} [2025-03-13 21:26:19,029 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 67 predicate places. [2025-03-13 21:26:19,029 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 54 transitions, 631 flow [2025-03-13 21:26:19,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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-13 21:26:19,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:19,029 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:19,036 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-13 21:26:19,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:19,233 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-13 21:26:19,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1919587151, now seen corresponding path program 2 times [2025-03-13 21:26:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:19,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786358373] [2025-03-13 21:26:19,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:19,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:19,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:26:19,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:26:19,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:26:19,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:19,345 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-13 21:26:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786358373] [2025-03-13 21:26:19,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786358373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:19,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:19,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:26:19,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280690240] [2025-03-13 21:26:19,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:19,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:26:19,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:19,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:26:19,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:26:19,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:19,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 54 transitions, 631 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:19,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:19,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:19,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:19,633 INFO L124 PetriNetUnfolderBase]: 679/1277 cut-off events. [2025-03-13 21:26:19,633 INFO L125 PetriNetUnfolderBase]: For 24640/24640 co-relation queries the response was YES. [2025-03-13 21:26:19,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6855 conditions, 1277 events. 679/1277 cut-off events. For 24640/24640 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6087 event pairs, 144 based on Foata normal form. 27/1300 useless extension candidates. Maximal degree in co-relation 6808. Up to 501 conditions per place. [2025-03-13 21:26:19,642 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 77 selfloop transitions, 25 changer transitions 31/136 dead transitions. [2025-03-13 21:26:19,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 136 transitions, 1699 flow [2025-03-13 21:26:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:26:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:26:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 187 transitions. [2025-03-13 21:26:19,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-03-13 21:26:19,643 INFO L175 Difference]: Start difference. First operand has 93 places, 54 transitions, 631 flow. Second operand 15 states and 187 transitions. [2025-03-13 21:26:19,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 136 transitions, 1699 flow [2025-03-13 21:26:19,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 136 transitions, 1352 flow, removed 161 selfloop flow, removed 12 redundant places. [2025-03-13 21:26:19,665 INFO L231 Difference]: Finished difference. Result has 95 places, 60 transitions, 693 flow [2025-03-13 21:26:19,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=693, PETRI_PLACES=95, PETRI_TRANSITIONS=60} [2025-03-13 21:26:19,666 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 69 predicate places. [2025-03-13 21:26:19,666 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 60 transitions, 693 flow [2025-03-13 21:26:19,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:19,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:19,666 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:19,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:26:19,666 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-13 21:26:19,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:19,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1813500653, now seen corresponding path program 3 times [2025-03-13 21:26:19,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:19,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084699923] [2025-03-13 21:26:19,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:26:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:19,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:26:19,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:26:19,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:26:19,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:19,760 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-13 21:26:19,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084699923] [2025-03-13 21:26:19,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084699923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606935029] [2025-03-13 21:26:19,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:26:19,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:19,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:19,762 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-13 21:26:19,764 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-13 21:26:19,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:26:19,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:26:19,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:26:19,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:19,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:26:19,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:19,843 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-13 21:26:19,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:19,928 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-13 21:26:19,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606935029] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:19,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:19,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-13 21:26:19,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534609508] [2025-03-13 21:26:19,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:19,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:26:19,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:19,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:26:19,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:26:19,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:19,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 60 transitions, 693 flow. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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-13 21:26:19,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:19,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:19,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:20,528 INFO L124 PetriNetUnfolderBase]: 868/1589 cut-off events. [2025-03-13 21:26:20,528 INFO L125 PetriNetUnfolderBase]: For 29691/29691 co-relation queries the response was YES. [2025-03-13 21:26:20,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8651 conditions, 1589 events. 868/1589 cut-off events. For 29691/29691 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 7712 event pairs, 46 based on Foata normal form. 81/1666 useless extension candidates. Maximal degree in co-relation 8604. Up to 252 conditions per place. [2025-03-13 21:26:20,537 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 79 selfloop transitions, 52 changer transitions 83/217 dead transitions. [2025-03-13 21:26:20,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 217 transitions, 2713 flow [2025-03-13 21:26:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-13 21:26:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-13 21:26:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 321 transitions. [2025-03-13 21:26:20,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5144230769230769 [2025-03-13 21:26:20,539 INFO L175 Difference]: Start difference. First operand has 95 places, 60 transitions, 693 flow. Second operand 26 states and 321 transitions. [2025-03-13 21:26:20,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 217 transitions, 2713 flow [2025-03-13 21:26:20,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 217 transitions, 2465 flow, removed 107 selfloop flow, removed 9 redundant places. [2025-03-13 21:26:20,567 INFO L231 Difference]: Finished difference. Result has 125 places, 73 transitions, 1102 flow [2025-03-13 21:26:20,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1102, PETRI_PLACES=125, PETRI_TRANSITIONS=73} [2025-03-13 21:26:20,568 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 99 predicate places. [2025-03-13 21:26:20,568 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 73 transitions, 1102 flow [2025-03-13 21:26:20,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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-13 21:26:20,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:20,568 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:20,574 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-13 21:26:20,769 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,SelfDestructingSolverStorable9 [2025-03-13 21:26:20,769 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-13 21:26:20,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:20,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1531365535, now seen corresponding path program 1 times [2025-03-13 21:26:20,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:20,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724819725] [2025-03-13 21:26:20,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:20,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:20,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:26:20,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:26:20,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:20,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724819725] [2025-03-13 21:26:20,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724819725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10118429] [2025-03-13 21:26:20,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:20,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:20,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:20,887 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-13 21:26:20,889 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-13 21:26:20,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:26:20,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:26:20,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:20,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:20,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-13 21:26:20,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:20,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:21,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10118429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:21,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:21,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-13 21:26:21,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349078520] [2025-03-13 21:26:21,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:21,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 21:26:21,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:21,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 21:26:21,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:26:21,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:21,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 73 transitions, 1102 flow. Second operand has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 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-13 21:26:21,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:21,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:21,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:21,987 INFO L124 PetriNetUnfolderBase]: 1354/2478 cut-off events. [2025-03-13 21:26:21,987 INFO L125 PetriNetUnfolderBase]: For 89742/89742 co-relation queries the response was YES. [2025-03-13 21:26:21,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16442 conditions, 2478 events. 1354/2478 cut-off events. For 89742/89742 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 12331 event pairs, 83 based on Foata normal form. 63/2536 useless extension candidates. Maximal degree in co-relation 16382. Up to 450 conditions per place. [2025-03-13 21:26:22,007 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 97 selfloop transitions, 83 changer transitions 86/269 dead transitions. [2025-03-13 21:26:22,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 269 transitions, 4487 flow [2025-03-13 21:26:22,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-13 21:26:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-13 21:26:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 358 transitions. [2025-03-13 21:26:22,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.514367816091954 [2025-03-13 21:26:22,009 INFO L175 Difference]: Start difference. First operand has 125 places, 73 transitions, 1102 flow. Second operand 29 states and 358 transitions. [2025-03-13 21:26:22,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 269 transitions, 4487 flow [2025-03-13 21:26:22,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 269 transitions, 3681 flow, removed 379 selfloop flow, removed 17 redundant places. [2025-03-13 21:26:22,176 INFO L231 Difference]: Finished difference. Result has 148 places, 109 transitions, 1807 flow [2025-03-13 21:26:22,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1807, PETRI_PLACES=148, PETRI_TRANSITIONS=109} [2025-03-13 21:26:22,179 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 122 predicate places. [2025-03-13 21:26:22,179 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 109 transitions, 1807 flow [2025-03-13 21:26:22,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 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-13 21:26:22,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:22,180 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:22,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:26:22,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:22,380 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-13 21:26:22,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1757653570, now seen corresponding path program 2 times [2025-03-13 21:26:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:22,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311975654] [2025-03-13 21:26:22,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:22,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:22,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-13 21:26:22,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:26:22,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:26:22,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:26:22,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:22,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311975654] [2025-03-13 21:26:22,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311975654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:22,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683537611] [2025-03-13 21:26:22,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:22,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:22,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:22,737 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-13 21:26:22,744 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-13 21:26:22,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-13 21:26:22,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:26:22,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:26:22,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:22,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-13 21:26:22,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:26:23,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:26:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683537611] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:23,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:23,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-03-13 21:26:23,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791539044] [2025-03-13 21:26:23,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:23,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-13 21:26:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:23,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-13 21:26:23,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-03-13 21:26:23,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:23,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 109 transitions, 1807 flow. Second operand has 25 states, 25 states have (on average 7.2) internal successors, (180), 25 states have internal predecessors, (180), 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-13 21:26:23,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:23,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:23,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:24,720 INFO L124 PetriNetUnfolderBase]: 1588/2973 cut-off events. [2025-03-13 21:26:24,720 INFO L125 PetriNetUnfolderBase]: For 187857/187857 co-relation queries the response was YES. [2025-03-13 21:26:24,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23143 conditions, 2973 events. 1588/2973 cut-off events. For 187857/187857 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 14427 event pairs, 467 based on Foata normal form. 117/3086 useless extension candidates. Maximal degree in co-relation 23072. Up to 1674 conditions per place. [2025-03-13 21:26:24,741 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 153 selfloop transitions, 37 changer transitions 133/326 dead transitions. [2025-03-13 21:26:24,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 326 transitions, 6596 flow [2025-03-13 21:26:24,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-13 21:26:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-13 21:26:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 441 transitions. [2025-03-13 21:26:24,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4966216216216216 [2025-03-13 21:26:24,746 INFO L175 Difference]: Start difference. First operand has 148 places, 109 transitions, 1807 flow. Second operand 37 states and 441 transitions. [2025-03-13 21:26:24,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 326 transitions, 6596 flow [2025-03-13 21:26:24,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 326 transitions, 5064 flow, removed 742 selfloop flow, removed 14 redundant places. [2025-03-13 21:26:24,873 INFO L231 Difference]: Finished difference. Result has 188 places, 123 transitions, 1995 flow [2025-03-13 21:26:24,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1995, PETRI_PLACES=188, PETRI_TRANSITIONS=123} [2025-03-13 21:26:24,873 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 162 predicate places. [2025-03-13 21:26:24,874 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 123 transitions, 1995 flow [2025-03-13 21:26:24,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.2) internal successors, (180), 25 states have internal predecessors, (180), 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-13 21:26:24,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:24,874 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:24,879 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-13 21:26:25,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:25,074 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-13 21:26:25,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1392225716, now seen corresponding path program 3 times [2025-03-13 21:26:25,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:25,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284046097] [2025-03-13 21:26:25,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:26:25,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:25,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-03-13 21:26:25,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:26:25,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-13 21:26:25,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:26:25,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:25,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284046097] [2025-03-13 21:26:25,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284046097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:25,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104428914] [2025-03-13 21:26:25,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:26:25,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:25,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:25,226 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-13 21:26:25,228 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-13 21:26:25,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-03-13 21:26:25,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:26:25,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-13 21:26:25,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:25,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-13 21:26:25,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:26:25,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:26:25,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104428914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:25,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:25,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-03-13 21:26:25,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320484433] [2025-03-13 21:26:25,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:25,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-13 21:26:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:25,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-13 21:26:25,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2025-03-13 21:26:25,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:25,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 123 transitions, 1995 flow. Second operand has 25 states, 25 states have (on average 7.2) internal successors, (180), 25 states have internal predecessors, (180), 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-13 21:26:25,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:25,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:25,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:26,824 INFO L124 PetriNetUnfolderBase]: 1984/3859 cut-off events. [2025-03-13 21:26:26,824 INFO L125 PetriNetUnfolderBase]: For 313306/313306 co-relation queries the response was YES. [2025-03-13 21:26:26,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31641 conditions, 3859 events. 1984/3859 cut-off events. For 313306/313306 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21230 event pairs, 272 based on Foata normal form. 117/3972 useless extension candidates. Maximal degree in co-relation 31552. Up to 1102 conditions per place. [2025-03-13 21:26:26,853 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 153 selfloop transitions, 108 changer transitions 147/411 dead transitions. [2025-03-13 21:26:26,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 411 transitions, 8477 flow [2025-03-13 21:26:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-13 21:26:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-13 21:26:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 527 transitions. [2025-03-13 21:26:26,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4990530303030303 [2025-03-13 21:26:26,860 INFO L175 Difference]: Start difference. First operand has 188 places, 123 transitions, 1995 flow. Second operand 44 states and 527 transitions. [2025-03-13 21:26:26,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 411 transitions, 8477 flow [2025-03-13 21:26:27,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 411 transitions, 7182 flow, removed 625 selfloop flow, removed 24 redundant places. [2025-03-13 21:26:27,177 INFO L231 Difference]: Finished difference. Result has 220 places, 168 transitions, 3012 flow [2025-03-13 21:26:27,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=3012, PETRI_PLACES=220, PETRI_TRANSITIONS=168} [2025-03-13 21:26:27,178 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 194 predicate places. [2025-03-13 21:26:27,178 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 168 transitions, 3012 flow [2025-03-13 21:26:27,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.2) internal successors, (180), 25 states have internal predecessors, (180), 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-13 21:26:27,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:27,178 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:27,213 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-13 21:26:27,378 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,SelfDestructingSolverStorable12 [2025-03-13 21:26:27,379 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-13 21:26:27,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:27,380 INFO L85 PathProgramCache]: Analyzing trace with hash 682771216, now seen corresponding path program 4 times [2025-03-13 21:26:27,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:27,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840531770] [2025-03-13 21:26:27,380 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:26:27,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:27,384 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-13 21:26:27,389 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:26:27,390 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:26:27,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:26:27,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840531770] [2025-03-13 21:26:27,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840531770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735905508] [2025-03-13 21:26:27,540 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:26:27,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:27,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:27,543 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-13 21:26:27,544 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-13 21:26:27,575 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-13 21:26:27,587 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:26:27,587 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:26:27,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:27,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-13 21:26:27,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:26:27,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:26:27,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735905508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:27,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-13 21:26:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704946718] [2025-03-13 21:26:27,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:27,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-13 21:26:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:27,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-13 21:26:27,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-03-13 21:26:27,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:27,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 168 transitions, 3012 flow. Second operand has 26 states, 26 states have (on average 7.230769230769231) internal successors, (188), 26 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:27,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:27,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:27,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:29,688 INFO L124 PetriNetUnfolderBase]: 3451/6611 cut-off events. [2025-03-13 21:26:29,688 INFO L125 PetriNetUnfolderBase]: For 739284/739284 co-relation queries the response was YES. [2025-03-13 21:26:29,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59573 conditions, 6611 events. 3451/6611 cut-off events. For 739284/739284 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 41547 event pairs, 144 based on Foata normal form. 126/6733 useless extension candidates. Maximal degree in co-relation 59471. Up to 1503 conditions per place. [2025-03-13 21:26:29,784 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 161 selfloop transitions, 237 changer transitions 162/563 dead transitions. [2025-03-13 21:26:29,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 563 transitions, 13141 flow [2025-03-13 21:26:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-13 21:26:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-03-13 21:26:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 607 transitions. [2025-03-13 21:26:29,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5058333333333334 [2025-03-13 21:26:29,789 INFO L175 Difference]: Start difference. First operand has 220 places, 168 transitions, 3012 flow. Second operand 50 states and 607 transitions. [2025-03-13 21:26:29,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 563 transitions, 13141 flow [2025-03-13 21:26:30,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 563 transitions, 11276 flow, removed 902 selfloop flow, removed 26 redundant places. [2025-03-13 21:26:30,804 INFO L231 Difference]: Finished difference. Result has 263 places, 280 transitions, 5661 flow [2025-03-13 21:26:30,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=5661, PETRI_PLACES=263, PETRI_TRANSITIONS=280} [2025-03-13 21:26:30,805 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 237 predicate places. [2025-03-13 21:26:30,805 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 280 transitions, 5661 flow [2025-03-13 21:26:30,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.230769230769231) internal successors, (188), 26 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:30,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:30,805 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:30,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:26:31,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:31,006 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-13 21:26:31,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash 555008031, now seen corresponding path program 5 times [2025-03-13 21:26:31,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:31,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813077631] [2025-03-13 21:26:31,007 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:26:31,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:31,014 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 5 equivalence classes. [2025-03-13 21:26:31,023 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:26:31,023 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-13 21:26:31,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:26:31,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:31,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813077631] [2025-03-13 21:26:31,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813077631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:31,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257065628] [2025-03-13 21:26:31,165 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:26:31,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:31,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:31,167 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-13 21:26:31,169 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-13 21:26:31,196 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 5 equivalence classes. [2025-03-13 21:26:31,208 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:26:31,209 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-13 21:26:31,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:31,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 21:26:31,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:26:31,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:26:31,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257065628] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:31,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:31,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2025-03-13 21:26:31,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312676280] [2025-03-13 21:26:31,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:31,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-13 21:26:31,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:31,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-13 21:26:31,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2025-03-13 21:26:31,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:31,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 280 transitions, 5661 flow. Second operand has 27 states, 27 states have (on average 7.185185185185185) internal successors, (194), 27 states have internal predecessors, (194), 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-13 21:26:31,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:31,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:31,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:34,080 INFO L124 PetriNetUnfolderBase]: 4711/9033 cut-off events. [2025-03-13 21:26:34,080 INFO L125 PetriNetUnfolderBase]: For 1628309/1628309 co-relation queries the response was YES. [2025-03-13 21:26:34,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98442 conditions, 9033 events. 4711/9033 cut-off events. For 1628309/1628309 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 58846 event pairs, 77 based on Foata normal form. 117/9145 useless extension candidates. Maximal degree in co-relation 98320. Up to 2082 conditions per place. [2025-03-13 21:26:34,163 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 190 selfloop transitions, 347 changer transitions 161/701 dead transitions. [2025-03-13 21:26:34,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 701 transitions, 21026 flow [2025-03-13 21:26:34,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-13 21:26:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-03-13 21:26:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 676 transitions. [2025-03-13 21:26:34,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5121212121212121 [2025-03-13 21:26:34,166 INFO L175 Difference]: Start difference. First operand has 263 places, 280 transitions, 5661 flow. Second operand 55 states and 676 transitions. [2025-03-13 21:26:34,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 701 transitions, 21026 flow [2025-03-13 21:26:36,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 701 transitions, 15166 flow, removed 2890 selfloop flow, removed 25 redundant places. [2025-03-13 21:26:36,285 INFO L231 Difference]: Finished difference. Result has 313 places, 383 transitions, 8284 flow [2025-03-13 21:26:36,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4221, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=8284, PETRI_PLACES=313, PETRI_TRANSITIONS=383} [2025-03-13 21:26:36,285 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 287 predicate places. [2025-03-13 21:26:36,285 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 383 transitions, 8284 flow [2025-03-13 21:26:36,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.185185185185185) internal successors, (194), 27 states have internal predecessors, (194), 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-13 21:26:36,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:36,286 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:36,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-13 21:26:36,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:36,486 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-13 21:26:36,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1959211370, now seen corresponding path program 6 times [2025-03-13 21:26:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:36,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941564708] [2025-03-13 21:26:36,487 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:26:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:36,491 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 60 statements into 8 equivalence classes. [2025-03-13 21:26:36,503 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 60 of 60 statements. [2025-03-13 21:26:36,504 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-13 21:26:36,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:36,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:36,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941564708] [2025-03-13 21:26:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941564708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:36,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348479640] [2025-03-13 21:26:36,718 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:26:36,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:36,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:36,720 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:26:36,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-13 21:26:36,756 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 60 statements into 8 equivalence classes. [2025-03-13 21:26:36,775 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 60 of 60 statements. [2025-03-13 21:26:36,775 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-13 21:26:36,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:36,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-13 21:26:36,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:36,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348479640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:37,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:37,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2025-03-13 21:26:37,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446024898] [2025-03-13 21:26:37,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:37,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-13 21:26:37,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:37,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-13 21:26:37,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1354, Unknown=0, NotChecked=0, Total=1722 [2025-03-13 21:26:37,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:37,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 383 transitions, 8284 flow. Second operand has 42 states, 42 states have (on average 7.023809523809524) internal successors, (295), 42 states have internal predecessors, (295), 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-13 21:26:37,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:37,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:37,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:40,440 INFO L124 PetriNetUnfolderBase]: 5197/9993 cut-off events. [2025-03-13 21:26:40,441 INFO L125 PetriNetUnfolderBase]: For 2081218/2081218 co-relation queries the response was YES. [2025-03-13 21:26:40,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110207 conditions, 9993 events. 5197/9993 cut-off events. For 2081218/2081218 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 65562 event pairs, 46 based on Foata normal form. 108/10097 useless extension candidates. Maximal degree in co-relation 110062. Up to 2286 conditions per place. [2025-03-13 21:26:40,571 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 191 selfloop transitions, 401 changer transitions 143/738 dead transitions. [2025-03-13 21:26:40,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 738 transitions, 20842 flow [2025-03-13 21:26:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-13 21:26:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-03-13 21:26:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 657 transitions. [2025-03-13 21:26:40,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2025-03-13 21:26:40,574 INFO L175 Difference]: Start difference. First operand has 313 places, 383 transitions, 8284 flow. Second operand 54 states and 657 transitions. [2025-03-13 21:26:40,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 738 transitions, 20842 flow [2025-03-13 21:26:44,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 738 transitions, 15967 flow, removed 2385 selfloop flow, removed 25 redundant places. [2025-03-13 21:26:44,033 INFO L231 Difference]: Finished difference. Result has 345 places, 431 transitions, 8643 flow [2025-03-13 21:26:44,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6225, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=354, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=8643, PETRI_PLACES=345, PETRI_TRANSITIONS=431} [2025-03-13 21:26:44,034 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 319 predicate places. [2025-03-13 21:26:44,034 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 431 transitions, 8643 flow [2025-03-13 21:26:44,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.023809523809524) internal successors, (295), 42 states have internal predecessors, (295), 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-13 21:26:44,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:44,034 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:44,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-13 21:26:44,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-13 21:26:44,235 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-13 21:26:44,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:44,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1390091226, now seen corresponding path program 7 times [2025-03-13 21:26:44,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:44,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283130546] [2025-03-13 21:26:44,236 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:26:44,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:44,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-13 21:26:44,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-13 21:26:44,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:44,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:44,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:44,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283130546] [2025-03-13 21:26:44,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283130546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:44,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520148155] [2025-03-13 21:26:44,482 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:26:44,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:44,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:44,483 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:26:44,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-13 21:26:44,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-13 21:26:44,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-13 21:26:44,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:44,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:44,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-13 21:26:44,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:44,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:44,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520148155] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:44,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:44,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 26 [2025-03-13 21:26:44,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088200416] [2025-03-13 21:26:44,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:44,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-13 21:26:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:44,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-13 21:26:44,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2025-03-13 21:26:44,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:44,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 431 transitions, 8643 flow. Second operand has 27 states, 27 states have (on average 6.888888888888889) internal successors, (186), 27 states have internal predecessors, (186), 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-13 21:26:44,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:44,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:44,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:47,648 INFO L124 PetriNetUnfolderBase]: 5107/9848 cut-off events. [2025-03-13 21:26:47,649 INFO L125 PetriNetUnfolderBase]: For 1717802/1717802 co-relation queries the response was YES. [2025-03-13 21:26:47,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97152 conditions, 9848 events. 5107/9848 cut-off events. For 1717802/1717802 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 64707 event pairs, 119 based on Foata normal form. 18/9861 useless extension candidates. Maximal degree in co-relation 97004. Up to 2202 conditions per place. [2025-03-13 21:26:47,738 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 188 selfloop transitions, 387 changer transitions 87/665 dead transitions. [2025-03-13 21:26:47,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 665 transitions, 15430 flow [2025-03-13 21:26:47,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-13 21:26:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-13 21:26:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 509 transitions. [2025-03-13 21:26:47,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5049603174603174 [2025-03-13 21:26:47,740 INFO L175 Difference]: Start difference. First operand has 345 places, 431 transitions, 8643 flow. Second operand 42 states and 509 transitions. [2025-03-13 21:26:47,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 665 transitions, 15430 flow [2025-03-13 21:26:50,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 665 transitions, 13872 flow, removed 676 selfloop flow, removed 24 redundant places. [2025-03-13 21:26:50,519 INFO L231 Difference]: Finished difference. Result has 359 places, 435 transitions, 8461 flow [2025-03-13 21:26:50,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=7397, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=383, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=8461, PETRI_PLACES=359, PETRI_TRANSITIONS=435} [2025-03-13 21:26:50,520 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 333 predicate places. [2025-03-13 21:26:50,520 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 435 transitions, 8461 flow [2025-03-13 21:26:50,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.888888888888889) internal successors, (186), 27 states have internal predecessors, (186), 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-13 21:26:50,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:50,520 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:50,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-13 21:26:50,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-13 21:26:50,721 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-13 21:26:50,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:50,722 INFO L85 PathProgramCache]: Analyzing trace with hash -410020910, now seen corresponding path program 8 times [2025-03-13 21:26:50,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:50,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040882805] [2025-03-13 21:26:50,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:50,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:50,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-13 21:26:50,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 21:26:50,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:26:50,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:26:50,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:26:50,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 21:26:50,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 21:26:50,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:50,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:26:50,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:26:50,777 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:26:50,778 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-13 21:26:50,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-13 21:26:50,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-13 21:26:50,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 21:26:50,779 INFO L422 BasicCegarLoop]: Path program histogram: [8, 3, 2, 2, 1, 1, 1] [2025-03-13 21:26:50,880 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:26:50,884 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:26:50,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:26:50 BasicIcfg [2025-03-13 21:26:50,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:26:50,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:26:50,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:26:50,891 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:26:50,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:15" (3/4) ... [2025-03-13 21:26:50,893 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 21:26:50,990 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 22. [2025-03-13 21:26:51,042 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:26:51,042 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:26:51,042 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:26:51,043 INFO L158 Benchmark]: Toolchain (without parser) took 36489.85ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 106.7MB in the beginning and 425.2MB in the end (delta: -318.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-13 21:26:51,043 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:26:51,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.77ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 87.2MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:26:51,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.24ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:26:51,043 INFO L158 Benchmark]: Boogie Preprocessor took 24.18ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:26:51,043 INFO L158 Benchmark]: IcfgBuilder took 367.83ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 64.8MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:26:51,043 INFO L158 Benchmark]: TraceAbstraction took 35579.02ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 63.9MB in the beginning and 442.0MB in the end (delta: -378.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-13 21:26:51,044 INFO L158 Benchmark]: Witness Printer took 151.42ms. Allocated memory is still 1.6GB. Free memory was 442.0MB in the beginning and 425.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:26:51,047 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.77ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 87.2MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.24ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.18ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 367.83ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 64.8MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 35579.02ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 63.9MB in the beginning and 442.0MB in the end (delta: -378.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 151.42ms. Allocated memory is still 1.6GB. Free memory was 442.0MB in the beginning and 425.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=7, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L716] 0 int condI = i >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=23, id1=-1, id2=0, j=24, k=9, k=9] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.4s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5540 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5529 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 358 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5784 IncrementalHoareTripleChecker+Invalid, 6142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 358 mSolverCounterUnsat, 7 mSDtfsCounter, 5784 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1182 GetRequests, 582 SyntacticMatches, 19 SemanticMatches, 581 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9247 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8643occurred in iteration=16, InterpolantAutomatonStates: 431, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 870 NumberOfCodeBlocks, 870 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1111 ConstructedInterpolants, 0 QuantifiedInterpolants, 4504 SizeOfPredicates, 93 NumberOfNonLiveVariables, 1106 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 35 InterpolantComputations, 8 PerfectInterpolantSequences, 30/1521 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-13 21:26:51,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE