./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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/popl20-bad-threaded-sum-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b30bad195dde021066febd52c7985271e0448c265b66e6efcbd9c3306420e73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:05:13,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:05:13,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:05:13,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:05:13,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:05:13,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:05:13,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:05:13,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:05:13,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:05:13,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:05:13,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:05:13,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:05:13,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:05:13,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:05:13,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:05:13,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:05:13,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:05:13,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:05:13,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:05:13,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:05:13,890 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:05:13,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:05:13,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:05:13,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:05:13,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:05:13,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:05:13,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:05:13,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:05:13,891 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 -> 6b30bad195dde021066febd52c7985271e0448c265b66e6efcbd9c3306420e73 [2025-03-14 01:05:14,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:05:14,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:05:14,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:05:14,143 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:05:14,144 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:05:14,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-03-14 01:05:15,264 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2f6f17c8/2d1f3eadaa6442d08dcc13180e086992/FLAGb630d515b [2025-03-14 01:05:15,512 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:05:15,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-03-14 01:05:15,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2f6f17c8/2d1f3eadaa6442d08dcc13180e086992/FLAGb630d515b [2025-03-14 01:05:15,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2f6f17c8/2d1f3eadaa6442d08dcc13180e086992 [2025-03-14 01:05:15,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:05:15,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:05:15,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:05:15,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:05:15,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:05:15,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:05:15" (1/1) ... [2025-03-14 01:05:15,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e7eb486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:15, skipping insertion in model container [2025-03-14 01:05:15,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:05:15" (1/1) ... [2025-03-14 01:05:15,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:05:16,001 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/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-03-14 01:05:16,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:05:16,014 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:05:16,031 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/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-03-14 01:05:16,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:05:16,047 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:05:16,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16 WrapperNode [2025-03-14 01:05:16,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:05:16,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:05:16,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:05:16,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:05:16,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (1/1) ... [2025-03-14 01:05:16,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (1/1) ... [2025-03-14 01:05:16,073 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2025-03-14 01:05:16,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:05:16,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:05:16,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:05:16,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:05:16,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (1/1) ... [2025-03-14 01:05:16,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (1/1) ... [2025-03-14 01:05:16,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (1/1) ... [2025-03-14 01:05:16,100 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-14 01:05:16,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (1/1) ... [2025-03-14 01:05:16,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (1/1) ... [2025-03-14 01:05:16,110 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (1/1) ... [2025-03-14 01:05:16,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (1/1) ... [2025-03-14 01:05:16,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (1/1) ... [2025-03-14 01:05:16,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (1/1) ... [2025-03-14 01:05:16,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:05:16,117 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:05:16,117 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:05:16,117 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:05:16,118 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (1/1) ... [2025-03-14 01:05:16,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:05:16,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:16,147 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-14 01:05:16,151 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-14 01:05:16,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:05:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:05:16,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:05:16,172 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:05:16,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:05:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:05:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:05:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:05:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:05:16,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:05:16,174 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:05:16,246 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:05:16,248 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:05:16,397 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:05:16,398 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:05:16,398 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:05:16,534 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:05:16,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:05:16 BoogieIcfgContainer [2025-03-14 01:05:16,535 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:05:16,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:05:16,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:05:16,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:05:16,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:05:15" (1/3) ... [2025-03-14 01:05:16,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521e2553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:05:16, skipping insertion in model container [2025-03-14 01:05:16,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:05:16" (2/3) ... [2025-03-14 01:05:16,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521e2553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:05:16, skipping insertion in model container [2025-03-14 01:05:16,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:05:16" (3/3) ... [2025-03-14 01:05:16,546 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2025-03-14 01:05:16,558 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:05:16,559 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-threaded-sum-2.wvr.c that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-14 01:05:16,559 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:05:16,596 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:05:16,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 64 flow [2025-03-14 01:05:16,645 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-03-14 01:05:16,647 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:05:16,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 2/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-03-14 01:05:16,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 25 transitions, 64 flow [2025-03-14 01:05:16,652 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 22 transitions, 56 flow [2025-03-14 01:05:16,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:05:16,671 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;@21fd1401, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:05:16,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 01:05:16,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:05:16,683 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-03-14 01:05:16,683 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:05:16,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:16,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:16,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:05:16,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:16,689 INFO L85 PathProgramCache]: Analyzing trace with hash 345480012, now seen corresponding path program 1 times [2025-03-14 01:05:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:16,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491090218] [2025-03-14 01:05:16,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:16,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:16,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:05:16,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:05:16,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:16,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:17,096 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-14 01:05:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:17,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491090218] [2025-03-14 01:05:17,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491090218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:17,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:05:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21242827] [2025-03-14 01:05:17,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:17,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:05:17,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:17,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:05:17,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:05:17,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-14 01:05:17,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:17,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:17,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-14 01:05:17,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:17,272 INFO L124 PetriNetUnfolderBase]: 120/236 cut-off events. [2025-03-14 01:05:17,272 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-14 01:05:17,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 236 events. 120/236 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 871 event pairs, 9 based on Foata normal form. 16/250 useless extension candidates. Maximal degree in co-relation 427. Up to 134 conditions per place. [2025-03-14 01:05:17,281 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 35 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2025-03-14 01:05:17,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 46 transitions, 195 flow [2025-03-14 01:05:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:05:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:05:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-03-14 01:05:17,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.624 [2025-03-14 01:05:17,295 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 56 flow. Second operand 5 states and 78 transitions. [2025-03-14 01:05:17,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 46 transitions, 195 flow [2025-03-14 01:05:17,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 46 transitions, 181 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:05:17,302 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 93 flow [2025-03-14 01:05:17,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-03-14 01:05:17,308 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2025-03-14 01:05:17,308 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 93 flow [2025-03-14 01:05:17,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:17,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:17,309 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-14 01:05:17,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:05:17,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:05:17,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:17,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1096274318, now seen corresponding path program 1 times [2025-03-14 01:05:17,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:17,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139266654] [2025-03-14 01:05:17,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:17,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:17,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 01:05:17,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 01:05:17,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:17,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:05:17,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:17,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139266654] [2025-03-14 01:05:17,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139266654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:17,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:17,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:05:17,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492541121] [2025-03-14 01:05:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:17,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:05:17,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:17,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:05:17,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:05:17,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-14 01:05:17,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-14 01:05:17,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:17,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-14 01:05:17,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:17,657 INFO L124 PetriNetUnfolderBase]: 146/290 cut-off events. [2025-03-14 01:05:17,657 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-14 01:05:17,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 290 events. 146/290 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1188 event pairs, 15 based on Foata normal form. 13/301 useless extension candidates. Maximal degree in co-relation 251. Up to 144 conditions per place. [2025-03-14 01:05:17,661 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 36 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-14 01:05:17,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 243 flow [2025-03-14 01:05:17,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:05:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:05:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-14 01:05:17,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-14 01:05:17,662 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 93 flow. Second operand 4 states and 60 transitions. [2025-03-14 01:05:17,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 243 flow [2025-03-14 01:05:17,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:05:17,664 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 104 flow [2025-03-14 01:05:17,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2025-03-14 01:05:17,664 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2025-03-14 01:05:17,664 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 104 flow [2025-03-14 01:05:17,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-14 01:05:17,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:17,665 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-14 01:05:17,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:05:17,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:05:17,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:17,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1467486481, now seen corresponding path program 1 times [2025-03-14 01:05:17,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:17,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748709421] [2025-03-14 01:05:17,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:17,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:17,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 01:05:17,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:05:17,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:17,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:17,787 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-14 01:05:17,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:17,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748709421] [2025-03-14 01:05:17,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748709421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:17,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:17,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:05:17,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770050163] [2025-03-14 01:05:17,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:17,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:05:17,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:17,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:05:17,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:05:17,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-14 01:05:17,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-14 01:05:17,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:17,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-14 01:05:17,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:17,897 INFO L124 PetriNetUnfolderBase]: 156/301 cut-off events. [2025-03-14 01:05:17,897 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2025-03-14 01:05:17,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 301 events. 156/301 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1221 event pairs, 23 based on Foata normal form. 16/315 useless extension candidates. Maximal degree in co-relation 364. Up to 109 conditions per place. [2025-03-14 01:05:17,900 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 34 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2025-03-14 01:05:17,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 253 flow [2025-03-14 01:05:17,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:05:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:05:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-03-14 01:05:17,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584 [2025-03-14 01:05:17,902 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 104 flow. Second operand 5 states and 73 transitions. [2025-03-14 01:05:17,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 253 flow [2025-03-14 01:05:17,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:05:17,904 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 150 flow [2025-03-14 01:05:17,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-03-14 01:05:17,904 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2025-03-14 01:05:17,905 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 150 flow [2025-03-14 01:05:17,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-14 01:05:17,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:17,905 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-14 01:05:17,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:05:17,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:05:17,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:17,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2051951255, now seen corresponding path program 2 times [2025-03-14 01:05:17,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:17,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232687333] [2025-03-14 01:05:17,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:05:17,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:17,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-03-14 01:05:17,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:05:17,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:05:17,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:18,519 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-14 01:05:18,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:18,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232687333] [2025-03-14 01:05:18,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232687333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:18,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:18,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:05:18,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356020498] [2025-03-14 01:05:18,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:18,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:05:18,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:18,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:05:18,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:05:18,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-14 01:05:18,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 150 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-14 01:05:18,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:18,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-14 01:05:18,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:18,837 INFO L124 PetriNetUnfolderBase]: 241/455 cut-off events. [2025-03-14 01:05:18,837 INFO L125 PetriNetUnfolderBase]: For 551/551 co-relation queries the response was YES. [2025-03-14 01:05:18,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 455 events. 241/455 cut-off events. For 551/551 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1905 event pairs, 14 based on Foata normal form. 1/454 useless extension candidates. Maximal degree in co-relation 556. Up to 262 conditions per place. [2025-03-14 01:05:18,841 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 41 selfloop transitions, 14 changer transitions 9/69 dead transitions. [2025-03-14 01:05:18,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 420 flow [2025-03-14 01:05:18,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:05:18,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:05:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2025-03-14 01:05:18,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.524 [2025-03-14 01:05:18,843 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 150 flow. Second operand 10 states and 131 transitions. [2025-03-14 01:05:18,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 420 flow [2025-03-14 01:05:18,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 416 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:05:18,847 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 241 flow [2025-03-14 01:05:18,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=241, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-03-14 01:05:18,847 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 24 predicate places. [2025-03-14 01:05:18,848 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 241 flow [2025-03-14 01:05:18,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-14 01:05:18,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:18,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:18,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:05:18,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:05:18,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:18,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1869176617, now seen corresponding path program 1 times [2025-03-14 01:05:18,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:18,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376979898] [2025-03-14 01:05:18,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:18,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:18,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:05:18,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:05:18,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:18,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:19,052 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-14 01:05:19,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:19,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376979898] [2025-03-14 01:05:19,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376979898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:19,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213259287] [2025-03-14 01:05:19,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:19,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:19,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:19,056 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-14 01:05:19,059 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-14 01:05:19,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:05:19,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:05:19,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:19,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:19,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 01:05:19,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:19,244 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-14 01:05:19,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:19,383 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-14 01:05:19,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213259287] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:19,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:05:19,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 7] total 12 [2025-03-14 01:05:19,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993935170] [2025-03-14 01:05:19,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:19,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:05:19,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:19,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:05:19,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:05:19,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-03-14 01:05:19,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-14 01:05:19,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:19,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-03-14 01:05:19,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:19,742 INFO L124 PetriNetUnfolderBase]: 735/1246 cut-off events. [2025-03-14 01:05:19,743 INFO L125 PetriNetUnfolderBase]: For 2426/2426 co-relation queries the response was YES. [2025-03-14 01:05:19,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4054 conditions, 1246 events. 735/1246 cut-off events. For 2426/2426 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5658 event pairs, 52 based on Foata normal form. 20/1265 useless extension candidates. Maximal degree in co-relation 4027. Up to 273 conditions per place. [2025-03-14 01:05:19,753 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 88 selfloop transitions, 37 changer transitions 0/128 dead transitions. [2025-03-14 01:05:19,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 128 transitions, 930 flow [2025-03-14 01:05:19,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:05:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:05:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2025-03-14 01:05:19,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5490909090909091 [2025-03-14 01:05:19,755 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 241 flow. Second operand 11 states and 151 transitions. [2025-03-14 01:05:19,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 128 transitions, 930 flow [2025-03-14 01:05:19,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 128 transitions, 886 flow, removed 17 selfloop flow, removed 4 redundant places. [2025-03-14 01:05:19,763 INFO L231 Difference]: Finished difference. Result has 61 places, 76 transitions, 571 flow [2025-03-14 01:05:19,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=571, PETRI_PLACES=61, PETRI_TRANSITIONS=76} [2025-03-14 01:05:19,764 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 34 predicate places. [2025-03-14 01:05:19,764 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 571 flow [2025-03-14 01:05:19,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-14 01:05:19,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:19,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:19,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:05:19,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:19,965 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:05:19,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:19,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1548598755, now seen corresponding path program 2 times [2025-03-14 01:05:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490222532] [2025-03-14 01:05:19,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:05:19,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:19,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:05:19,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:05:19,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:05:19,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:22,029 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-14 01:05:22,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:22,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490222532] [2025-03-14 01:05:22,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490222532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:22,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:22,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:05:22,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176807057] [2025-03-14 01:05:22,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:22,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:05:22,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:22,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:05:22,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:05:22,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-14 01:05:22,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 571 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-14 01:05:22,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:22,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-14 01:05:22,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:22,679 INFO L124 PetriNetUnfolderBase]: 693/1322 cut-off events. [2025-03-14 01:05:22,679 INFO L125 PetriNetUnfolderBase]: For 6101/6111 co-relation queries the response was YES. [2025-03-14 01:05:22,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5463 conditions, 1322 events. 693/1322 cut-off events. For 6101/6111 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6949 event pairs, 47 based on Foata normal form. 7/1319 useless extension candidates. Maximal degree in co-relation 4273. Up to 675 conditions per place. [2025-03-14 01:05:22,689 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 86 selfloop transitions, 31 changer transitions 13/143 dead transitions. [2025-03-14 01:05:22,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 143 transitions, 1299 flow [2025-03-14 01:05:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:05:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:05:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 157 transitions. [2025-03-14 01:05:22,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5233333333333333 [2025-03-14 01:05:22,691 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 571 flow. Second operand 12 states and 157 transitions. [2025-03-14 01:05:22,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 143 transitions, 1299 flow [2025-03-14 01:05:22,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 143 transitions, 1189 flow, removed 55 selfloop flow, removed 0 redundant places. [2025-03-14 01:05:22,710 INFO L231 Difference]: Finished difference. Result has 76 places, 91 transitions, 767 flow [2025-03-14 01:05:22,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=767, PETRI_PLACES=76, PETRI_TRANSITIONS=91} [2025-03-14 01:05:22,711 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 49 predicate places. [2025-03-14 01:05:22,712 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 91 transitions, 767 flow [2025-03-14 01:05:22,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-14 01:05:22,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:22,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, 1] [2025-03-14 01:05:22,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:05:22,712 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:05:22,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:22,713 INFO L85 PathProgramCache]: Analyzing trace with hash -802914163, now seen corresponding path program 3 times [2025-03-14 01:05:22,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:22,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713771524] [2025-03-14 01:05:22,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:05:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:22,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:05:22,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:05:22,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:05:22,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:23,056 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-14 01:05:23,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:23,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713771524] [2025-03-14 01:05:23,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713771524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:23,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:23,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:05:23,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118886981] [2025-03-14 01:05:23,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:23,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:05:23,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:23,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:05:23,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:05:23,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-14 01:05:23,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 91 transitions, 767 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-14 01:05:23,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:23,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-14 01:05:23,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:23,398 INFO L124 PetriNetUnfolderBase]: 764/1461 cut-off events. [2025-03-14 01:05:23,398 INFO L125 PetriNetUnfolderBase]: For 7017/7027 co-relation queries the response was YES. [2025-03-14 01:05:23,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6082 conditions, 1461 events. 764/1461 cut-off events. For 7017/7027 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7880 event pairs, 53 based on Foata normal form. 7/1458 useless extension candidates. Maximal degree in co-relation 6045. Up to 816 conditions per place. [2025-03-14 01:05:23,409 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 91 selfloop transitions, 36 changer transitions 13/153 dead transitions. [2025-03-14 01:05:23,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 153 transitions, 1473 flow [2025-03-14 01:05:23,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:05:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:05:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2025-03-14 01:05:23,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2025-03-14 01:05:23,410 INFO L175 Difference]: Start difference. First operand has 76 places, 91 transitions, 767 flow. Second operand 12 states and 152 transitions. [2025-03-14 01:05:23,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 153 transitions, 1473 flow [2025-03-14 01:05:23,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 153 transitions, 1427 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-03-14 01:05:23,423 INFO L231 Difference]: Finished difference. Result has 83 places, 107 transitions, 1035 flow [2025-03-14 01:05:23,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1035, PETRI_PLACES=83, PETRI_TRANSITIONS=107} [2025-03-14 01:05:23,424 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 56 predicate places. [2025-03-14 01:05:23,424 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 107 transitions, 1035 flow [2025-03-14 01:05:23,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-14 01:05:23,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:23,425 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:23,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:05:23,425 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:05:23,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1039039716, now seen corresponding path program 3 times [2025-03-14 01:05:23,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:23,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613101148] [2025-03-14 01:05:23,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:05:23,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:23,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-14 01:05:23,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:05:23,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:05:23,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:23,871 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-14 01:05:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:23,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613101148] [2025-03-14 01:05:23,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613101148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:23,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835245100] [2025-03-14 01:05:23,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:05:23,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:23,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:23,876 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-14 01:05:23,877 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-14 01:05:23,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-14 01:05:23,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:05:23,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:05:23,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:23,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-14 01:05:23,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:24,266 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-14 01:05:24,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:24,643 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-14 01:05:24,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835245100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:05:24,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:05:24,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-14 01:05:24,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001237114] [2025-03-14 01:05:24,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:05:24,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:05:24,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:24,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:05:24,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:05:24,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2025-03-14 01:05:24,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 107 transitions, 1035 flow. Second operand has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 23 states have internal predecessors, (192), 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-14 01:05:24,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:24,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2025-03-14 01:05:24,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:27,708 INFO L124 PetriNetUnfolderBase]: 1978/3568 cut-off events. [2025-03-14 01:05:27,709 INFO L125 PetriNetUnfolderBase]: For 20956/20956 co-relation queries the response was YES. [2025-03-14 01:05:27,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15308 conditions, 3568 events. 1978/3568 cut-off events. For 20956/20956 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 21382 event pairs, 20 based on Foata normal form. 5/3571 useless extension candidates. Maximal degree in co-relation 15247. Up to 622 conditions per place. [2025-03-14 01:05:27,739 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 279 selfloop transitions, 217 changer transitions 36/536 dead transitions. [2025-03-14 01:05:27,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 536 transitions, 5290 flow [2025-03-14 01:05:27,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 01:05:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 01:05:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 577 transitions. [2025-03-14 01:05:27,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5128888888888888 [2025-03-14 01:05:27,743 INFO L175 Difference]: Start difference. First operand has 83 places, 107 transitions, 1035 flow. Second operand 45 states and 577 transitions. [2025-03-14 01:05:27,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 536 transitions, 5290 flow [2025-03-14 01:05:27,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 536 transitions, 5241 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-14 01:05:27,803 INFO L231 Difference]: Finished difference. Result has 144 places, 278 transitions, 3384 flow [2025-03-14 01:05:27,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=3384, PETRI_PLACES=144, PETRI_TRANSITIONS=278} [2025-03-14 01:05:27,804 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 117 predicate places. [2025-03-14 01:05:27,805 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 278 transitions, 3384 flow [2025-03-14 01:05:27,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 23 states have internal predecessors, (192), 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-14 01:05:27,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:27,805 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:27,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:05:28,010 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,SelfDestructingSolverStorable7 [2025-03-14 01:05:28,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:05:28,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:28,011 INFO L85 PathProgramCache]: Analyzing trace with hash -232601808, now seen corresponding path program 4 times [2025-03-14 01:05:28,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:28,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178364496] [2025-03-14 01:05:28,011 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:05:28,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:28,016 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-14 01:05:28,023 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:05:28,023 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:05:28,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:05:28,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178364496] [2025-03-14 01:05:28,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178364496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:28,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:28,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:05:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228522850] [2025-03-14 01:05:28,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:28,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:05:28,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:28,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:05:28,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:05:28,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2025-03-14 01:05:28,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 278 transitions, 3384 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 01:05:28,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:28,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2025-03-14 01:05:28,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:28,717 INFO L124 PetriNetUnfolderBase]: 2519/4428 cut-off events. [2025-03-14 01:05:28,717 INFO L125 PetriNetUnfolderBase]: For 63557/63711 co-relation queries the response was YES. [2025-03-14 01:05:28,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23541 conditions, 4428 events. 2519/4428 cut-off events. For 63557/63711 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 27053 event pairs, 5 based on Foata normal form. 134/4539 useless extension candidates. Maximal degree in co-relation 23466. Up to 1145 conditions per place. [2025-03-14 01:05:28,760 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 446 selfloop transitions, 141 changer transitions 0/631 dead transitions. [2025-03-14 01:05:28,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 631 transitions, 9379 flow [2025-03-14 01:05:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:05:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:05:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2025-03-14 01:05:28,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2025-03-14 01:05:28,761 INFO L175 Difference]: Start difference. First operand has 144 places, 278 transitions, 3384 flow. Second operand 9 states and 111 transitions. [2025-03-14 01:05:28,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 631 transitions, 9379 flow [2025-03-14 01:05:28,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 631 transitions, 8068 flow, removed 588 selfloop flow, removed 13 redundant places. [2025-03-14 01:05:28,918 INFO L231 Difference]: Finished difference. Result has 141 places, 376 transitions, 4652 flow [2025-03-14 01:05:28,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2865, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4652, PETRI_PLACES=141, PETRI_TRANSITIONS=376} [2025-03-14 01:05:28,919 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 114 predicate places. [2025-03-14 01:05:28,919 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 376 transitions, 4652 flow [2025-03-14 01:05:28,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 01:05:28,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:28,920 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:28,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:05:28,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:05:28,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1047245677, now seen corresponding path program 4 times [2025-03-14 01:05:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:28,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794678381] [2025-03-14 01:05:28,921 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:05:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:28,924 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-14 01:05:28,935 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:05:28,935 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:05:28,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:30,129 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-14 01:05:30,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794678381] [2025-03-14 01:05:30,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794678381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601223565] [2025-03-14 01:05:30,129 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:05:30,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:30,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:30,132 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-14 01:05:30,133 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-14 01:05:30,157 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-14 01:05:30,185 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:05:30,185 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:05:30,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:30,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-14 01:05:30,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:31,260 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-14 01:05:31,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:41,006 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-14 01:05:41,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601223565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:05:41,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:05:41,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-14 01:05:41,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224018300] [2025-03-14 01:05:41,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:05:41,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-14 01:05:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:41,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-14 01:05:41,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=461, Unknown=2, NotChecked=0, Total=600 [2025-03-14 01:05:45,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 01:05:45,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2025-03-14 01:05:45,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 376 transitions, 4652 flow. Second operand has 25 states, 25 states have (on average 8.32) internal successors, (208), 25 states have internal predecessors, (208), 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-14 01:05:45,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:45,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2025-03-14 01:05:45,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:06:09,279 WARN L286 SmtUtils]: Spent 24.05s on a formula simplification. DAG size of input: 52 DAG size of output: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-14 01:06:34,060 WARN L286 SmtUtils]: Spent 24.51s on a formula simplification. DAG size of input: 59 DAG size of output: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-14 01:06:49,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-14 01:06:52,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []