./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c --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/weaver/mult-flipped-dist.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cfd33ca5f647adf12592c5e71401ab9da35a49d8f2ec6d0757ea2cc237974cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:44:13,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:44:13,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:44:13,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:44:13,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:44:13,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:44:13,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:44:13,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:44:13,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:44:13,899 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:44:13,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:44:13,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:44:13,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:44:13,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:44:13,900 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:44:13,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:44:13,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:44:13,900 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:44:13,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:44:13,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:44:13,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:44:13,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:44:13,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:44:13,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:44:13,901 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:44:13,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:44:13,901 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:44:13,901 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:44:13,901 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:44:13,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:44:13,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:44:13,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:44:13,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:44:13,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:44:13,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:44:13,902 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:44:13,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:44:13,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:44:13,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:44:13,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:44:13,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:44:13,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:44:13,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:44:13,903 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 -> 7cfd33ca5f647adf12592c5e71401ab9da35a49d8f2ec6d0757ea2cc237974cc [2025-03-13 21:44:14,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:44:14,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:44:14,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:44:14,134 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:44:14,134 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:44:14,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2025-03-13 21:44:15,279 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ff830c9e/333bcdb9613e430997b10895f809fc8a/FLAG6ff224e2b [2025-03-13 21:44:15,486 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:44:15,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2025-03-13 21:44:15,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ff830c9e/333bcdb9613e430997b10895f809fc8a/FLAG6ff224e2b [2025-03-13 21:44:15,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ff830c9e/333bcdb9613e430997b10895f809fc8a [2025-03-13 21:44:15,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:44:15,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:44:15,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:44:15,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:44:15,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:44:15,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:44:15" (1/1) ... [2025-03-13 21:44:15,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1a7767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:15, skipping insertion in model container [2025-03-13 21:44:15,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:44:15" (1/1) ... [2025-03-13 21:44:15,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:44:15,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c[2174,2187] [2025-03-13 21:44:15,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:44:15,986 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:44:15,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c[2174,2187] [2025-03-13 21:44:15,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:44:16,007 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:44:16,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:16 WrapperNode [2025-03-13 21:44:16,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:44:16,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:44:16,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:44:16,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:44:16,014 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:44:16" (1/1) ... [2025-03-13 21:44:16,017 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:44:16" (1/1) ... [2025-03-13 21:44:16,027 INFO L138 Inliner]: procedures = 21, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2025-03-13 21:44:16,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:44:16,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:44:16,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:44:16,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:44:16,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:16" (1/1) ... [2025-03-13 21:44:16,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:16" (1/1) ... [2025-03-13 21:44:16,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:16" (1/1) ... [2025-03-13 21:44:16,041 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:44:16,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:16" (1/1) ... [2025-03-13 21:44:16,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:16" (1/1) ... [2025-03-13 21:44:16,044 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:16" (1/1) ... [2025-03-13 21:44:16,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:16" (1/1) ... [2025-03-13 21:44:16,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:16" (1/1) ... [2025-03-13 21:44:16,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:16" (1/1) ... [2025-03-13 21:44:16,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:44:16,050 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:44:16,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:44:16,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:44:16,050 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:16" (1/1) ... [2025-03-13 21:44:16,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:44:16,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:16,071 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:44:16,073 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:44:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:44:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:44:16,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:44:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:44:16,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:44:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:44:16,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:44:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:44:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:44:16,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:44:16,089 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:44:16,153 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:44:16,154 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:44:16,293 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:44:16,294 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:44:16,294 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:44:16,402 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:44:16,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:44:16 BoogieIcfgContainer [2025-03-13 21:44:16,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:44:16,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:44:16,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:44:16,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:44:16,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:44:15" (1/3) ... [2025-03-13 21:44:16,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d6417f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:44:16, skipping insertion in model container [2025-03-13 21:44:16,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:44:16" (2/3) ... [2025-03-13 21:44:16,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d6417f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:44:16, skipping insertion in model container [2025-03-13 21:44:16,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:44:16" (3/3) ... [2025-03-13 21:44:16,409 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2025-03-13 21:44:16,419 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:44:16,420 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-flipped-dist.wvr.c that has 4 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-13 21:44:16,420 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:44:16,468 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:44:16,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 71 flow [2025-03-13 21:44:16,519 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-03-13 21:44:16,520 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:44:16,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-03-13 21:44:16,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 25 transitions, 71 flow [2025-03-13 21:44:16,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 21 transitions, 60 flow [2025-03-13 21:44:16,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:44:16,537 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;@465bb982, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:44:16,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:44:16,543 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:44:16,543 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-13 21:44:16,543 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:44:16,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:16,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:16,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:16,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1787266647, now seen corresponding path program 1 times [2025-03-13 21:44:16,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:16,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339567647] [2025-03-13 21:44:16,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:16,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:16,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:44:16,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:44:16,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:16,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:17,081 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:44:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:17,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339567647] [2025-03-13 21:44:17,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339567647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:17,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:17,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:44:17,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645041112] [2025-03-13 21:44:17,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:17,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:44:17,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:17,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:44:17,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:44:17,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:17,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:44:17,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:17,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:17,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:17,252 INFO L124 PetriNetUnfolderBase]: 386/565 cut-off events. [2025-03-13 21:44:17,252 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-03-13 21:44:17,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 565 events. 386/565 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1769 event pairs, 124 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 1030. Up to 349 conditions per place. [2025-03-13 21:44:17,260 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 32 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2025-03-13 21:44:17,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 183 flow [2025-03-13 21:44:17,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:44:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:44:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-13 21:44:17,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-13 21:44:17,274 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 60 flow. Second operand 3 states and 50 transitions. [2025-03-13 21:44:17,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 183 flow [2025-03-13 21:44:17,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:44:17,287 INFO L231 Difference]: Finished difference. Result has 25 places, 24 transitions, 74 flow [2025-03-13 21:44:17,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=25, PETRI_TRANSITIONS=24} [2025-03-13 21:44:17,293 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2025-03-13 21:44:17,294 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 24 transitions, 74 flow [2025-03-13 21:44:17,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:44:17,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:17,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:17,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:44:17,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:17,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash -313317532, now seen corresponding path program 1 times [2025-03-13 21:44:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596837194] [2025-03-13 21:44:17,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:17,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:44:17,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:44:17,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:17,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:17,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:17,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596837194] [2025-03-13 21:44:17,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596837194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:17,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:17,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:44:17,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957709283] [2025-03-13 21:44:17,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:17,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:44:17,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:17,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:44:17,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:44:17,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:17,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:44:17,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:17,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:17,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:17,624 INFO L124 PetriNetUnfolderBase]: 480/730 cut-off events. [2025-03-13 21:44:17,624 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-03-13 21:44:17,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1709 conditions, 730 events. 480/730 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2758 event pairs, 144 based on Foata normal form. 65/795 useless extension candidates. Maximal degree in co-relation 489. Up to 361 conditions per place. [2025-03-13 21:44:17,629 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 48 selfloop transitions, 6 changer transitions 3/58 dead transitions. [2025-03-13 21:44:17,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 58 transitions, 279 flow [2025-03-13 21:44:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:44:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:44:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-13 21:44:17,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608 [2025-03-13 21:44:17,632 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 74 flow. Second operand 5 states and 76 transitions. [2025-03-13 21:44:17,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 58 transitions, 279 flow [2025-03-13 21:44:17,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 58 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:44:17,634 INFO L231 Difference]: Finished difference. Result has 31 places, 28 transitions, 125 flow [2025-03-13 21:44:17,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=31, PETRI_TRANSITIONS=28} [2025-03-13 21:44:17,635 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2025-03-13 21:44:17,635 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 28 transitions, 125 flow [2025-03-13 21:44:17,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:44:17,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:17,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:17,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:44:17,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:17,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1259039067, now seen corresponding path program 1 times [2025-03-13 21:44:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097269111] [2025-03-13 21:44:17,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:17,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:17,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:44:17,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:44:17,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:17,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:17,720 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:44:17,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:17,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097269111] [2025-03-13 21:44:17,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097269111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:17,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250795728] [2025-03-13 21:44:17,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:17,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:17,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:17,723 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:44:17,724 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:44:17,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:44:17,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:44:17,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:17,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:17,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:44:17,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:17,805 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:44:17,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:17,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250795728] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:17,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:44:17,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-03-13 21:44:17,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734460766] [2025-03-13 21:44:17,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:17,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:44:17,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:17,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:44:17,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:44:17,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:17,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:17,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:17,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:17,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:17,965 INFO L124 PetriNetUnfolderBase]: 535/816 cut-off events. [2025-03-13 21:44:17,966 INFO L125 PetriNetUnfolderBase]: For 868/868 co-relation queries the response was YES. [2025-03-13 21:44:17,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2585 conditions, 816 events. 535/816 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3037 event pairs, 139 based on Foata normal form. 38/854 useless extension candidates. Maximal degree in co-relation 880. Up to 467 conditions per place. [2025-03-13 21:44:17,970 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 41 selfloop transitions, 5 changer transitions 8/55 dead transitions. [2025-03-13 21:44:17,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 55 transitions, 339 flow [2025-03-13 21:44:17,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:44:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:44:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-03-13 21:44:17,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-03-13 21:44:17,971 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 125 flow. Second operand 4 states and 64 transitions. [2025-03-13 21:44:17,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 55 transitions, 339 flow [2025-03-13 21:44:17,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 55 transitions, 327 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-13 21:44:17,973 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 141 flow [2025-03-13 21:44:17,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2025-03-13 21:44:17,974 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 7 predicate places. [2025-03-13 21:44:17,974 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 141 flow [2025-03-13 21:44:17,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:17,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:17,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:17,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:44:18,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:18,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:18,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:18,180 INFO L85 PathProgramCache]: Analyzing trace with hash 945933280, now seen corresponding path program 1 times [2025-03-13 21:44:18,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:18,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125973094] [2025-03-13 21:44:18,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:18,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:18,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:44:18,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:44:18,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:18,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:18,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:18,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125973094] [2025-03-13 21:44:18,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125973094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:18,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:18,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:44:18,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112921967] [2025-03-13 21:44:18,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:18,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:44:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:18,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:44:18,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:44:18,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:18,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:44:18,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:18,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:18,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:18,388 INFO L124 PetriNetUnfolderBase]: 570/858 cut-off events. [2025-03-13 21:44:18,388 INFO L125 PetriNetUnfolderBase]: For 1901/1901 co-relation queries the response was YES. [2025-03-13 21:44:18,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 858 events. 570/858 cut-off events. For 1901/1901 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3257 event pairs, 241 based on Foata normal form. 16/874 useless extension candidates. Maximal degree in co-relation 1490. Up to 636 conditions per place. [2025-03-13 21:44:18,392 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 46 selfloop transitions, 12 changer transitions 3/62 dead transitions. [2025-03-13 21:44:18,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 454 flow [2025-03-13 21:44:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:44:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:44:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-03-13 21:44:18,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.568 [2025-03-13 21:44:18,394 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 141 flow. Second operand 5 states and 71 transitions. [2025-03-13 21:44:18,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 454 flow [2025-03-13 21:44:18,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 62 transitions, 442 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:44:18,399 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 232 flow [2025-03-13 21:44:18,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-03-13 21:44:18,400 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-03-13 21:44:18,400 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 232 flow [2025-03-13 21:44:18,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:44:18,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:18,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:18,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:44:18,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:18,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:18,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1493177833, now seen corresponding path program 2 times [2025-03-13 21:44:18,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:18,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293546012] [2025-03-13 21:44:18,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:44:18,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:18,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:44:18,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:44:18,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:44:18,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:18,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:18,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293546012] [2025-03-13 21:44:18,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293546012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:18,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:18,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:44:18,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696812118] [2025-03-13 21:44:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:18,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:44:18,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:18,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:44:18,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:44:18,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:18,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:18,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:18,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:18,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:18,599 INFO L124 PetriNetUnfolderBase]: 642/962 cut-off events. [2025-03-13 21:44:18,601 INFO L125 PetriNetUnfolderBase]: For 2669/2669 co-relation queries the response was YES. [2025-03-13 21:44:18,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4004 conditions, 962 events. 642/962 cut-off events. For 2669/2669 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3680 event pairs, 155 based on Foata normal form. 32/994 useless extension candidates. Maximal degree in co-relation 2949. Up to 612 conditions per place. [2025-03-13 21:44:18,607 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 50 selfloop transitions, 8 changer transitions 8/67 dead transitions. [2025-03-13 21:44:18,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 540 flow [2025-03-13 21:44:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:44:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:44:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-03-13 21:44:18,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-03-13 21:44:18,608 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 232 flow. Second operand 4 states and 64 transitions. [2025-03-13 21:44:18,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 540 flow [2025-03-13 21:44:18,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 506 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-13 21:44:18,614 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 266 flow [2025-03-13 21:44:18,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-03-13 21:44:18,615 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 15 predicate places. [2025-03-13 21:44:18,616 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 266 flow [2025-03-13 21:44:18,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:18,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:18,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:18,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:44:18,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:18,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash 281248874, now seen corresponding path program 2 times [2025-03-13 21:44:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:18,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142248619] [2025-03-13 21:44:18,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:44:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:18,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:44:18,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:44:18,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:44:18,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:18,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:18,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142248619] [2025-03-13 21:44:18,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142248619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:18,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:18,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:44:18,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630494882] [2025-03-13 21:44:18,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:18,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:44:18,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:18,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:44:18,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:44:18,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:18,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:18,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:18,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:18,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:18,811 INFO L124 PetriNetUnfolderBase]: 787/1203 cut-off events. [2025-03-13 21:44:18,811 INFO L125 PetriNetUnfolderBase]: For 4535/4535 co-relation queries the response was YES. [2025-03-13 21:44:18,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4988 conditions, 1203 events. 787/1203 cut-off events. For 4535/4535 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5107 event pairs, 233 based on Foata normal form. 48/1251 useless extension candidates. Maximal degree in co-relation 3634. Up to 686 conditions per place. [2025-03-13 21:44:18,819 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 58 selfloop transitions, 8 changer transitions 6/73 dead transitions. [2025-03-13 21:44:18,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 621 flow [2025-03-13 21:44:18,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:44:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:44:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-13 21:44:18,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-03-13 21:44:18,821 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 266 flow. Second operand 4 states and 61 transitions. [2025-03-13 21:44:18,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 621 flow [2025-03-13 21:44:18,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 73 transitions, 614 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:44:18,827 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 319 flow [2025-03-13 21:44:18,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2025-03-13 21:44:18,829 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 19 predicate places. [2025-03-13 21:44:18,829 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 319 flow [2025-03-13 21:44:18,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:18,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:18,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:18,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:44:18,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:18,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1714781294, now seen corresponding path program 3 times [2025-03-13 21:44:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:18,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228334205] [2025-03-13 21:44:18,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:44:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:18,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:44:18,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:44:18,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:44:18,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:18,937 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:44:18,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:18,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228334205] [2025-03-13 21:44:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228334205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567392436] [2025-03-13 21:44:18,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:44:18,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:18,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:18,940 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:44:18,941 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:44:18,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:44:18,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:44:18,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:44:18,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:18,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:44:18,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:19,015 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:44:19,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:19,067 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:44:19,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567392436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:19,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:19,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2025-03-13 21:44:19,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814319476] [2025-03-13 21:44:19,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:19,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:44:19,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:19,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:44:19,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:44:19,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:19,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 319 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:44:19,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:19,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:19,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:19,326 INFO L124 PetriNetUnfolderBase]: 1061/1603 cut-off events. [2025-03-13 21:44:19,326 INFO L125 PetriNetUnfolderBase]: For 7237/7237 co-relation queries the response was YES. [2025-03-13 21:44:19,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7736 conditions, 1603 events. 1061/1603 cut-off events. For 7237/7237 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6921 event pairs, 244 based on Foata normal form. 39/1642 useless extension candidates. Maximal degree in co-relation 5859. Up to 872 conditions per place. [2025-03-13 21:44:19,336 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 80 selfloop transitions, 45 changer transitions 10/136 dead transitions. [2025-03-13 21:44:19,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 136 transitions, 1402 flow [2025-03-13 21:44:19,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:44:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:44:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2025-03-13 21:44:19,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.516 [2025-03-13 21:44:19,338 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 319 flow. Second operand 10 states and 129 transitions. [2025-03-13 21:44:19,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 136 transitions, 1402 flow [2025-03-13 21:44:19,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 136 transitions, 1300 flow, removed 38 selfloop flow, removed 2 redundant places. [2025-03-13 21:44:19,347 INFO L231 Difference]: Finished difference. Result has 59 places, 75 transitions, 806 flow [2025-03-13 21:44:19,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=806, PETRI_PLACES=59, PETRI_TRANSITIONS=75} [2025-03-13 21:44:19,348 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 31 predicate places. [2025-03-13 21:44:19,348 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 75 transitions, 806 flow [2025-03-13 21:44:19,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:44:19,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:19,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:19,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:44:19,549 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,SelfDestructingSolverStorable6 [2025-03-13 21:44:19,549 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:19,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1644589416, now seen corresponding path program 2 times [2025-03-13 21:44:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:19,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047802926] [2025-03-13 21:44:19,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:44:19,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:19,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:44:19,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:44:19,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:44:19,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:19,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:19,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047802926] [2025-03-13 21:44:19,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047802926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:19,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:19,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:44:19,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120279535] [2025-03-13 21:44:19,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:19,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:44:19,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:19,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:44:19,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:44:19,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:19,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 75 transitions, 806 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:19,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:19,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:19,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:19,741 INFO L124 PetriNetUnfolderBase]: 1065/1583 cut-off events. [2025-03-13 21:44:19,741 INFO L125 PetriNetUnfolderBase]: For 10268/10268 co-relation queries the response was YES. [2025-03-13 21:44:19,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8896 conditions, 1583 events. 1065/1583 cut-off events. For 10268/10268 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6656 event pairs, 332 based on Foata normal form. 36/1619 useless extension candidates. Maximal degree in co-relation 7189. Up to 1064 conditions per place. [2025-03-13 21:44:19,750 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 65 selfloop transitions, 32 changer transitions 7/105 dead transitions. [2025-03-13 21:44:19,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 105 transitions, 1285 flow [2025-03-13 21:44:19,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:44:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:44:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-13 21:44:19,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-13 21:44:19,751 INFO L175 Difference]: Start difference. First operand has 59 places, 75 transitions, 806 flow. Second operand 4 states and 60 transitions. [2025-03-13 21:44:19,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 105 transitions, 1285 flow [2025-03-13 21:44:19,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 105 transitions, 1231 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-03-13 21:44:19,764 INFO L231 Difference]: Finished difference. Result has 63 places, 82 transitions, 961 flow [2025-03-13 21:44:19,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=961, PETRI_PLACES=63, PETRI_TRANSITIONS=82} [2025-03-13 21:44:19,765 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 35 predicate places. [2025-03-13 21:44:19,765 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 82 transitions, 961 flow [2025-03-13 21:44:19,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:19,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:19,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:19,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:44:19,765 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:19,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1973852894, now seen corresponding path program 4 times [2025-03-13 21:44:19,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:19,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809502521] [2025-03-13 21:44:19,765 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:44:19,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:19,769 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:44:19,773 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:44:19,773 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:44:19,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:19,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:19,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809502521] [2025-03-13 21:44:19,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809502521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:19,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:19,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:44:19,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884263129] [2025-03-13 21:44:19,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:19,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:44:19,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:19,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:44:19,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:44:19,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:19,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 82 transitions, 961 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:44:19,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:19,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:19,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:19,983 INFO L124 PetriNetUnfolderBase]: 1106/1651 cut-off events. [2025-03-13 21:44:19,983 INFO L125 PetriNetUnfolderBase]: For 13034/13034 co-relation queries the response was YES. [2025-03-13 21:44:19,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9728 conditions, 1651 events. 1106/1651 cut-off events. For 13034/13034 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6904 event pairs, 317 based on Foata normal form. 50/1701 useless extension candidates. Maximal degree in co-relation 7179. Up to 952 conditions per place. [2025-03-13 21:44:19,994 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 86 selfloop transitions, 26 changer transitions 5/118 dead transitions. [2025-03-13 21:44:19,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 118 transitions, 1554 flow [2025-03-13 21:44:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:44:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:44:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-03-13 21:44:19,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-03-13 21:44:19,995 INFO L175 Difference]: Start difference. First operand has 63 places, 82 transitions, 961 flow. Second operand 4 states and 58 transitions. [2025-03-13 21:44:19,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 118 transitions, 1554 flow [2025-03-13 21:44:20,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 118 transitions, 1524 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:44:20,009 INFO L231 Difference]: Finished difference. Result has 65 places, 84 transitions, 1098 flow [2025-03-13 21:44:20,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1098, PETRI_PLACES=65, PETRI_TRANSITIONS=84} [2025-03-13 21:44:20,010 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 37 predicate places. [2025-03-13 21:44:20,010 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 84 transitions, 1098 flow [2025-03-13 21:44:20,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:44:20,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:20,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:20,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:44:20,010 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:20,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:20,011 INFO L85 PathProgramCache]: Analyzing trace with hash 817700610, now seen corresponding path program 5 times [2025-03-13 21:44:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:20,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463789583] [2025-03-13 21:44:20,011 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:44:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:20,018 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:44:20,021 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:44:20,021 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:44:20,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:20,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463789583] [2025-03-13 21:44:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463789583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:20,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:20,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:44:20,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696362521] [2025-03-13 21:44:20,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:20,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:44:20,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:20,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:44:20,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:44:20,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:20,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 84 transitions, 1098 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:20,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:20,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:20,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:20,254 INFO L124 PetriNetUnfolderBase]: 1211/1801 cut-off events. [2025-03-13 21:44:20,254 INFO L125 PetriNetUnfolderBase]: For 18651/18651 co-relation queries the response was YES. [2025-03-13 21:44:20,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11706 conditions, 1801 events. 1211/1801 cut-off events. For 18651/18651 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7750 event pairs, 412 based on Foata normal form. 63/1864 useless extension candidates. Maximal degree in co-relation 8575. Up to 1337 conditions per place. [2025-03-13 21:44:20,266 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 110 selfloop transitions, 38 changer transitions 1/150 dead transitions. [2025-03-13 21:44:20,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 150 transitions, 2245 flow [2025-03-13 21:44:20,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:44:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:44:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-13 21:44:20,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-13 21:44:20,267 INFO L175 Difference]: Start difference. First operand has 65 places, 84 transitions, 1098 flow. Second operand 4 states and 60 transitions. [2025-03-13 21:44:20,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 150 transitions, 2245 flow [2025-03-13 21:44:20,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 150 transitions, 2143 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-03-13 21:44:20,290 INFO L231 Difference]: Finished difference. Result has 68 places, 107 transitions, 1545 flow [2025-03-13 21:44:20,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1545, PETRI_PLACES=68, PETRI_TRANSITIONS=107} [2025-03-13 21:44:20,292 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 40 predicate places. [2025-03-13 21:44:20,292 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 107 transitions, 1545 flow [2025-03-13 21:44:20,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:20,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:20,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:20,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:44:20,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:20,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2029250542, now seen corresponding path program 6 times [2025-03-13 21:44:20,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:20,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721666831] [2025-03-13 21:44:20,293 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:44:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:20,298 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:44:20,303 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:44:20,303 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:44:20,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:20,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:20,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721666831] [2025-03-13 21:44:20,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721666831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:20,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:20,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:44:20,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377145320] [2025-03-13 21:44:20,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:20,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:44:20,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:20,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:44:20,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:44:20,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:20,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 107 transitions, 1545 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:20,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:20,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:20,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:20,529 INFO L124 PetriNetUnfolderBase]: 1275/1858 cut-off events. [2025-03-13 21:44:20,529 INFO L125 PetriNetUnfolderBase]: For 19222/19222 co-relation queries the response was YES. [2025-03-13 21:44:20,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12705 conditions, 1858 events. 1275/1858 cut-off events. For 19222/19222 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 7774 event pairs, 229 based on Foata normal form. 55/1913 useless extension candidates. Maximal degree in co-relation 11554. Up to 1363 conditions per place. [2025-03-13 21:44:20,543 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 115 selfloop transitions, 26 changer transitions 3/145 dead transitions. [2025-03-13 21:44:20,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 145 transitions, 2271 flow [2025-03-13 21:44:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:44:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:44:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-13 21:44:20,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-03-13 21:44:20,545 INFO L175 Difference]: Start difference. First operand has 68 places, 107 transitions, 1545 flow. Second operand 4 states and 61 transitions. [2025-03-13 21:44:20,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 145 transitions, 2271 flow [2025-03-13 21:44:20,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 145 transitions, 2113 flow, removed 59 selfloop flow, removed 2 redundant places. [2025-03-13 21:44:20,565 INFO L231 Difference]: Finished difference. Result has 71 places, 111 transitions, 1570 flow [2025-03-13 21:44:20,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1570, PETRI_PLACES=71, PETRI_TRANSITIONS=111} [2025-03-13 21:44:20,565 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 43 predicate places. [2025-03-13 21:44:20,565 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 111 transitions, 1570 flow [2025-03-13 21:44:20,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:20,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:20,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:20,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:44:20,566 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:20,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash 411196332, now seen corresponding path program 1 times [2025-03-13 21:44:20,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:20,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757576518] [2025-03-13 21:44:20,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:20,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:20,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:44:20,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:44:20,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:20,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:20,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:20,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757576518] [2025-03-13 21:44:20,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757576518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:20,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829702558] [2025-03-13 21:44:20,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:20,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:20,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:20,640 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:44:20,642 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:44:20,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:44:20,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:44:20,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:20,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:20,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:44:20,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:20,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:20,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829702558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:20,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:20,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-13 21:44:20,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866579234] [2025-03-13 21:44:20,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:20,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:44:20,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:20,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:44:20,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:44:20,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:20,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 111 transitions, 1570 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:44:20,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:20,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:20,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:20,981 INFO L124 PetriNetUnfolderBase]: 1256/1803 cut-off events. [2025-03-13 21:44:20,981 INFO L125 PetriNetUnfolderBase]: For 19512/19512 co-relation queries the response was YES. [2025-03-13 21:44:20,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12099 conditions, 1803 events. 1256/1803 cut-off events. For 19512/19512 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7227 event pairs, 294 based on Foata normal form. 43/1846 useless extension candidates. Maximal degree in co-relation 11455. Up to 1158 conditions per place. [2025-03-13 21:44:20,992 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 88 selfloop transitions, 68 changer transitions 1/158 dead transitions. [2025-03-13 21:44:20,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 158 transitions, 2470 flow [2025-03-13 21:44:20,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:44:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:44:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2025-03-13 21:44:20,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-13 21:44:20,993 INFO L175 Difference]: Start difference. First operand has 71 places, 111 transitions, 1570 flow. Second operand 6 states and 78 transitions. [2025-03-13 21:44:20,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 158 transitions, 2470 flow [2025-03-13 21:44:21,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 158 transitions, 2379 flow, removed 34 selfloop flow, removed 2 redundant places. [2025-03-13 21:44:21,011 INFO L231 Difference]: Finished difference. Result has 76 places, 130 transitions, 2056 flow [2025-03-13 21:44:21,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1521, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2056, PETRI_PLACES=76, PETRI_TRANSITIONS=130} [2025-03-13 21:44:21,013 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 48 predicate places. [2025-03-13 21:44:21,013 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 130 transitions, 2056 flow [2025-03-13 21:44:21,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:44:21,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:21,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:21,020 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:44:21,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:21,214 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:21,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash 131100775, now seen corresponding path program 1 times [2025-03-13 21:44:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:21,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689634935] [2025-03-13 21:44:21,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:21,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:44:21,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:44:21,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:21,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689634935] [2025-03-13 21:44:21,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689634935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156860526] [2025-03-13 21:44:21,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:21,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:21,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:21,380 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:44:21,382 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:44:21,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:44:21,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:44:21,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:21,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:21,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:44:21,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:21,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:22,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156860526] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:22,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:22,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 12 [2025-03-13 21:44:22,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267636176] [2025-03-13 21:44:22,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:22,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:44:22,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:22,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:44:22,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:44:22,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:22,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 130 transitions, 2056 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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:44:22,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:22,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:22,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:22,369 INFO L124 PetriNetUnfolderBase]: 1801/2600 cut-off events. [2025-03-13 21:44:22,369 INFO L125 PetriNetUnfolderBase]: For 25084/25084 co-relation queries the response was YES. [2025-03-13 21:44:22,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17461 conditions, 2600 events. 1801/2600 cut-off events. For 25084/25084 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 11049 event pairs, 196 based on Foata normal form. 2/2602 useless extension candidates. Maximal degree in co-relation 16802. Up to 1923 conditions per place. [2025-03-13 21:44:22,383 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 159 selfloop transitions, 66 changer transitions 2/228 dead transitions. [2025-03-13 21:44:22,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 228 transitions, 3416 flow [2025-03-13 21:44:22,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:44:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:44:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2025-03-13 21:44:22,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5955555555555555 [2025-03-13 21:44:22,385 INFO L175 Difference]: Start difference. First operand has 76 places, 130 transitions, 2056 flow. Second operand 9 states and 134 transitions. [2025-03-13 21:44:22,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 228 transitions, 3416 flow [2025-03-13 21:44:22,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 228 transitions, 3169 flow, removed 78 selfloop flow, removed 5 redundant places. [2025-03-13 21:44:22,415 INFO L231 Difference]: Finished difference. Result has 82 places, 172 transitions, 2709 flow [2025-03-13 21:44:22,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2709, PETRI_PLACES=82, PETRI_TRANSITIONS=172} [2025-03-13 21:44:22,417 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 54 predicate places. [2025-03-13 21:44:22,417 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 172 transitions, 2709 flow [2025-03-13 21:44:22,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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:44:22,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:22,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:22,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-13 21:44:22,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:22,618 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:22,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1125755373, now seen corresponding path program 2 times [2025-03-13 21:44:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:22,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658511149] [2025-03-13 21:44:22,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:44:22,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:22,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:44:22,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:44:22,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:44:22,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:22,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:22,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658511149] [2025-03-13 21:44:22,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658511149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:22,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934251808] [2025-03-13 21:44:22,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:44:22,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:22,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:22,763 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:44:22,765 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:44:22,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:44:22,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:44:22,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:44:22,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:22,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:44:22,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:22,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:23,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934251808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:23,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:23,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 12 [2025-03-13 21:44:23,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195265073] [2025-03-13 21:44:23,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:23,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:44:23,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:23,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:44:23,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:44:23,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:23,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 172 transitions, 2709 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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:44:23,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:23,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:23,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:23,639 INFO L124 PetriNetUnfolderBase]: 2097/3032 cut-off events. [2025-03-13 21:44:23,639 INFO L125 PetriNetUnfolderBase]: For 29516/29516 co-relation queries the response was YES. [2025-03-13 21:44:23,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20631 conditions, 3032 events. 2097/3032 cut-off events. For 29516/29516 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 13196 event pairs, 317 based on Foata normal form. 2/3034 useless extension candidates. Maximal degree in co-relation 20035. Up to 2434 conditions per place. [2025-03-13 21:44:23,654 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 178 selfloop transitions, 61 changer transitions 2/242 dead transitions. [2025-03-13 21:44:23,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 242 transitions, 3726 flow [2025-03-13 21:44:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:44:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:44:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2025-03-13 21:44:23,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822222222222222 [2025-03-13 21:44:23,656 INFO L175 Difference]: Start difference. First operand has 82 places, 172 transitions, 2709 flow. Second operand 9 states and 131 transitions. [2025-03-13 21:44:23,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 242 transitions, 3726 flow [2025-03-13 21:44:23,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 242 transitions, 3498 flow, removed 102 selfloop flow, removed 1 redundant places. [2025-03-13 21:44:23,710 INFO L231 Difference]: Finished difference. Result has 92 places, 191 transitions, 2947 flow [2025-03-13 21:44:23,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2481, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2947, PETRI_PLACES=92, PETRI_TRANSITIONS=191} [2025-03-13 21:44:23,712 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 64 predicate places. [2025-03-13 21:44:23,712 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 191 transitions, 2947 flow [2025-03-13 21:44:23,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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:44:23,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:23,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:23,718 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:44:23,917 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,SelfDestructingSolverStorable13 [2025-03-13 21:44:23,917 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:23,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1758911339, now seen corresponding path program 3 times [2025-03-13 21:44:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:23,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710442891] [2025-03-13 21:44:23,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:44:23,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:23,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:44:23,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:44:23,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:44:23,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:24,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:24,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710442891] [2025-03-13 21:44:24,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710442891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:24,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345059000] [2025-03-13 21:44:24,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:44:24,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:24,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:24,035 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:44:24,038 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:44:24,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:44:24,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:44:24,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:44:24,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:24,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:44:24,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:24,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:24,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345059000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:24,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:24,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 12 [2025-03-13 21:44:24,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372933216] [2025-03-13 21:44:24,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:24,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:44:24,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:24,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:44:24,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:44:24,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:24,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 191 transitions, 2947 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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:44:24,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:24,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:24,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:25,131 INFO L124 PetriNetUnfolderBase]: 2608/3776 cut-off events. [2025-03-13 21:44:25,131 INFO L125 PetriNetUnfolderBase]: For 36687/36687 co-relation queries the response was YES. [2025-03-13 21:44:25,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25269 conditions, 3776 events. 2608/3776 cut-off events. For 36687/36687 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 17125 event pairs, 472 based on Foata normal form. 2/3778 useless extension candidates. Maximal degree in co-relation 24767. Up to 3141 conditions per place. [2025-03-13 21:44:25,151 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 218 selfloop transitions, 70 changer transitions 2/291 dead transitions. [2025-03-13 21:44:25,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 291 transitions, 4553 flow [2025-03-13 21:44:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:44:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:44:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2025-03-13 21:44:25,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822222222222222 [2025-03-13 21:44:25,153 INFO L175 Difference]: Start difference. First operand has 92 places, 191 transitions, 2947 flow. Second operand 9 states and 131 transitions. [2025-03-13 21:44:25,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 291 transitions, 4553 flow [2025-03-13 21:44:25,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 291 transitions, 4354 flow, removed 74 selfloop flow, removed 2 redundant places. [2025-03-13 21:44:25,196 INFO L231 Difference]: Finished difference. Result has 102 places, 237 transitions, 3753 flow [2025-03-13 21:44:25,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2748, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3753, PETRI_PLACES=102, PETRI_TRANSITIONS=237} [2025-03-13 21:44:25,196 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 74 predicate places. [2025-03-13 21:44:25,197 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 237 transitions, 3753 flow [2025-03-13 21:44:25,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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:44:25,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:25,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:25,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-13 21:44:25,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-13 21:44:25,401 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:25,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1683857365, now seen corresponding path program 4 times [2025-03-13 21:44:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:25,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142490305] [2025-03-13 21:44:25,401 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:44:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:25,405 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:44:25,409 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:44:25,409 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:44:25,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:25,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:25,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142490305] [2025-03-13 21:44:25,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142490305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:25,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466687019] [2025-03-13 21:44:25,524 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:44:25,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:25,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:25,528 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:44:25,530 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:44:25,556 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:44:25,572 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:44:25,573 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:44:25,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:25,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:44:25,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:25,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466687019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:26,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 12 [2025-03-13 21:44:26,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418728035] [2025-03-13 21:44:26,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:26,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:44:26,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:26,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:44:26,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:44:26,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:26,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 237 transitions, 3753 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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:44:26,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:26,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:26,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:26,518 INFO L124 PetriNetUnfolderBase]: 2888/4184 cut-off events. [2025-03-13 21:44:26,518 INFO L125 PetriNetUnfolderBase]: For 42463/42463 co-relation queries the response was YES. [2025-03-13 21:44:26,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28404 conditions, 4184 events. 2888/4184 cut-off events. For 42463/42463 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 19309 event pairs, 587 based on Foata normal form. 2/4186 useless extension candidates. Maximal degree in co-relation 27871. Up to 3668 conditions per place. [2025-03-13 21:44:26,586 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 236 selfloop transitions, 66 changer transitions 2/305 dead transitions. [2025-03-13 21:44:26,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 305 transitions, 5016 flow [2025-03-13 21:44:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:44:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:44:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2025-03-13 21:44:26,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5644444444444444 [2025-03-13 21:44:26,588 INFO L175 Difference]: Start difference. First operand has 102 places, 237 transitions, 3753 flow. Second operand 9 states and 127 transitions. [2025-03-13 21:44:26,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 305 transitions, 5016 flow [2025-03-13 21:44:26,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 305 transitions, 4716 flow, removed 138 selfloop flow, removed 1 redundant places. [2025-03-13 21:44:26,643 INFO L231 Difference]: Finished difference. Result has 112 places, 257 transitions, 4006 flow [2025-03-13 21:44:26,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3453, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4006, PETRI_PLACES=112, PETRI_TRANSITIONS=257} [2025-03-13 21:44:26,643 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 84 predicate places. [2025-03-13 21:44:26,643 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 257 transitions, 4006 flow [2025-03-13 21:44:26,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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:44:26,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:26,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:26,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-13 21:44:26,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:26,844 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:26,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:26,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2051466005, now seen corresponding path program 5 times [2025-03-13 21:44:26,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:26,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690306580] [2025-03-13 21:44:26,845 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:44:26,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:26,848 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:44:26,851 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:44:26,851 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:44:26,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:26,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:26,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690306580] [2025-03-13 21:44:26,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690306580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:26,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254976877] [2025-03-13 21:44:26,953 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:44:26,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:26,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:26,956 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:44:26,957 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:44:26,984 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:44:27,001 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:44:27,001 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:44:27,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:27,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:44:27,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:27,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:28,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254976877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:28,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:28,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 11 [2025-03-13 21:44:28,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536738020] [2025-03-13 21:44:28,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:28,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:44:28,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:28,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:44:28,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:44:28,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:28,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 257 transitions, 4006 flow. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 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:44:28,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:28,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:28,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:28,584 INFO L124 PetriNetUnfolderBase]: 3228/4673 cut-off events. [2025-03-13 21:44:28,585 INFO L125 PetriNetUnfolderBase]: For 46858/46858 co-relation queries the response was YES. [2025-03-13 21:44:28,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31513 conditions, 4673 events. 3228/4673 cut-off events. For 46858/46858 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 22058 event pairs, 723 based on Foata normal form. 1/4674 useless extension candidates. Maximal degree in co-relation 30936. Up to 4237 conditions per place. [2025-03-13 21:44:28,610 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 268 selfloop transitions, 60 changer transitions 1/330 dead transitions. [2025-03-13 21:44:28,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 330 transitions, 5568 flow [2025-03-13 21:44:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:44:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:44:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2025-03-13 21:44:28,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-13 21:44:28,611 INFO L175 Difference]: Start difference. First operand has 112 places, 257 transitions, 4006 flow. Second operand 8 states and 110 transitions. [2025-03-13 21:44:28,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 330 transitions, 5568 flow [2025-03-13 21:44:28,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 330 transitions, 5308 flow, removed 103 selfloop flow, removed 2 redundant places. [2025-03-13 21:44:28,671 INFO L231 Difference]: Finished difference. Result has 120 places, 293 transitions, 4646 flow [2025-03-13 21:44:28,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3746, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4646, PETRI_PLACES=120, PETRI_TRANSITIONS=293} [2025-03-13 21:44:28,671 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 92 predicate places. [2025-03-13 21:44:28,671 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 293 transitions, 4646 flow [2025-03-13 21:44:28,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 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:44:28,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:28,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:28,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-13 21:44:28,876 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,SelfDestructingSolverStorable16 [2025-03-13 21:44:28,876 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:28,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1595269735, now seen corresponding path program 6 times [2025-03-13 21:44:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934561793] [2025-03-13 21:44:28,876 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:44:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:28,879 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:44:28,885 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:44:28,885 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:44:28,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:28,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:28,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934561793] [2025-03-13 21:44:28,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934561793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:28,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021452648] [2025-03-13 21:44:28,980 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:44:28,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:28,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:28,982 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:44:28,984 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:44:29,009 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:44:29,025 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:44:29,025 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:44:29,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:29,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:44:29,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:29,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:30,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021452648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:30,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:30,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 12 [2025-03-13 21:44:30,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742671421] [2025-03-13 21:44:30,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:30,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:44:30,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:30,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:44:30,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:44:30,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:30,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 293 transitions, 4646 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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:44:30,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:30,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:30,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:30,684 INFO L124 PetriNetUnfolderBase]: 3474/5032 cut-off events. [2025-03-13 21:44:30,684 INFO L125 PetriNetUnfolderBase]: For 52689/52689 co-relation queries the response was YES. [2025-03-13 21:44:30,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34211 conditions, 5032 events. 3474/5032 cut-off events. For 52689/52689 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 24080 event pairs, 831 based on Foata normal form. 1/5033 useless extension candidates. Maximal degree in co-relation 33615. Up to 4574 conditions per place. [2025-03-13 21:44:30,706 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 286 selfloop transitions, 59 changer transitions 1/347 dead transitions. [2025-03-13 21:44:30,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 347 transitions, 5919 flow [2025-03-13 21:44:30,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:44:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:44:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-03-13 21:44:30,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.555 [2025-03-13 21:44:30,707 INFO L175 Difference]: Start difference. First operand has 120 places, 293 transitions, 4646 flow. Second operand 8 states and 111 transitions. [2025-03-13 21:44:30,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 347 transitions, 5919 flow [2025-03-13 21:44:30,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 347 transitions, 5613 flow, removed 153 selfloop flow, removed 0 redundant places. [2025-03-13 21:44:30,773 INFO L231 Difference]: Finished difference. Result has 129 places, 309 transitions, 4851 flow [2025-03-13 21:44:30,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=4340, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4851, PETRI_PLACES=129, PETRI_TRANSITIONS=309} [2025-03-13 21:44:30,773 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 101 predicate places. [2025-03-13 21:44:30,774 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 309 transitions, 4851 flow [2025-03-13 21:44:30,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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:44:30,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:30,774 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:30,780 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:44:30,974 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,SelfDestructingSolverStorable17 [2025-03-13 21:44:30,974 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:30,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:30,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1215081676, now seen corresponding path program 7 times [2025-03-13 21:44:30,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:30,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311720178] [2025-03-13 21:44:30,975 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:44:30,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:30,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:44:30,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:44:30,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:30,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311720178] [2025-03-13 21:44:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311720178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56480650] [2025-03-13 21:44:31,059 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:44:31,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:31,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:31,062 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:44:31,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-13 21:44:31,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:44:31,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:44:31,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:31,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:31,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:44:31,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:31,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:31,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56480650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:31,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:31,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-13 21:44:31,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029142809] [2025-03-13 21:44:31,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:31,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:44:31,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:31,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:44:31,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:44:31,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:31,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 309 transitions, 4851 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:31,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:31,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:31,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:32,175 INFO L124 PetriNetUnfolderBase]: 5389/7668 cut-off events. [2025-03-13 21:44:32,175 INFO L125 PetriNetUnfolderBase]: For 88644/88644 co-relation queries the response was YES. [2025-03-13 21:44:32,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51902 conditions, 7668 events. 5389/7668 cut-off events. For 88644/88644 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 37848 event pairs, 500 based on Foata normal form. 68/7736 useless extension candidates. Maximal degree in co-relation 50671. Up to 2583 conditions per place. [2025-03-13 21:44:32,222 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 553 selfloop transitions, 155 changer transitions 0/709 dead transitions. [2025-03-13 21:44:32,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 709 transitions, 11747 flow [2025-03-13 21:44:32,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 21:44:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 21:44:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 191 transitions. [2025-03-13 21:44:32,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5876923076923077 [2025-03-13 21:44:32,223 INFO L175 Difference]: Start difference. First operand has 129 places, 309 transitions, 4851 flow. Second operand 13 states and 191 transitions. [2025-03-13 21:44:32,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 709 transitions, 11747 flow [2025-03-13 21:44:32,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 709 transitions, 10993 flow, removed 352 selfloop flow, removed 2 redundant places. [2025-03-13 21:44:32,359 INFO L231 Difference]: Finished difference. Result has 147 places, 395 transitions, 6239 flow [2025-03-13 21:44:32,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=4574, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6239, PETRI_PLACES=147, PETRI_TRANSITIONS=395} [2025-03-13 21:44:32,360 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 119 predicate places. [2025-03-13 21:44:32,360 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 395 transitions, 6239 flow [2025-03-13 21:44:32,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:32,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:32,360 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:32,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-13 21:44:32,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:32,561 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:32,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:32,561 INFO L85 PathProgramCache]: Analyzing trace with hash -972042493, now seen corresponding path program 8 times [2025-03-13 21:44:32,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:32,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623249616] [2025-03-13 21:44:32,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:44:32,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:32,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:44:32,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:44:32,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:44:32,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:32,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:32,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623249616] [2025-03-13 21:44:32,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623249616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:32,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060329917] [2025-03-13 21:44:32,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:44:32,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:32,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:32,684 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:44:32,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-13 21:44:32,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:44:32,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:44:32,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:44:32,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:32,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:44:32,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:32,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:32,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:32,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060329917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:32,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:32,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-03-13 21:44:32,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790401584] [2025-03-13 21:44:32,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:32,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-13 21:44:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:32,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-13 21:44:32,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-13 21:44:32,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:32,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 395 transitions, 6239 flow. Second operand has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 17 states have internal predecessors, (106), 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:44:32,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:32,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:32,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:34,026 INFO L124 PetriNetUnfolderBase]: 6380/8933 cut-off events. [2025-03-13 21:44:34,026 INFO L125 PetriNetUnfolderBase]: For 125035/125035 co-relation queries the response was YES. [2025-03-13 21:44:34,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67596 conditions, 8933 events. 6380/8933 cut-off events. For 125035/125035 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 43205 event pairs, 1487 based on Foata normal form. 108/9041 useless extension candidates. Maximal degree in co-relation 66054. Up to 6226 conditions per place. [2025-03-13 21:44:34,094 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 504 selfloop transitions, 280 changer transitions 0/785 dead transitions. [2025-03-13 21:44:34,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 785 transitions, 13275 flow [2025-03-13 21:44:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:44:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:44:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 249 transitions. [2025-03-13 21:44:34,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2025-03-13 21:44:34,095 INFO L175 Difference]: Start difference. First operand has 147 places, 395 transitions, 6239 flow. Second operand 18 states and 249 transitions. [2025-03-13 21:44:34,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 785 transitions, 13275 flow [2025-03-13 21:44:34,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 785 transitions, 12677 flow, removed 267 selfloop flow, removed 1 redundant places. [2025-03-13 21:44:34,428 INFO L231 Difference]: Finished difference. Result has 170 places, 555 transitions, 9044 flow [2025-03-13 21:44:34,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=5859, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=9044, PETRI_PLACES=170, PETRI_TRANSITIONS=555} [2025-03-13 21:44:34,429 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 142 predicate places. [2025-03-13 21:44:34,429 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 555 transitions, 9044 flow [2025-03-13 21:44:34,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 17 states have internal predecessors, (106), 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:44:34,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:34,429 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:34,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-13 21:44:34,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:34,630 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:34,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1865881990, now seen corresponding path program 9 times [2025-03-13 21:44:34,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:34,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838619315] [2025-03-13 21:44:34,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:44:34,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:34,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:44:34,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:44:34,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:44:34,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:34,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:34,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838619315] [2025-03-13 21:44:34,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838619315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:34,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028919233] [2025-03-13 21:44:34,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:44:34,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:34,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:34,693 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:44:34,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-13 21:44:34,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:44:34,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:44:34,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:44:34,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:34,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:44:34,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:34,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:34,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028919233] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:34,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:34,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-13 21:44:34,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815316115] [2025-03-13 21:44:34,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:34,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:44:34,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:34,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:44:34,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:44:34,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:34,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 555 transitions, 9044 flow. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 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:44:34,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:34,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:34,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:36,396 INFO L124 PetriNetUnfolderBase]: 7800/10799 cut-off events. [2025-03-13 21:44:36,396 INFO L125 PetriNetUnfolderBase]: For 174575/174575 co-relation queries the response was YES. [2025-03-13 21:44:36,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86216 conditions, 10799 events. 7800/10799 cut-off events. For 174575/174575 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 52859 event pairs, 1506 based on Foata normal form. 194/10993 useless extension candidates. Maximal degree in co-relation 84247. Up to 6957 conditions per place. [2025-03-13 21:44:36,492 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 650 selfloop transitions, 331 changer transitions 0/982 dead transitions. [2025-03-13 21:44:36,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 982 transitions, 18282 flow [2025-03-13 21:44:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:44:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:44:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 179 transitions. [2025-03-13 21:44:36,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5114285714285715 [2025-03-13 21:44:36,493 INFO L175 Difference]: Start difference. First operand has 170 places, 555 transitions, 9044 flow. Second operand 14 states and 179 transitions. [2025-03-13 21:44:36,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 982 transitions, 18282 flow [2025-03-13 21:44:37,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 982 transitions, 16965 flow, removed 463 selfloop flow, removed 3 redundant places. [2025-03-13 21:44:37,344 INFO L231 Difference]: Finished difference. Result has 188 places, 740 transitions, 12447 flow [2025-03-13 21:44:37,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=8432, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=12447, PETRI_PLACES=188, PETRI_TRANSITIONS=740} [2025-03-13 21:44:37,345 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 160 predicate places. [2025-03-13 21:44:37,345 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 740 transitions, 12447 flow [2025-03-13 21:44:37,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 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:44:37,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:37,345 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:37,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-13 21:44:37,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-13 21:44:37,548 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:37,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:37,548 INFO L85 PathProgramCache]: Analyzing trace with hash -40599670, now seen corresponding path program 10 times [2025-03-13 21:44:37,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:37,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353622860] [2025-03-13 21:44:37,549 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:44:37,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:37,552 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:44:37,558 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:44:37,558 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:44:37,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:37,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:37,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353622860] [2025-03-13 21:44:37,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353622860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:37,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625998406] [2025-03-13 21:44:37,660 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:44:37,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:37,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:37,662 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:44:37,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-13 21:44:37,690 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:44:37,704 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:44:37,705 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:44:37,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:37,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:44:37,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:37,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:37,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625998406] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:37,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:37,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-03-13 21:44:37,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681871004] [2025-03-13 21:44:37,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:37,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-13 21:44:37,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:37,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-13 21:44:37,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-13 21:44:37,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:37,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 740 transitions, 12447 flow. Second operand has 17 states, 17 states have (on average 6.352941176470588) internal successors, (108), 17 states have internal predecessors, (108), 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:44:37,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:37,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:37,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:42,620 INFO L124 PetriNetUnfolderBase]: 10499/14399 cut-off events. [2025-03-13 21:44:42,620 INFO L125 PetriNetUnfolderBase]: For 302081/302081 co-relation queries the response was YES. [2025-03-13 21:44:42,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130709 conditions, 14399 events. 10499/14399 cut-off events. For 302081/302081 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 72544 event pairs, 977 based on Foata normal form. 620/15019 useless extension candidates. Maximal degree in co-relation 128405. Up to 5772 conditions per place. [2025-03-13 21:44:42,740 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 761 selfloop transitions, 1331 changer transitions 1/2094 dead transitions. [2025-03-13 21:44:42,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 2094 transitions, 40361 flow [2025-03-13 21:44:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2025-03-13 21:44:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2025-03-13 21:44:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 1216 transitions. [2025-03-13 21:44:42,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4381981981981982 [2025-03-13 21:44:42,744 INFO L175 Difference]: Start difference. First operand has 188 places, 740 transitions, 12447 flow. Second operand 111 states and 1216 transitions. [2025-03-13 21:44:42,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 2094 transitions, 40361 flow [2025-03-13 21:44:44,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 2094 transitions, 39223 flow, removed 569 selfloop flow, removed 0 redundant places. [2025-03-13 21:44:44,128 INFO L231 Difference]: Finished difference. Result has 368 places, 1636 transitions, 34828 flow [2025-03-13 21:44:44,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=11921, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=503, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=111, PETRI_FLOW=34828, PETRI_PLACES=368, PETRI_TRANSITIONS=1636} [2025-03-13 21:44:44,129 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 340 predicate places. [2025-03-13 21:44:44,130 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 1636 transitions, 34828 flow [2025-03-13 21:44:44,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.352941176470588) internal successors, (108), 17 states have internal predecessors, (108), 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:44:44,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:44,130 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:44,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-13 21:44:44,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-13 21:44:44,331 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:44,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1668176202, now seen corresponding path program 11 times [2025-03-13 21:44:44,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:44,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861482755] [2025-03-13 21:44:44,333 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:44:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:44,337 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:44:44,342 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:44:44,342 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:44:44,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:44,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:44,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861482755] [2025-03-13 21:44:44,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861482755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:44,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863386822] [2025-03-13 21:44:44,415 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:44:44,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:44,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:44,417 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:44:44,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-13 21:44:44,447 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:44:44,460 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:44:44,461 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:44:44,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:44,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-13 21:44:44,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:44,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:44,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863386822] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:44,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:44,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2025-03-13 21:44:44,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803456450] [2025-03-13 21:44:44,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:44,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:44:44,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:44,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:44:44,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:44:44,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:44,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 1636 transitions, 34828 flow. Second operand has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 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:44:44,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:44,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:44,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:49,296 INFO L124 PetriNetUnfolderBase]: 10555/14728 cut-off events. [2025-03-13 21:44:49,296 INFO L125 PetriNetUnfolderBase]: For 574650/574650 co-relation queries the response was YES. [2025-03-13 21:44:49,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158386 conditions, 14728 events. 10555/14728 cut-off events. For 574650/574650 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 77953 event pairs, 1033 based on Foata normal form. 523/15251 useless extension candidates. Maximal degree in co-relation 157475. Up to 5792 conditions per place. [2025-03-13 21:44:49,587 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 940 selfloop transitions, 812 changer transitions 232/1985 dead transitions. [2025-03-13 21:44:49,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 1985 transitions, 44763 flow [2025-03-13 21:44:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-13 21:44:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-13 21:44:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 400 transitions. [2025-03-13 21:44:49,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-03-13 21:44:49,588 INFO L175 Difference]: Start difference. First operand has 368 places, 1636 transitions, 34828 flow. Second operand 34 states and 400 transitions. [2025-03-13 21:44:49,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 1985 transitions, 44763 flow [2025-03-13 21:44:55,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 1985 transitions, 35975 flow, removed 4019 selfloop flow, removed 10 redundant places. [2025-03-13 21:44:55,420 INFO L231 Difference]: Finished difference. Result has 409 places, 1572 transitions, 28278 flow [2025-03-13 21:44:55,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=25386, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=706, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=818, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=28278, PETRI_PLACES=409, PETRI_TRANSITIONS=1572} [2025-03-13 21:44:55,421 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 381 predicate places. [2025-03-13 21:44:55,421 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 1572 transitions, 28278 flow [2025-03-13 21:44:55,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 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:44:55,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:55,421 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:55,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-13 21:44:55,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:55,622 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:55,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:55,623 INFO L85 PathProgramCache]: Analyzing trace with hash -305536124, now seen corresponding path program 12 times [2025-03-13 21:44:55,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:55,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108832836] [2025-03-13 21:44:55,623 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:44:55,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:55,625 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:44:55,631 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:44:55,631 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:44:55,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:55,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108832836] [2025-03-13 21:44:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108832836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999329263] [2025-03-13 21:44:55,785 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:44:55,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:55,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:55,789 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:44:55,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-13 21:44:55,836 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:44:55,853 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:44:55,853 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:44:55,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:55,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:44:55,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:55,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:55,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999329263] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:44:55,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:44:55,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-13 21:44:55,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169422939] [2025-03-13 21:44:55,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:44:55,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:44:55,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:55,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:44:55,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:44:55,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:44:55,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 1572 transitions, 28278 flow. Second operand has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 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:44:55,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:55,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:44:55,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:00,635 INFO L124 PetriNetUnfolderBase]: 10975/15235 cut-off events. [2025-03-13 21:45:00,635 INFO L125 PetriNetUnfolderBase]: For 729040/729040 co-relation queries the response was YES. [2025-03-13 21:45:00,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163810 conditions, 15235 events. 10975/15235 cut-off events. For 729040/729040 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 80291 event pairs, 885 based on Foata normal form. 211/15446 useless extension candidates. Maximal degree in co-relation 162903. Up to 5094 conditions per place. [2025-03-13 21:45:00,807 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 1315 selfloop transitions, 863 changer transitions 0/2179 dead transitions. [2025-03-13 21:45:00,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 2179 transitions, 44794 flow [2025-03-13 21:45:00,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-13 21:45:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-13 21:45:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 309 transitions. [2025-03-13 21:45:00,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5373913043478261 [2025-03-13 21:45:00,809 INFO L175 Difference]: Start difference. First operand has 409 places, 1572 transitions, 28278 flow. Second operand 23 states and 309 transitions. [2025-03-13 21:45:00,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 2179 transitions, 44794 flow [2025-03-13 21:45:05,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 2179 transitions, 43146 flow, removed 555 selfloop flow, removed 9 redundant places. [2025-03-13 21:45:05,994 INFO L231 Difference]: Finished difference. Result has 424 places, 1750 transitions, 32913 flow [2025-03-13 21:45:05,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=26938, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=720, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=838, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=32913, PETRI_PLACES=424, PETRI_TRANSITIONS=1750} [2025-03-13 21:45:05,995 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 396 predicate places. [2025-03-13 21:45:05,995 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 1750 transitions, 32913 flow [2025-03-13 21:45:05,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 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:45:05,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:05,996 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:06,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-13 21:45:06,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:06,197 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:45:06,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:06,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1607947529, now seen corresponding path program 13 times [2025-03-13 21:45:06,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:06,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597782823] [2025-03-13 21:45:06,198 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:45:06,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:06,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:45:06,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:45:06,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:06,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:06,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:06,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597782823] [2025-03-13 21:45:06,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597782823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104332397] [2025-03-13 21:45:06,256 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:45:06,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:06,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:06,258 INFO L229 MonitoredProcess]: Starting monitored process 17 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:45:06,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-13 21:45:06,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:45:06,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:45:06,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:45:06,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:06,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:45:06,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:45:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:06,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:45:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:06,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104332397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:45:06,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:45:06,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-13 21:45:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286052030] [2025-03-13 21:45:06,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:45:06,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:45:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:06,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:45:06,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:45:06,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:45:06,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 1750 transitions, 32913 flow. Second operand has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 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:45:06,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:06,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:45:06,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:12,710 INFO L124 PetriNetUnfolderBase]: 12668/17477 cut-off events. [2025-03-13 21:45:12,711 INFO L125 PetriNetUnfolderBase]: For 912031/912031 co-relation queries the response was YES. [2025-03-13 21:45:12,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198629 conditions, 17477 events. 12668/17477 cut-off events. For 912031/912031 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 92838 event pairs, 829 based on Foata normal form. 320/17797 useless extension candidates. Maximal degree in co-relation 197586. Up to 5940 conditions per place. [2025-03-13 21:45:12,969 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 1770 selfloop transitions, 1114 changer transitions 6/2891 dead transitions. [2025-03-13 21:45:12,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 2891 transitions, 61969 flow [2025-03-13 21:45:12,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-13 21:45:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-13 21:45:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 692 transitions. [2025-03-13 21:45:12,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43936507936507935 [2025-03-13 21:45:12,971 INFO L175 Difference]: Start difference. First operand has 424 places, 1750 transitions, 32913 flow. Second operand 63 states and 692 transitions. [2025-03-13 21:45:12,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 2891 transitions, 61969 flow [2025-03-13 21:45:19,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 2891 transitions, 60197 flow, removed 461 selfloop flow, removed 5 redundant places. [2025-03-13 21:45:19,859 INFO L231 Difference]: Finished difference. Result has 524 places, 2227 transitions, 46015 flow [2025-03-13 21:45:19,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=31363, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=677, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=46015, PETRI_PLACES=524, PETRI_TRANSITIONS=2227} [2025-03-13 21:45:19,861 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 496 predicate places. [2025-03-13 21:45:19,861 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 2227 transitions, 46015 flow [2025-03-13 21:45:19,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 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:45:19,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:19,862 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:19,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-13 21:45:20,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-13 21:45:20,062 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:45:20,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:20,063 INFO L85 PathProgramCache]: Analyzing trace with hash 523270086, now seen corresponding path program 14 times [2025-03-13 21:45:20,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:20,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597280907] [2025-03-13 21:45:20,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:20,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:20,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:45:20,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:45:20,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:45:20,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:20,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:20,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597280907] [2025-03-13 21:45:20,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597280907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:20,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105214982] [2025-03-13 21:45:20,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:45:20,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:20,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:20,125 INFO L229 MonitoredProcess]: Starting monitored process 18 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:45:20,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-13 21:45:20,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:45:20,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:45:20,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:45:20,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:20,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:45:20,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:45:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:20,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:45:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:20,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105214982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:45:20,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:45:20,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-13 21:45:20,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764350659] [2025-03-13 21:45:20,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:45:20,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:45:20,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:20,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:45:20,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:45:20,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:45:20,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 2227 transitions, 46015 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:20,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:20,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:45:20,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:45:29,867 INFO L124 PetriNetUnfolderBase]: 18127/24705 cut-off events. [2025-03-13 21:45:29,868 INFO L125 PetriNetUnfolderBase]: For 1481683/1481683 co-relation queries the response was YES. [2025-03-13 21:45:30,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321880 conditions, 24705 events. 18127/24705 cut-off events. For 1481683/1481683 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 133417 event pairs, 755 based on Foata normal form. 110/24815 useless extension candidates. Maximal degree in co-relation 320692. Up to 9362 conditions per place. [2025-03-13 21:45:30,516 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 3275 selfloop transitions, 950 changer transitions 126/4352 dead transitions. [2025-03-13 21:45:30,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 4352 transitions, 104959 flow [2025-03-13 21:45:30,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 21:45:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 21:45:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 171 transitions. [2025-03-13 21:45:30,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5261538461538462 [2025-03-13 21:45:30,517 INFO L175 Difference]: Start difference. First operand has 524 places, 2227 transitions, 46015 flow. Second operand 13 states and 171 transitions. [2025-03-13 21:45:30,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 4352 transitions, 104959 flow [2025-03-13 21:45:45,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 4352 transitions, 99603 flow, removed 2138 selfloop flow, removed 17 redundant places. [2025-03-13 21:45:45,526 INFO L231 Difference]: Finished difference. Result has 528 places, 2645 transitions, 55957 flow [2025-03-13 21:45:45,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=42619, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=553, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=55957, PETRI_PLACES=528, PETRI_TRANSITIONS=2645} [2025-03-13 21:45:45,528 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 500 predicate places. [2025-03-13 21:45:45,528 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 2645 transitions, 55957 flow [2025-03-13 21:45:45,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:45:45,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:45:45,528 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:45:45,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-13 21:45:45,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-13 21:45:45,728 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:45:45,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:45:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2063619930, now seen corresponding path program 15 times [2025-03-13 21:45:45,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:45:45,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868854096] [2025-03-13 21:45:45,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:45:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:45:45,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:45:45,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:45:45,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:45:45,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:45,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:45:45,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868854096] [2025-03-13 21:45:45,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868854096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:45:45,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848324341] [2025-03-13 21:45:45,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:45:45,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:45:45,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:45:45,844 INFO L229 MonitoredProcess]: Starting monitored process 19 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:45:45,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-13 21:45:45,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-13 21:45:45,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:45:45,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:45:45,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:45:45,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:45:45,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:45:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:45,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:45:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:45:46,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848324341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:45:46,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:45:46,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-03-13 21:45:46,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613985620] [2025-03-13 21:45:46,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:45:46,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:45:46,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:45:46,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:45:46,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:45:46,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-03-13 21:45:46,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 2645 transitions, 55957 flow. Second operand has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 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:45:46,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:45:46,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-03-13 21:45:46,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand