./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.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 cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:24:01,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:24:01,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:24:01,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:24:01,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:24:01,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:24:01,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:24:01,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:24:01,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:24:01,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:24:01,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:24:01,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:24:01,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:24:01,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:24:01,170 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:24:01,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:24:01,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:24:01,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:24:01,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:24:01,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:24:01,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:24:01,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:24:01,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:24:01,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:24:01,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:24:01,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:24:01,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:24:01,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:24:01,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:24:01,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:24:01,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:24:01,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:24:01,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:24:01,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:24:01,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:24:01,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:24:01,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:24:01,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:24:01,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:24:01,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:24:01,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:24:01,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:24:01,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:24:01,172 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 -> cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 [2025-03-04 02:24:01,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:24:01,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:24:01,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:24:01,403 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:24:01,403 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:24:01,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-03-04 02:24:02,532 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdc98293/7fc0aa564ed24c6990f56cc07800ebf9/FLAGccc7d4ac2 [2025-03-04 02:24:02,746 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:24:02,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-03-04 02:24:02,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdc98293/7fc0aa564ed24c6990f56cc07800ebf9/FLAGccc7d4ac2 [2025-03-04 02:24:03,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdc98293/7fc0aa564ed24c6990f56cc07800ebf9 [2025-03-04 02:24:03,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:24:03,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:24:03,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:24:03,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:24:03,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:24:03,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373fecce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03, skipping insertion in model container [2025-03-04 02:24:03,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:24:03,263 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-more-array-sum-alt.wvr.c[2368,2381] [2025-03-04 02:24:03,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:24:03,281 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:24:03,297 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-more-array-sum-alt.wvr.c[2368,2381] [2025-03-04 02:24:03,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:24:03,317 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:24:03,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03 WrapperNode [2025-03-04 02:24:03,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:24:03,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:24:03,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:24:03,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:24:03,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,354 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 172 [2025-03-04 02:24:03,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:24:03,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:24:03,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:24:03,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:24:03,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,384 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 02:24:03,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:24:03,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:24:03,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:24:03,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:24:03,399 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (1/1) ... [2025-03-04 02:24:03,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:24:03,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:03,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:24:03,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:24:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:24:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:24:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:24:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:24:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:24:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:24:03,450 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:24:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:24:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:24:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:24:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:24:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:24:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:24:03,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:24:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:24:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:24:03,452 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:24:03,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:24:03,536 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:24:03,766 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:24:03,767 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:24:03,947 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:24:03,947 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:24:03,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:24:03 BoogieIcfgContainer [2025-03-04 02:24:03,947 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:24:03,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:24:03,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:24:03,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:24:03,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:24:03" (1/3) ... [2025-03-04 02:24:03,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72aef59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:24:03, skipping insertion in model container [2025-03-04 02:24:03,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:03" (2/3) ... [2025-03-04 02:24:03,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72aef59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:24:03, skipping insertion in model container [2025-03-04 02:24:03,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:24:03" (3/3) ... [2025-03-04 02:24:03,954 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2025-03-04 02:24:03,965 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:24:03,966 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt.wvr.c that has 4 procedures, 28 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-04 02:24:03,966 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:24:04,021 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:24:04,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 83 flow [2025-03-04 02:24:04,071 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-04 02:24:04,074 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:24:04,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 4/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-03-04 02:24:04,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 83 flow [2025-03-04 02:24:04,081 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 27 transitions, 72 flow [2025-03-04 02:24:04,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:24:04,100 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;@481862a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:24:04,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:24:04,111 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:24:04,111 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-03-04 02:24:04,111 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:24:04,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:04,112 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-04 02:24:04,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:04,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:04,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2059787596, now seen corresponding path program 1 times [2025-03-04 02:24:04,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:04,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410572328] [2025-03-04 02:24:04,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:04,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:04,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:24:04,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:24:04,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:04,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:04,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:04,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:04,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410572328] [2025-03-04 02:24:04,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410572328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:04,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:04,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:24:04,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087079189] [2025-03-04 02:24:04,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:04,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:24:04,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:04,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:24:04,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:24:04,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:04,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:04,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:04,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:04,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:04,591 INFO L124 PetriNetUnfolderBase]: 817/1179 cut-off events. [2025-03-04 02:24:04,591 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-03-04 02:24:04,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2478 conditions, 1179 events. 817/1179 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4420 event pairs, 226 based on Foata normal form. 1/935 useless extension candidates. Maximal degree in co-relation 2122. Up to 803 conditions per place. [2025-03-04 02:24:04,605 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 40 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-03-04 02:24:04,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 215 flow [2025-03-04 02:24:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:24:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:24:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-04 02:24:04,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2025-03-04 02:24:04,617 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 72 flow. Second operand 3 states and 58 transitions. [2025-03-04 02:24:04,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 215 flow [2025-03-04 02:24:04,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:24:04,626 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 86 flow [2025-03-04 02:24:04,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2025-03-04 02:24:04,632 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2025-03-04 02:24:04,633 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 86 flow [2025-03-04 02:24:04,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:04,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:04,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:04,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:24:04,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:04,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:04,636 INFO L85 PathProgramCache]: Analyzing trace with hash 978182213, now seen corresponding path program 1 times [2025-03-04 02:24:04,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:04,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370433722] [2025-03-04 02:24:04,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:04,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:04,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:24:04,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:24:04,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:04,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:04,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:04,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370433722] [2025-03-04 02:24:04,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370433722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:04,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:04,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:24:04,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307163368] [2025-03-04 02:24:04,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:04,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:24:04,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:04,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:24:04,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:24:04,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:04,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:04,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:04,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:04,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:05,090 INFO L124 PetriNetUnfolderBase]: 1511/2222 cut-off events. [2025-03-04 02:24:05,090 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2025-03-04 02:24:05,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 2222 events. 1511/2222 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9626 event pairs, 946 based on Foata normal form. 98/2038 useless extension candidates. Maximal degree in co-relation 1532. Up to 1179 conditions per place. [2025-03-04 02:24:05,101 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 67 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2025-03-04 02:24:05,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 73 transitions, 346 flow [2025-03-04 02:24:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:24:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:24:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-03-04 02:24:05,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5548387096774193 [2025-03-04 02:24:05,103 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 86 flow. Second operand 5 states and 86 transitions. [2025-03-04 02:24:05,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 73 transitions, 346 flow [2025-03-04 02:24:05,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 73 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:05,105 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 120 flow [2025-03-04 02:24:05,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-03-04 02:24:05,105 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2025-03-04 02:24:05,105 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 120 flow [2025-03-04 02:24:05,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:05,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:05,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:05,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:24:05,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:05,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:05,109 INFO L85 PathProgramCache]: Analyzing trace with hash -990189302, now seen corresponding path program 1 times [2025-03-04 02:24:05,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:05,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280039938] [2025-03-04 02:24:05,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:05,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:05,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:24:05,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:24:05,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:05,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:05,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:05,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280039938] [2025-03-04 02:24:05,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280039938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:05,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018420105] [2025-03-04 02:24:05,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:05,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:05,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:05,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:05,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:24:05,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:24:05,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:24:05,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:05,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:05,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:24:05,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:05,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:05,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018420105] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:05,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:24:05,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-04 02:24:05,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082202172] [2025-03-04 02:24:05,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:05,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:24:05,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:05,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:24:05,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:24:05,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:05,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 120 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:05,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:05,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:05,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:05,986 INFO L124 PetriNetUnfolderBase]: 1896/2781 cut-off events. [2025-03-04 02:24:05,986 INFO L125 PetriNetUnfolderBase]: For 1433/1433 co-relation queries the response was YES. [2025-03-04 02:24:05,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6988 conditions, 2781 events. 1896/2781 cut-off events. For 1433/1433 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12456 event pairs, 628 based on Foata normal form. 0/2434 useless extension candidates. Maximal degree in co-relation 4327. Up to 699 conditions per place. [2025-03-04 02:24:06,002 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 114 selfloop transitions, 18 changer transitions 0/133 dead transitions. [2025-03-04 02:24:06,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 133 transitions, 701 flow [2025-03-04 02:24:06,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:24:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:24:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2025-03-04 02:24:06,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5129032258064516 [2025-03-04 02:24:06,007 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 120 flow. Second operand 10 states and 159 transitions. [2025-03-04 02:24:06,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 133 transitions, 701 flow [2025-03-04 02:24:06,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 133 transitions, 697 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:06,011 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 225 flow [2025-03-04 02:24:06,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=225, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2025-03-04 02:24:06,012 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2025-03-04 02:24:06,012 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 225 flow [2025-03-04 02:24:06,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:06,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:06,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:06,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:24:06,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:06,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:06,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:06,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2003501666, now seen corresponding path program 2 times [2025-03-04 02:24:06,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:06,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75633250] [2025-03-04 02:24:06,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:06,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:06,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:24:06,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:24:06,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:06,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:06,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:06,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75633250] [2025-03-04 02:24:06,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75633250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:06,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711637284] [2025-03-04 02:24:06,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:06,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:06,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:06,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:06,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:24:06,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:24:06,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:24:06,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:06,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:06,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:24:06,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:06,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:06,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711637284] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:06,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:24:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-04 02:24:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331186220] [2025-03-04 02:24:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:06,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:24:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:06,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:24:06,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:24:06,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:06,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 225 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:06,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:06,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:06,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:07,012 INFO L124 PetriNetUnfolderBase]: 2183/3200 cut-off events. [2025-03-04 02:24:07,013 INFO L125 PetriNetUnfolderBase]: For 3322/3322 co-relation queries the response was YES. [2025-03-04 02:24:07,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9930 conditions, 3200 events. 2183/3200 cut-off events. For 3322/3322 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14240 event pairs, 471 based on Foata normal form. 12/3211 useless extension candidates. Maximal degree in co-relation 7162. Up to 573 conditions per place. [2025-03-04 02:24:07,029 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 124 selfloop transitions, 37 changer transitions 0/162 dead transitions. [2025-03-04 02:24:07,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 162 transitions, 1027 flow [2025-03-04 02:24:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:24:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:24:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 175 transitions. [2025-03-04 02:24:07,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47043010752688175 [2025-03-04 02:24:07,030 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 225 flow. Second operand 12 states and 175 transitions. [2025-03-04 02:24:07,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 162 transitions, 1027 flow [2025-03-04 02:24:07,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 162 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:07,045 INFO L231 Difference]: Finished difference. Result has 66 places, 73 transitions, 491 flow [2025-03-04 02:24:07,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=491, PETRI_PLACES=66, PETRI_TRANSITIONS=73} [2025-03-04 02:24:07,046 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2025-03-04 02:24:07,046 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 73 transitions, 491 flow [2025-03-04 02:24:07,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:07,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:07,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:07,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:24:07,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 02:24:07,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:07,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1140845794, now seen corresponding path program 3 times [2025-03-04 02:24:07,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:07,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964300866] [2025-03-04 02:24:07,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:24:07,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:07,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:24:07,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:24:07,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:24:07,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:07,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:07,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964300866] [2025-03-04 02:24:07,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964300866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:07,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664412834] [2025-03-04 02:24:07,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:24:07,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:07,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:07,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:07,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:24:07,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:24:07,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:24:07,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:24:07,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:07,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:24:07,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:07,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664412834] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:07,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:24:07,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-04 02:24:07,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119293217] [2025-03-04 02:24:07,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:07,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:24:07,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:07,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:24:07,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:24:07,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:07,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 73 transitions, 491 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:07,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:07,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:07,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:08,064 INFO L124 PetriNetUnfolderBase]: 2708/3961 cut-off events. [2025-03-04 02:24:08,065 INFO L125 PetriNetUnfolderBase]: For 8846/8846 co-relation queries the response was YES. [2025-03-04 02:24:08,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14911 conditions, 3961 events. 2708/3961 cut-off events. For 8846/8846 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 18502 event pairs, 709 based on Foata normal form. 14/3974 useless extension candidates. Maximal degree in co-relation 12501. Up to 963 conditions per place. [2025-03-04 02:24:08,087 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 130 selfloop transitions, 56 changer transitions 0/187 dead transitions. [2025-03-04 02:24:08,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 187 transitions, 1443 flow [2025-03-04 02:24:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:24:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:24:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2025-03-04 02:24:08,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.530791788856305 [2025-03-04 02:24:08,090 INFO L175 Difference]: Start difference. First operand has 66 places, 73 transitions, 491 flow. Second operand 11 states and 181 transitions. [2025-03-04 02:24:08,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 187 transitions, 1443 flow [2025-03-04 02:24:08,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 187 transitions, 1394 flow, removed 17 selfloop flow, removed 3 redundant places. [2025-03-04 02:24:08,133 INFO L231 Difference]: Finished difference. Result has 79 places, 97 transitions, 857 flow [2025-03-04 02:24:08,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=857, PETRI_PLACES=79, PETRI_TRANSITIONS=97} [2025-03-04 02:24:08,134 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 46 predicate places. [2025-03-04 02:24:08,135 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 97 transitions, 857 flow [2025-03-04 02:24:08,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:08,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:08,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:08,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:24:08,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:08,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:08,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:08,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1878611678, now seen corresponding path program 4 times [2025-03-04 02:24:08,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:08,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043569924] [2025-03-04 02:24:08,339 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:24:08,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:08,345 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:24:08,355 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:24:08,355 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:24:08,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:08,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:08,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043569924] [2025-03-04 02:24:08,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043569924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:08,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76549644] [2025-03-04 02:24:08,403 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:24:08,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:08,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:08,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:08,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:24:08,457 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:24:08,473 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:24:08,473 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:24:08,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:08,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:24:08,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:08,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:08,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76549644] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:08,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:24:08,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-03-04 02:24:08,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444310190] [2025-03-04 02:24:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:08,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:24:08,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:08,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:24:08,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:24:08,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:08,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 97 transitions, 857 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:08,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:08,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:08,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:09,077 INFO L124 PetriNetUnfolderBase]: 2786/4077 cut-off events. [2025-03-04 02:24:09,078 INFO L125 PetriNetUnfolderBase]: For 14309/14309 co-relation queries the response was YES. [2025-03-04 02:24:09,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17264 conditions, 4077 events. 2786/4077 cut-off events. For 14309/14309 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 19032 event pairs, 636 based on Foata normal form. 14/4090 useless extension candidates. Maximal degree in co-relation 14317. Up to 803 conditions per place. [2025-03-04 02:24:09,101 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 126 selfloop transitions, 55 changer transitions 0/182 dead transitions. [2025-03-04 02:24:09,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 182 transitions, 1645 flow [2025-03-04 02:24:09,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:24:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:24:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2025-03-04 02:24:09,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5290322580645161 [2025-03-04 02:24:09,102 INFO L175 Difference]: Start difference. First operand has 79 places, 97 transitions, 857 flow. Second operand 10 states and 164 transitions. [2025-03-04 02:24:09,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 182 transitions, 1645 flow [2025-03-04 02:24:09,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 182 transitions, 1576 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-03-04 02:24:09,148 INFO L231 Difference]: Finished difference. Result has 87 places, 104 transitions, 1056 flow [2025-03-04 02:24:09,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1056, PETRI_PLACES=87, PETRI_TRANSITIONS=104} [2025-03-04 02:24:09,149 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 54 predicate places. [2025-03-04 02:24:09,149 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 1056 flow [2025-03-04 02:24:09,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:09,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:09,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:09,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:24:09,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:09,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:09,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1300610296, now seen corresponding path program 5 times [2025-03-04 02:24:09,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:09,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955699750] [2025-03-04 02:24:09,352 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:24:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:09,360 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:24:09,367 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:24:09,367 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:09,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:09,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:09,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955699750] [2025-03-04 02:24:09,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955699750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:09,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772687008] [2025-03-04 02:24:09,441 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:24:09,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:09,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:09,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:09,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:24:09,487 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:24:09,503 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:24:09,503 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:09,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:09,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:24:09,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:09,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:09,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772687008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:24:09,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:24:09,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2025-03-04 02:24:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185616525] [2025-03-04 02:24:09,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:24:09,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:24:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:09,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:24:09,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:24:09,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:09,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 104 transitions, 1056 flow. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:09,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:09,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:09,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:10,662 INFO L124 PetriNetUnfolderBase]: 3332/4831 cut-off events. [2025-03-04 02:24:10,663 INFO L125 PetriNetUnfolderBase]: For 20168/20168 co-relation queries the response was YES. [2025-03-04 02:24:10,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21188 conditions, 4831 events. 3332/4831 cut-off events. For 20168/20168 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 23463 event pairs, 483 based on Foata normal form. 12/4842 useless extension candidates. Maximal degree in co-relation 18565. Up to 988 conditions per place. [2025-03-04 02:24:10,682 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 240 selfloop transitions, 166 changer transitions 0/407 dead transitions. [2025-03-04 02:24:10,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 407 transitions, 4100 flow [2025-03-04 02:24:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 02:24:10,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 02:24:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 378 transitions. [2025-03-04 02:24:10,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2025-03-04 02:24:10,684 INFO L175 Difference]: Start difference. First operand has 87 places, 104 transitions, 1056 flow. Second operand 27 states and 378 transitions. [2025-03-04 02:24:10,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 407 transitions, 4100 flow [2025-03-04 02:24:10,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 407 transitions, 3999 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-03-04 02:24:10,743 INFO L231 Difference]: Finished difference. Result has 121 places, 217 transitions, 2765 flow [2025-03-04 02:24:10,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2765, PETRI_PLACES=121, PETRI_TRANSITIONS=217} [2025-03-04 02:24:10,743 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 88 predicate places. [2025-03-04 02:24:10,743 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 217 transitions, 2765 flow [2025-03-04 02:24:10,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:10,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:10,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:10,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:24:10,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:10,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:10,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:10,945 INFO L85 PathProgramCache]: Analyzing trace with hash 395601210, now seen corresponding path program 6 times [2025-03-04 02:24:10,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:10,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274396427] [2025-03-04 02:24:10,945 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:24:10,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:10,951 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:24:10,956 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:24:10,957 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:24:10,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:11,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:11,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274396427] [2025-03-04 02:24:11,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274396427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:11,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759984800] [2025-03-04 02:24:11,028 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:24:11,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:11,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:11,030 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:11,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:24:11,075 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:24:11,091 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:24:11,091 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:24:11,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:11,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:24:11,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:11,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759984800] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:11,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:24:11,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-03-04 02:24:11,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375561228] [2025-03-04 02:24:11,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:11,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:24:11,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:11,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:24:11,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:24:11,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:11,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 217 transitions, 2765 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:11,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:11,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:11,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:11,801 INFO L124 PetriNetUnfolderBase]: 3377/4888 cut-off events. [2025-03-04 02:24:11,801 INFO L125 PetriNetUnfolderBase]: For 30730/30730 co-relation queries the response was YES. [2025-03-04 02:24:11,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24395 conditions, 4888 events. 3377/4888 cut-off events. For 30730/30730 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 23274 event pairs, 503 based on Foata normal form. 12/4900 useless extension candidates. Maximal degree in co-relation 22621. Up to 1124 conditions per place. [2025-03-04 02:24:11,898 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 175 selfloop transitions, 135 changer transitions 0/311 dead transitions. [2025-03-04 02:24:11,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 311 transitions, 3872 flow [2025-03-04 02:24:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:24:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:24:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2025-03-04 02:24:11,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48655913978494625 [2025-03-04 02:24:11,900 INFO L175 Difference]: Start difference. First operand has 121 places, 217 transitions, 2765 flow. Second operand 12 states and 181 transitions. [2025-03-04 02:24:11,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 311 transitions, 3872 flow [2025-03-04 02:24:12,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 311 transitions, 3732 flow, removed 56 selfloop flow, removed 3 redundant places. [2025-03-04 02:24:12,026 INFO L231 Difference]: Finished difference. Result has 132 places, 222 transitions, 3134 flow [2025-03-04 02:24:12,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2655, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3134, PETRI_PLACES=132, PETRI_TRANSITIONS=222} [2025-03-04 02:24:12,026 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 99 predicate places. [2025-03-04 02:24:12,027 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 222 transitions, 3134 flow [2025-03-04 02:24:12,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:12,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:12,027 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-04 02:24:12,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:24:12,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:12,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:12,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:12,231 INFO L85 PathProgramCache]: Analyzing trace with hash -398914141, now seen corresponding path program 1 times [2025-03-04 02:24:12,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:12,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688382635] [2025-03-04 02:24:12,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:12,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:12,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:24:12,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:24:12,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:12,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:12,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:12,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688382635] [2025-03-04 02:24:12,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688382635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:12,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:24:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283234231] [2025-03-04 02:24:12,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:12,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:24:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:12,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:24:12,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:24:12,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:12,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 222 transitions, 3134 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:12,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:12,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:12,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:12,685 INFO L124 PetriNetUnfolderBase]: 2806/4081 cut-off events. [2025-03-04 02:24:12,685 INFO L125 PetriNetUnfolderBase]: For 35181/35181 co-relation queries the response was YES. [2025-03-04 02:24:12,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22001 conditions, 4081 events. 2806/4081 cut-off events. For 35181/35181 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 18927 event pairs, 1106 based on Foata normal form. 83/4164 useless extension candidates. Maximal degree in co-relation 20277. Up to 3415 conditions per place. [2025-03-04 02:24:12,710 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 223 selfloop transitions, 7 changer transitions 0/231 dead transitions. [2025-03-04 02:24:12,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 231 transitions, 3581 flow [2025-03-04 02:24:12,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:24:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:24:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-03-04 02:24:12,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5096774193548387 [2025-03-04 02:24:12,711 INFO L175 Difference]: Start difference. First operand has 132 places, 222 transitions, 3134 flow. Second operand 5 states and 79 transitions. [2025-03-04 02:24:12,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 231 transitions, 3581 flow [2025-03-04 02:24:12,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 231 transitions, 3456 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-04 02:24:12,844 INFO L231 Difference]: Finished difference. Result has 122 places, 201 transitions, 2870 flow [2025-03-04 02:24:12,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2844, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2870, PETRI_PLACES=122, PETRI_TRANSITIONS=201} [2025-03-04 02:24:12,845 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 89 predicate places. [2025-03-04 02:24:12,845 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 201 transitions, 2870 flow [2025-03-04 02:24:12,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:12,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:12,845 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-04 02:24:12,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:24:12,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:12,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:12,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1507440350, now seen corresponding path program 1 times [2025-03-04 02:24:12,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:12,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918088535] [2025-03-04 02:24:12,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:12,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:24:12,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:24:12,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:12,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:12,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:12,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918088535] [2025-03-04 02:24:12,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918088535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:12,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:12,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:24:12,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671674661] [2025-03-04 02:24:12,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:12,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:24:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:12,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:24:12,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:24:12,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:12,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 201 transitions, 2870 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:12,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:12,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:12,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:13,319 INFO L124 PetriNetUnfolderBase]: 2517/3634 cut-off events. [2025-03-04 02:24:13,320 INFO L125 PetriNetUnfolderBase]: For 31739/31739 co-relation queries the response was YES. [2025-03-04 02:24:13,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20018 conditions, 3634 events. 2517/3634 cut-off events. For 31739/31739 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 15922 event pairs, 1018 based on Foata normal form. 22/3656 useless extension candidates. Maximal degree in co-relation 19262. Up to 3415 conditions per place. [2025-03-04 02:24:13,346 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 183 selfloop transitions, 2 changer transitions 23/209 dead transitions. [2025-03-04 02:24:13,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 209 transitions, 3294 flow [2025-03-04 02:24:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:24:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:24:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-03-04 02:24:13,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45806451612903226 [2025-03-04 02:24:13,347 INFO L175 Difference]: Start difference. First operand has 122 places, 201 transitions, 2870 flow. Second operand 5 states and 71 transitions. [2025-03-04 02:24:13,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 209 transitions, 3294 flow [2025-03-04 02:24:13,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 209 transitions, 3157 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-03-04 02:24:13,494 INFO L231 Difference]: Finished difference. Result has 115 places, 186 transitions, 2651 flow [2025-03-04 02:24:13,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2679, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2651, PETRI_PLACES=115, PETRI_TRANSITIONS=186} [2025-03-04 02:24:13,495 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 82 predicate places. [2025-03-04 02:24:13,495 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 186 transitions, 2651 flow [2025-03-04 02:24:13,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:13,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:13,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:13,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:24:13,495 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:13,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1483541791, now seen corresponding path program 1 times [2025-03-04 02:24:13,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:13,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534086573] [2025-03-04 02:24:13,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:13,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:13,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:24:13,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:13,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:13,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:13,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:13,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534086573] [2025-03-04 02:24:13,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534086573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:13,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252341597] [2025-03-04 02:24:13,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:13,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:13,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:13,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:13,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:24:13,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:24:13,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:24:13,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:13,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:13,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:24:13,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:13,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252341597] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:13,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:24:13,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-04 02:24:13,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524469401] [2025-03-04 02:24:13,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:13,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:24:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:13,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:24:13,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:24:13,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:13,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 186 transitions, 2651 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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-04 02:24:13,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:13,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:13,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:14,002 INFO L124 PetriNetUnfolderBase]: 2615/3717 cut-off events. [2025-03-04 02:24:14,002 INFO L125 PetriNetUnfolderBase]: For 31600/31600 co-relation queries the response was YES. [2025-03-04 02:24:14,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20462 conditions, 3717 events. 2615/3717 cut-off events. For 31600/31600 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16238 event pairs, 743 based on Foata normal form. 248/3965 useless extension candidates. Maximal degree in co-relation 20410. Up to 2853 conditions per place. [2025-03-04 02:24:14,023 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 267 selfloop transitions, 13 changer transitions 0/281 dead transitions. [2025-03-04 02:24:14,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 281 transitions, 4638 flow [2025-03-04 02:24:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:24:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:24:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-03-04 02:24:14,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2025-03-04 02:24:14,024 INFO L175 Difference]: Start difference. First operand has 115 places, 186 transitions, 2651 flow. Second operand 5 states and 64 transitions. [2025-03-04 02:24:14,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 281 transitions, 4638 flow [2025-03-04 02:24:14,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 281 transitions, 4551 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-03-04 02:24:14,115 INFO L231 Difference]: Finished difference. Result has 108 places, 187 transitions, 2649 flow [2025-03-04 02:24:14,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2588, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2649, PETRI_PLACES=108, PETRI_TRANSITIONS=187} [2025-03-04 02:24:14,115 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 75 predicate places. [2025-03-04 02:24:14,115 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 187 transitions, 2649 flow [2025-03-04 02:24:14,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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-04 02:24:14,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:14,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:14,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:24:14,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:14,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:14,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:14,317 INFO L85 PathProgramCache]: Analyzing trace with hash 685758406, now seen corresponding path program 1 times [2025-03-04 02:24:14,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:14,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582955160] [2025-03-04 02:24:14,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:14,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:14,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:24:14,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:14,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:14,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:14,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:14,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582955160] [2025-03-04 02:24:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582955160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:14,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568942380] [2025-03-04 02:24:14,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:14,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:14,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:14,727 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:14,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:24:14,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:24:14,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:14,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:14,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:14,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 02:24:14,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:14,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:24:14,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:24:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:14,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:15,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 02:24:15,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:24:15,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2025-03-04 02:24:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:15,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568942380] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:24:15,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:24:15,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-04 02:24:15,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295000917] [2025-03-04 02:24:15,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:24:15,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:24:15,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:15,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:24:15,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:24:15,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:15,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 187 transitions, 2649 flow. Second operand has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:15,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:15,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:15,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:16,480 INFO L124 PetriNetUnfolderBase]: 4393/6244 cut-off events. [2025-03-04 02:24:16,480 INFO L125 PetriNetUnfolderBase]: For 47380/47380 co-relation queries the response was YES. [2025-03-04 02:24:16,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33756 conditions, 6244 events. 4393/6244 cut-off events. For 47380/47380 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 29773 event pairs, 324 based on Foata normal form. 2/6246 useless extension candidates. Maximal degree in co-relation 31226. Up to 3993 conditions per place. [2025-03-04 02:24:16,510 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 597 selfloop transitions, 102 changer transitions 2/702 dead transitions. [2025-03-04 02:24:16,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 702 transitions, 10479 flow [2025-03-04 02:24:16,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:24:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:24:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 218 transitions. [2025-03-04 02:24:16,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5023041474654378 [2025-03-04 02:24:16,511 INFO L175 Difference]: Start difference. First operand has 108 places, 187 transitions, 2649 flow. Second operand 14 states and 218 transitions. [2025-03-04 02:24:16,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 702 transitions, 10479 flow [2025-03-04 02:24:16,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 702 transitions, 10441 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 02:24:16,733 INFO L231 Difference]: Finished difference. Result has 125 places, 285 transitions, 4291 flow [2025-03-04 02:24:16,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4291, PETRI_PLACES=125, PETRI_TRANSITIONS=285} [2025-03-04 02:24:16,734 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 92 predicate places. [2025-03-04 02:24:16,734 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 285 transitions, 4291 flow [2025-03-04 02:24:16,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:16,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:16,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:16,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 02:24:16,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 02:24:16,935 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:16,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash 450747118, now seen corresponding path program 2 times [2025-03-04 02:24:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:16,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576451777] [2025-03-04 02:24:16,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:16,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:16,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:24:16,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:16,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:16,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:17,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:17,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576451777] [2025-03-04 02:24:17,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576451777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:17,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669535316] [2025-03-04 02:24:17,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:17,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:17,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:17,311 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:17,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:24:17,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:24:17,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:17,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:17,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:17,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 02:24:17,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:17,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:24:17,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:24:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:17,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:17,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 02:24:17,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:24:17,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2025-03-04 02:24:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:17,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669535316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:24:17,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:24:17,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2025-03-04 02:24:17,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404195266] [2025-03-04 02:24:17,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:24:17,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:24:17,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:17,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:24:17,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:24:17,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:17,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 285 transitions, 4291 flow. Second operand has 24 states, 24 states have (on average 6.375) internal successors, (153), 24 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:17,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:17,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:17,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:19,671 INFO L124 PetriNetUnfolderBase]: 5739/8164 cut-off events. [2025-03-04 02:24:19,671 INFO L125 PetriNetUnfolderBase]: For 69914/69914 co-relation queries the response was YES. [2025-03-04 02:24:19,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47533 conditions, 8164 events. 5739/8164 cut-off events. For 69914/69914 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 40344 event pairs, 569 based on Foata normal form. 3/8167 useless extension candidates. Maximal degree in co-relation 44347. Up to 6128 conditions per place. [2025-03-04 02:24:19,723 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 601 selfloop transitions, 237 changer transitions 2/841 dead transitions. [2025-03-04 02:24:19,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 841 transitions, 12696 flow [2025-03-04 02:24:19,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 02:24:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-04 02:24:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 413 transitions. [2025-03-04 02:24:19,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37007168458781364 [2025-03-04 02:24:19,724 INFO L175 Difference]: Start difference. First operand has 125 places, 285 transitions, 4291 flow. Second operand 36 states and 413 transitions. [2025-03-04 02:24:19,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 841 transitions, 12696 flow [2025-03-04 02:24:20,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 841 transitions, 12624 flow, removed 35 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:20,138 INFO L231 Difference]: Finished difference. Result has 177 places, 522 transitions, 8518 flow [2025-03-04 02:24:20,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=4235, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=8518, PETRI_PLACES=177, PETRI_TRANSITIONS=522} [2025-03-04 02:24:20,138 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 144 predicate places. [2025-03-04 02:24:20,139 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 522 transitions, 8518 flow [2025-03-04 02:24:20,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.375) internal successors, (153), 24 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:20,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:20,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:20,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 02:24:20,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 02:24:20,339 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:20,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:20,340 INFO L85 PathProgramCache]: Analyzing trace with hash 599190345, now seen corresponding path program 1 times [2025-03-04 02:24:20,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:20,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461024457] [2025-03-04 02:24:20,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:20,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:20,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:24:20,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:20,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:20,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:20,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461024457] [2025-03-04 02:24:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461024457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182395713] [2025-03-04 02:24:20,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:20,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:20,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:20,644 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:20,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:24:20,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:24:20,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:20,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:20,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:20,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:24:20,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:20,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:24:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:20,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:20,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:24:20,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 02:24:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:20,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182395713] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:24:20,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:24:20,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 18 [2025-03-04 02:24:20,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146369673] [2025-03-04 02:24:20,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:24:20,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:24:20,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:20,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:24:20,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:24:20,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:20,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 522 transitions, 8518 flow. Second operand has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:20,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:20,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:20,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:22,348 INFO L124 PetriNetUnfolderBase]: 7678/10922 cut-off events. [2025-03-04 02:24:22,348 INFO L125 PetriNetUnfolderBase]: For 106064/106064 co-relation queries the response was YES. [2025-03-04 02:24:22,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68765 conditions, 10922 events. 7678/10922 cut-off events. For 106064/106064 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 57139 event pairs, 436 based on Foata normal form. 2/10924 useless extension candidates. Maximal degree in co-relation 68157. Up to 6802 conditions per place. [2025-03-04 02:24:22,437 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 643 selfloop transitions, 280 changer transitions 1/925 dead transitions. [2025-03-04 02:24:22,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 925 transitions, 16078 flow [2025-03-04 02:24:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:24:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:24:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 204 transitions. [2025-03-04 02:24:22,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4700460829493088 [2025-03-04 02:24:22,438 INFO L175 Difference]: Start difference. First operand has 177 places, 522 transitions, 8518 flow. Second operand 14 states and 204 transitions. [2025-03-04 02:24:22,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 925 transitions, 16078 flow [2025-03-04 02:24:23,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 925 transitions, 15491 flow, removed 265 selfloop flow, removed 4 redundant places. [2025-03-04 02:24:23,377 INFO L231 Difference]: Finished difference. Result has 193 places, 664 transitions, 10893 flow [2025-03-04 02:24:23,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=8092, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10893, PETRI_PLACES=193, PETRI_TRANSITIONS=664} [2025-03-04 02:24:23,378 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 160 predicate places. [2025-03-04 02:24:23,378 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 664 transitions, 10893 flow [2025-03-04 02:24:23,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:23,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:23,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:23,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 02:24:23,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 02:24:23,579 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:23,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:23,579 INFO L85 PathProgramCache]: Analyzing trace with hash -523516968, now seen corresponding path program 3 times [2025-03-04 02:24:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:23,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223204158] [2025-03-04 02:24:23,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:24:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:23,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:24:23,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:23,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:24:23,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:23,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223204158] [2025-03-04 02:24:23,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223204158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:23,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679340362] [2025-03-04 02:24:23,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:24:23,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:23,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:23,898 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:23,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:24:23,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:24:23,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:23,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:24:23,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:23,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 02:24:23,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:23,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:24:24,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:24:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:24,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:24,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 02:24:24,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:24:24,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2025-03-04 02:24:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:24,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679340362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:24:24,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:24:24,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2025-03-04 02:24:24,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601594370] [2025-03-04 02:24:24,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:24:24,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:24:24,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:24,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:24:24,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:24:24,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:24,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 664 transitions, 10893 flow. Second operand has 24 states, 24 states have (on average 6.375) internal successors, (153), 24 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:24,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:24,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:24,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:27,001 INFO L124 PetriNetUnfolderBase]: 9225/13143 cut-off events. [2025-03-04 02:24:27,001 INFO L125 PetriNetUnfolderBase]: For 145281/145281 co-relation queries the response was YES. [2025-03-04 02:24:27,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88995 conditions, 13143 events. 9225/13143 cut-off events. For 145281/145281 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 70813 event pairs, 920 based on Foata normal form. 3/13146 useless extension candidates. Maximal degree in co-relation 88315. Up to 10541 conditions per place. [2025-03-04 02:24:27,138 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 933 selfloop transitions, 274 changer transitions 2/1210 dead transitions. [2025-03-04 02:24:27,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1210 transitions, 21110 flow [2025-03-04 02:24:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 02:24:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 02:24:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 385 transitions. [2025-03-04 02:24:27,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2025-03-04 02:24:27,140 INFO L175 Difference]: Start difference. First operand has 193 places, 664 transitions, 10893 flow. Second operand 30 states and 385 transitions. [2025-03-04 02:24:27,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 1210 transitions, 21110 flow [2025-03-04 02:24:28,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 1210 transitions, 20921 flow, removed 92 selfloop flow, removed 2 redundant places. [2025-03-04 02:24:28,581 INFO L231 Difference]: Finished difference. Result has 234 places, 831 transitions, 14471 flow [2025-03-04 02:24:28,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=10808, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=14471, PETRI_PLACES=234, PETRI_TRANSITIONS=831} [2025-03-04 02:24:28,581 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 201 predicate places. [2025-03-04 02:24:28,581 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 831 transitions, 14471 flow [2025-03-04 02:24:28,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.375) internal successors, (153), 24 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:28,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:28,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:28,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 02:24:28,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:24:28,782 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:28,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash 89303990, now seen corresponding path program 4 times [2025-03-04 02:24:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891914675] [2025-03-04 02:24:28,783 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:24:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:28,787 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:24:28,793 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:28,793 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:24:28,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891914675] [2025-03-04 02:24:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891914675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220711657] [2025-03-04 02:24:29,056 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:24:29,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:29,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:29,058 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:29,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:24:29,100 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:24:29,115 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:29,116 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:24:29,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:29,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 02:24:29,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:29,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:24:29,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:24:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:29,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:29,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220711657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:24:29,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:24:29,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 25 [2025-03-04 02:24:29,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553455440] [2025-03-04 02:24:29,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:24:29,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 02:24:29,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:29,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 02:24:29,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:24:29,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:29,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 831 transitions, 14471 flow. Second operand has 26 states, 26 states have (on average 6.1923076923076925) internal successors, (161), 26 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:29,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:29,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:29,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:32,956 INFO L124 PetriNetUnfolderBase]: 11622/16603 cut-off events. [2025-03-04 02:24:32,957 INFO L125 PetriNetUnfolderBase]: For 196821/196821 co-relation queries the response was YES. [2025-03-04 02:24:33,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115243 conditions, 16603 events. 11622/16603 cut-off events. For 196821/196821 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 93715 event pairs, 934 based on Foata normal form. 2/16605 useless extension candidates. Maximal degree in co-relation 114126. Up to 12855 conditions per place. [2025-03-04 02:24:33,111 INFO L140 encePairwiseOnDemand]: 15/31 looper letters, 880 selfloop transitions, 482 changer transitions 1/1364 dead transitions. [2025-03-04 02:24:33,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 1364 transitions, 25053 flow [2025-03-04 02:24:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 02:24:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 02:24:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 351 transitions. [2025-03-04 02:24:33,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36524453694068676 [2025-03-04 02:24:33,113 INFO L175 Difference]: Start difference. First operand has 234 places, 831 transitions, 14471 flow. Second operand 31 states and 351 transitions. [2025-03-04 02:24:33,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 1364 transitions, 25053 flow [2025-03-04 02:24:35,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1364 transitions, 24419 flow, removed 258 selfloop flow, removed 5 redundant places. [2025-03-04 02:24:35,232 INFO L231 Difference]: Finished difference. Result has 274 places, 1110 transitions, 19791 flow [2025-03-04 02:24:35,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=13967, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=831, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=19791, PETRI_PLACES=274, PETRI_TRANSITIONS=1110} [2025-03-04 02:24:35,233 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 241 predicate places. [2025-03-04 02:24:35,233 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 1110 transitions, 19791 flow [2025-03-04 02:24:35,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.1923076923076925) internal successors, (161), 26 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:35,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:35,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:35,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 02:24:35,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:24:35,434 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:35,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:35,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1524262744, now seen corresponding path program 5 times [2025-03-04 02:24:35,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:35,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285854770] [2025-03-04 02:24:35,434 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:24:35,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:35,439 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 3 equivalence classes. [2025-03-04 02:24:35,447 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:35,447 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:24:35,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:35,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:35,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285854770] [2025-03-04 02:24:35,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285854770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:35,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428556556] [2025-03-04 02:24:35,632 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:24:35,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:35,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:35,634 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:35,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:24:35,685 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 3 equivalence classes. [2025-03-04 02:24:35,704 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:35,705 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:24:35,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:35,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 02:24:35,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:35,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:24:35,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:24:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:35,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:36,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 02:24:36,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:24:36,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2025-03-04 02:24:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:36,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428556556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:24:36,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:24:36,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-04 02:24:36,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571806245] [2025-03-04 02:24:36,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:24:36,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:24:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:36,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:24:36,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:24:36,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:36,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 1110 transitions, 19791 flow. Second operand has 22 states, 22 states have (on average 6.409090909090909) internal successors, (141), 22 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:36,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:36,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:36,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:40,127 INFO L124 PetriNetUnfolderBase]: 13252/18924 cut-off events. [2025-03-04 02:24:40,127 INFO L125 PetriNetUnfolderBase]: For 268547/268547 co-relation queries the response was YES. [2025-03-04 02:24:40,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143193 conditions, 18924 events. 13252/18924 cut-off events. For 268547/268547 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 108933 event pairs, 1454 based on Foata normal form. 2/18926 useless extension candidates. Maximal degree in co-relation 142261. Up to 15970 conditions per place. [2025-03-04 02:24:40,373 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 1195 selfloop transitions, 279 changer transitions 1/1476 dead transitions. [2025-03-04 02:24:40,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 1476 transitions, 29096 flow [2025-03-04 02:24:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:24:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:24:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 174 transitions. [2025-03-04 02:24:40,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2025-03-04 02:24:40,374 INFO L175 Difference]: Start difference. First operand has 274 places, 1110 transitions, 19791 flow. Second operand 12 states and 174 transitions. [2025-03-04 02:24:40,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 1476 transitions, 29096 flow [2025-03-04 02:24:43,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 1476 transitions, 28263 flow, removed 414 selfloop flow, removed 2 redundant places. [2025-03-04 02:24:43,841 INFO L231 Difference]: Finished difference. Result has 288 places, 1204 transitions, 22153 flow [2025-03-04 02:24:43,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=19290, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=860, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=22153, PETRI_PLACES=288, PETRI_TRANSITIONS=1204} [2025-03-04 02:24:43,842 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 255 predicate places. [2025-03-04 02:24:43,842 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 1204 transitions, 22153 flow [2025-03-04 02:24:43,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.409090909090909) internal successors, (141), 22 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:43,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:43,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:43,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 02:24:44,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 02:24:44,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:44,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:44,043 INFO L85 PathProgramCache]: Analyzing trace with hash 740294115, now seen corresponding path program 2 times [2025-03-04 02:24:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:44,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346066] [2025-03-04 02:24:44,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:44,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:44,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:24:44,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:44,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:44,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:44,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:44,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346066] [2025-03-04 02:24:44,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:44,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801830926] [2025-03-04 02:24:44,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:44,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:44,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:44,216 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:44,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:24:44,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:24:44,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:44,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:44,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:44,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:24:44,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:44,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:24:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:44,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:44,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:24:44,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 16 [2025-03-04 02:24:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:44,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801830926] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:24:44,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:24:44,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 17 [2025-03-04 02:24:44,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644673928] [2025-03-04 02:24:44,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:24:44,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:24:44,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:44,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:24:44,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:24:44,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:44,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 1204 transitions, 22153 flow. Second operand has 18 states, 18 states have (on average 6.833333333333333) internal successors, (123), 18 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:44,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:44,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:44,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:49,265 INFO L124 PetriNetUnfolderBase]: 15741/22473 cut-off events. [2025-03-04 02:24:49,265 INFO L125 PetriNetUnfolderBase]: For 338966/338966 co-relation queries the response was YES. [2025-03-04 02:24:49,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173520 conditions, 22473 events. 15741/22473 cut-off events. For 338966/338966 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 133799 event pairs, 1560 based on Foata normal form. 2/22475 useless extension candidates. Maximal degree in co-relation 172522. Up to 18157 conditions per place. [2025-03-04 02:24:49,569 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 1214 selfloop transitions, 396 changer transitions 1/1612 dead transitions. [2025-03-04 02:24:49,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 1612 transitions, 32230 flow [2025-03-04 02:24:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:24:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:24:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 180 transitions. [2025-03-04 02:24:49,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2025-03-04 02:24:49,570 INFO L175 Difference]: Start difference. First operand has 288 places, 1204 transitions, 22153 flow. Second operand 12 states and 180 transitions. [2025-03-04 02:24:49,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 1612 transitions, 32230 flow [2025-03-04 02:24:53,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 1612 transitions, 31715 flow, removed 202 selfloop flow, removed 4 redundant places. [2025-03-04 02:24:53,527 INFO L231 Difference]: Finished difference. Result has 299 places, 1358 transitions, 25461 flow [2025-03-04 02:24:53,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=21734, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=863, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=25461, PETRI_PLACES=299, PETRI_TRANSITIONS=1358} [2025-03-04 02:24:53,528 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 266 predicate places. [2025-03-04 02:24:53,529 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 1358 transitions, 25461 flow [2025-03-04 02:24:53,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.833333333333333) internal successors, (123), 18 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:53,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:53,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:53,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 02:24:53,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:53,729 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:24:53,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash 186963395, now seen corresponding path program 3 times [2025-03-04 02:24:53,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:53,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027165007] [2025-03-04 02:24:53,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:24:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:53,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-04 02:24:53,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:53,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:24:53,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:53,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:53,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027165007] [2025-03-04 02:24:53,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027165007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:53,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814374860] [2025-03-04 02:24:53,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:24:53,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:53,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:53,895 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:24:53,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:24:53,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-04 02:24:53,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:24:53,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:24:53,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:53,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:24:53,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:54,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:24:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:54,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:54,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:24:54,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 16 [2025-03-04 02:24:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:54,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814374860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:24:54,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:24:54,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2025-03-04 02:24:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268800045] [2025-03-04 02:24:54,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:24:54,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:24:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:54,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:24:54,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:24:54,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:24:54,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 1358 transitions, 25461 flow. Second operand has 16 states, 16 states have (on average 6.5625) internal successors, (105), 16 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:54,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:54,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:24:54,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:59,943 INFO L124 PetriNetUnfolderBase]: 16673/23801 cut-off events. [2025-03-04 02:24:59,943 INFO L125 PetriNetUnfolderBase]: For 391933/391933 co-relation queries the response was YES. [2025-03-04 02:25:00,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190362 conditions, 23801 events. 16673/23801 cut-off events. For 391933/391933 co-relation queries the response was YES. Maximal size of possible extension queue 1084. Compared 142915 event pairs, 1792 based on Foata normal form. 2/23803 useless extension candidates. Maximal degree in co-relation 189463. Up to 21194 conditions per place. [2025-03-04 02:25:00,329 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 1250 selfloop transitions, 324 changer transitions 1/1576 dead transitions. [2025-03-04 02:25:00,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 1576 transitions, 32255 flow [2025-03-04 02:25:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:25:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:25:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 190 transitions. [2025-03-04 02:25:00,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47146401985111663 [2025-03-04 02:25:00,330 INFO L175 Difference]: Start difference. First operand has 299 places, 1358 transitions, 25461 flow. Second operand 13 states and 190 transitions. [2025-03-04 02:25:00,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 1576 transitions, 32255 flow [2025-03-04 02:25:05,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 1576 transitions, 31334 flow, removed 116 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:05,157 INFO L231 Difference]: Finished difference. Result has 309 places, 1401 transitions, 26138 flow [2025-03-04 02:25:05,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=24576, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=288, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=26138, PETRI_PLACES=309, PETRI_TRANSITIONS=1401} [2025-03-04 02:25:05,158 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 276 predicate places. [2025-03-04 02:25:05,158 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 1401 transitions, 26138 flow [2025-03-04 02:25:05,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.5625) internal successors, (105), 16 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:05,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:05,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:05,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 02:25:05,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:05,360 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:05,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1907184036, now seen corresponding path program 6 times [2025-03-04 02:25:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:05,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048344947] [2025-03-04 02:25:05,360 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:25:05,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:05,365 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:25:05,374 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:25:05,374 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:25:05,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:05,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:05,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048344947] [2025-03-04 02:25:05,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048344947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:05,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075713039] [2025-03-04 02:25:05,597 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:25:05,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:05,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:05,599 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:05,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 02:25:05,648 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:25:05,666 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:25:05,667 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:25:05,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:05,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 02:25:05,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:05,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:25:05,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:25:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:05,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075713039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:06,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:06,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 26 [2025-03-04 02:25:06,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558336097] [2025-03-04 02:25:06,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:06,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 02:25:06,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:06,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 02:25:06,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2025-03-04 02:25:06,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:25:06,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 1401 transitions, 26138 flow. Second operand has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 27 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:06,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:06,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:25:06,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:16,167 INFO L124 PetriNetUnfolderBase]: 23070/33108 cut-off events. [2025-03-04 02:25:16,167 INFO L125 PetriNetUnfolderBase]: For 544493/544493 co-relation queries the response was YES. [2025-03-04 02:25:16,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263918 conditions, 33108 events. 23070/33108 cut-off events. For 544493/544493 co-relation queries the response was YES. Maximal size of possible extension queue 1530. Compared 210380 event pairs, 1727 based on Foata normal form. 4/33112 useless extension candidates. Maximal degree in co-relation 262218. Up to 21511 conditions per place. [2025-03-04 02:25:16,907 INFO L140 encePairwiseOnDemand]: 13/31 looper letters, 1321 selfloop transitions, 1473 changer transitions 2/2797 dead transitions. [2025-03-04 02:25:16,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 2797 transitions, 53188 flow [2025-03-04 02:25:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-03-04 02:25:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2025-03-04 02:25:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 1058 transitions. [2025-03-04 02:25:16,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3379112104758863 [2025-03-04 02:25:16,909 INFO L175 Difference]: Start difference. First operand has 309 places, 1401 transitions, 26138 flow. Second operand 101 states and 1058 transitions. [2025-03-04 02:25:16,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 2797 transitions, 53188 flow [2025-03-04 02:25:24,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 2797 transitions, 52348 flow, removed 233 selfloop flow, removed 5 redundant places. [2025-03-04 02:25:24,840 INFO L231 Difference]: Finished difference. Result has 430 places, 2356 transitions, 46277 flow [2025-03-04 02:25:24,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=25700, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=627, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=101, PETRI_FLOW=46277, PETRI_PLACES=430, PETRI_TRANSITIONS=2356} [2025-03-04 02:25:24,841 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 397 predicate places. [2025-03-04 02:25:24,842 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 2356 transitions, 46277 flow [2025-03-04 02:25:24,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 27 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:24,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:24,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:24,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 02:25:25,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:25,043 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:25:25,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:25,044 INFO L85 PathProgramCache]: Analyzing trace with hash -567362134, now seen corresponding path program 7 times [2025-03-04 02:25:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:25,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516939801] [2025-03-04 02:25:25,044 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:25:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:25,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:25:25,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:25:25,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:25,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:25,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:25,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516939801] [2025-03-04 02:25:25,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516939801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:25,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999739396] [2025-03-04 02:25:25,306 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:25:25,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:25,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:25,308 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:25,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 02:25:25,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:25:25,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:25:25,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:25,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:25,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 02:25:25,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:25,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:25:25,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 02:25:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:25,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:25,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999739396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:25,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:25,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 26 [2025-03-04 02:25:25,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139744140] [2025-03-04 02:25:25,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:25,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 02:25:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:25,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 02:25:25,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2025-03-04 02:25:25,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:25:25,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 2356 transitions, 46277 flow. Second operand has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 27 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:25,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:25,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:25:25,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand