./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-min-array-hom.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 0224e82797c7b26c7800eaf85be5e5678e7961d21aa4e2312eda2860d261b33a --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:07:47,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:07:47,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:07:47,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:07:47,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:07:47,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:07:47,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:07:47,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:07:47,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:07:47,975 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:07:47,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:07:47,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:07:47,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:07:47,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:07:47,975 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:07:47,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:07:47,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:07:47,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:07:47,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:07:47,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:07:47,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:07:47,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:07:47,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:07:47,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:07:47,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:07:47,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:07:47,977 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:07:47,977 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:07:47,977 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:07:47,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:07:47,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:07:47,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:07:47,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:07:47,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:07:47,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:07:47,977 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:07:47,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:07:47,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:07:47,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:07:47,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:07:47,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:07:47,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:07:47,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:07:47,978 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 -> 0224e82797c7b26c7800eaf85be5e5678e7961d21aa4e2312eda2860d261b33a [2025-03-14 01:07:48,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:07:48,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:07:48,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:07:48,265 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:07:48,265 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:07:48,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2025-03-14 01:07:49,646 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d22afbc/5f808d4b30bc4f5e98e0d1e16615b03f/FLAG49f319e80 [2025-03-14 01:07:49,856 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:07:49,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2025-03-14 01:07:49,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d22afbc/5f808d4b30bc4f5e98e0d1e16615b03f/FLAG49f319e80 [2025-03-14 01:07:49,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d22afbc/5f808d4b30bc4f5e98e0d1e16615b03f [2025-03-14 01:07:49,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:07:49,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:07:49,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:07:49,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:07:49,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:07:49,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:07:49" (1/1) ... [2025-03-14 01:07:49,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c10dffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:49, skipping insertion in model container [2025-03-14 01:07:49,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:07:49" (1/1) ... [2025-03-14 01:07:49,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:07:50,037 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-min-array-hom.wvr.c[2625,2638] [2025-03-14 01:07:50,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:07:50,051 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:07:50,069 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-min-array-hom.wvr.c[2625,2638] [2025-03-14 01:07:50,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:07:50,090 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:07:50,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50 WrapperNode [2025-03-14 01:07:50,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:07:50,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:07:50,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:07:50,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:07:50,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (1/1) ... [2025-03-14 01:07:50,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (1/1) ... [2025-03-14 01:07:50,120 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-03-14 01:07:50,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:07:50,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:07:50,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:07:50,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:07:50,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (1/1) ... [2025-03-14 01:07:50,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (1/1) ... [2025-03-14 01:07:50,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (1/1) ... [2025-03-14 01:07:50,145 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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-14 01:07:50,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (1/1) ... [2025-03-14 01:07:50,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (1/1) ... [2025-03-14 01:07:50,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (1/1) ... [2025-03-14 01:07:50,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (1/1) ... [2025-03-14 01:07:50,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (1/1) ... [2025-03-14 01:07:50,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (1/1) ... [2025-03-14 01:07:50,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:07:50,164 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:07:50,166 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:07:50,167 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:07:50,167 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (1/1) ... [2025-03-14 01:07:50,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:07:50,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:50,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:07:50,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:07:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:07:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:07:50,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:07:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:07:50,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:07:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:07:50,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:07:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:07:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:07:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:07:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:07:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:07:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:07:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:07:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:07:50,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:07:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:07:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:07:50,218 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:07:50,304 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:07:50,306 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:07:50,518 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:07:50,519 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:07:50,519 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:07:50,737 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:07:50,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:07:50 BoogieIcfgContainer [2025-03-14 01:07:50,739 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:07:50,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:07:50,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:07:50,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:07:50,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:07:49" (1/3) ... [2025-03-14 01:07:50,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1485fb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:07:50, skipping insertion in model container [2025-03-14 01:07:50,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:50" (2/3) ... [2025-03-14 01:07:50,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1485fb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:07:50, skipping insertion in model container [2025-03-14 01:07:50,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:07:50" (3/3) ... [2025-03-14 01:07:50,748 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2025-03-14 01:07:50,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:07:50,760 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array-hom.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-14 01:07:50,760 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:07:50,804 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:07:50,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2025-03-14 01:07:50,877 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-14 01:07:50,887 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:07:50,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 4/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-14 01:07:50,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2025-03-14 01:07:50,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-03-14 01:07:50,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:07:50,964 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;@649f1fc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:07:50,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:07:50,979 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:07:50,981 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-14 01:07:50,981 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:07:50,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:50,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:07:50,983 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-14 01:07:50,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash 557860275, now seen corresponding path program 1 times [2025-03-14 01:07:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:50,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190613979] [2025-03-14 01:07:50,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:51,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:51,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 01:07:51,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:07:51,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:51,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:51,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:51,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190613979] [2025-03-14 01:07:51,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190613979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:51,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:51,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:07:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245338456] [2025-03-14 01:07:51,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:51,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:07:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:51,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:07:51,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:07:51,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-14 01:07:51,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-14 01:07:51,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:51,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-14 01:07:51,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:51,902 INFO L124 PetriNetUnfolderBase]: 617/954 cut-off events. [2025-03-14 01:07:51,903 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-14 01:07:51,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 954 events. 617/954 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3780 event pairs, 126 based on Foata normal form. 1/950 useless extension candidates. Maximal degree in co-relation 1715. Up to 677 conditions per place. [2025-03-14 01:07:51,919 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-03-14 01:07:51,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2025-03-14 01:07:51,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:07:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:07:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-14 01:07:51,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-03-14 01:07:51,935 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2025-03-14 01:07:51,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2025-03-14 01:07:51,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:07:51,944 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2025-03-14 01:07:51,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-03-14 01:07:51,949 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-03-14 01:07:51,949 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2025-03-14 01:07:51,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-14 01:07:51,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:51,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:07:51,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:07:51,950 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-14 01:07:51,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1404449691, now seen corresponding path program 1 times [2025-03-14 01:07:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:51,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886886896] [2025-03-14 01:07:51,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:51,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:51,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:07:51,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:07:51,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:51,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:52,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:52,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886886896] [2025-03-14 01:07:52,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886886896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:52,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:52,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:07:52,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464149950] [2025-03-14 01:07:52,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:52,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:07:52,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:52,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:07:52,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:07:52,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-14 01:07:52,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-14 01:07:52,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:52,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-14 01:07:52,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:52,223 INFO L124 PetriNetUnfolderBase]: 617/965 cut-off events. [2025-03-14 01:07:52,224 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2025-03-14 01:07:52,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 965 events. 617/965 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4078 event pairs, 407 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 802. Up to 895 conditions per place. [2025-03-14 01:07:52,231 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-14 01:07:52,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 150 flow [2025-03-14 01:07:52,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:07:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:07:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-14 01:07:52,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-14 01:07:52,234 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 3 states and 48 transitions. [2025-03-14 01:07:52,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 150 flow [2025-03-14 01:07:52,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:07:52,235 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 98 flow [2025-03-14 01:07:52,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2025-03-14 01:07:52,236 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-03-14 01:07:52,236 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 98 flow [2025-03-14 01:07:52,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-14 01:07:52,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:52,237 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-14 01:07:52,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:07:52,238 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-14 01:07:52,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash 779917777, now seen corresponding path program 1 times [2025-03-14 01:07:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120379412] [2025-03-14 01:07:52,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:52,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:07:52,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:07:52,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:52,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:52,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:52,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120379412] [2025-03-14 01:07:52,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120379412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:52,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:52,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:07:52,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732042638] [2025-03-14 01:07:52,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:52,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:07:52,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:52,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:07:52,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:07:52,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:07:52,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:52,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:52,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:07:52,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:52,556 INFO L124 PetriNetUnfolderBase]: 790/1161 cut-off events. [2025-03-14 01:07:52,556 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-03-14 01:07:52,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1161 events. 790/1161 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4572 event pairs, 246 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 2562. Up to 576 conditions per place. [2025-03-14 01:07:52,564 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-03-14 01:07:52,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 224 flow [2025-03-14 01:07:52,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:07:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:07:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-14 01:07:52,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-03-14 01:07:52,566 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 98 flow. Second operand 4 states and 63 transitions. [2025-03-14 01:07:52,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 224 flow [2025-03-14 01:07:52,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 218 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:07:52,569 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 113 flow [2025-03-14 01:07:52,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-03-14 01:07:52,571 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-14 01:07:52,571 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 113 flow [2025-03-14 01:07:52,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:52,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:52,571 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-14 01:07:52,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:07:52,572 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-14 01:07:52,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:52,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1043708507, now seen corresponding path program 1 times [2025-03-14 01:07:52,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:52,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506098106] [2025-03-14 01:07:52,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:52,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:52,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:07:52,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:07:52,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:52,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:52,725 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-14 01:07:52,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:52,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506098106] [2025-03-14 01:07:52,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506098106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:52,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262557072] [2025-03-14 01:07:52,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:52,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:52,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:52,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:07:52,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:07:52,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:07:52,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:07:52,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:52,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:52,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:07:52,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:52,954 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-14 01:07:52,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:52,989 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-14 01:07:52,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262557072] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:52,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:07:52,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-14 01:07:52,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065261092] [2025-03-14 01:07:52,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:52,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:07:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:52,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:07:52,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:07:52,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:07:52,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:52,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:52,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:07:52,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:53,160 INFO L124 PetriNetUnfolderBase]: 855/1295 cut-off events. [2025-03-14 01:07:53,160 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2025-03-14 01:07:53,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1295 events. 855/1295 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5382 event pairs, 256 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 3227. Up to 670 conditions per place. [2025-03-14 01:07:53,172 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-03-14 01:07:53,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 257 flow [2025-03-14 01:07:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:07:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:07:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-03-14 01:07:53,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-14 01:07:53,176 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 113 flow. Second operand 5 states and 72 transitions. [2025-03-14 01:07:53,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 257 flow [2025-03-14 01:07:53,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:07:53,181 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 132 flow [2025-03-14 01:07:53,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-14 01:07:53,182 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-14 01:07:53,182 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 132 flow [2025-03-14 01:07:53,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:53,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:53,183 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, 1, 1] [2025-03-14 01:07:53,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:07:53,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:53,384 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-14 01:07:53,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:53,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1212184845, now seen corresponding path program 1 times [2025-03-14 01:07:53,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:53,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698723875] [2025-03-14 01:07:53,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:53,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:53,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:07:53,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:07:53,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:53,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:54,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698723875] [2025-03-14 01:07:54,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698723875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:54,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578667136] [2025-03-14 01:07:54,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:54,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:54,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:54,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:07:54,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:07:54,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:07:54,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:07:54,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:54,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:54,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-14 01:07:54,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:54,304 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-14 01:07:54,526 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 59 treesize of output 35 [2025-03-14 01:07:54,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-14 01:07:54,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:56,530 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 282 treesize of output 254 [2025-03-14 01:07:56,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:56,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 372 treesize of output 376 [2025-03-14 01:08:15,482 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 226 treesize of output 208 [2025-03-14 01:08:15,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:08:15,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 261 treesize of output 291 [2025-03-14 01:08:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:08:17,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578667136] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:17,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:17,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-03-14 01:08:17,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784188513] [2025-03-14 01:08:17,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:17,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 01:08:17,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:17,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 01:08:17,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-03-14 01:08:17,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:08:17,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 132 flow. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:17,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:17,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:08:17,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:19,737 INFO L124 PetriNetUnfolderBase]: 1841/2761 cut-off events. [2025-03-14 01:08:19,737 INFO L125 PetriNetUnfolderBase]: For 1721/1721 co-relation queries the response was YES. [2025-03-14 01:08:19,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 2761 events. 1841/2761 cut-off events. For 1721/1721 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12690 event pairs, 106 based on Foata normal form. 1/2761 useless extension candidates. Maximal degree in co-relation 5614. Up to 1375 conditions per place. [2025-03-14 01:08:19,756 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 57 changer transitions 1/199 dead transitions. [2025-03-14 01:08:19,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1067 flow [2025-03-14 01:08:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:08:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:08:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 321 transitions. [2025-03-14 01:08:19,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2025-03-14 01:08:19,758 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 132 flow. Second operand 21 states and 321 transitions. [2025-03-14 01:08:19,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1067 flow [2025-03-14 01:08:19,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 199 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:08:19,766 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 543 flow [2025-03-14 01:08:19,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=543, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2025-03-14 01:08:19,767 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-03-14 01:08:19,768 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 543 flow [2025-03-14 01:08:19,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:19,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:19,768 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, 1, 1] [2025-03-14 01:08:19,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:08:19,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:19,973 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-14 01:08:19,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:19,974 INFO L85 PathProgramCache]: Analyzing trace with hash 886983781, now seen corresponding path program 2 times [2025-03-14 01:08:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:19,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543850663] [2025-03-14 01:08:19,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:19,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:19,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:20,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:20,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:20,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:20,605 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-14 01:08:20,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:20,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543850663] [2025-03-14 01:08:20,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543850663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:20,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108670560] [2025-03-14 01:08:20,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:20,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:20,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:20,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:08:20,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:08:20,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:20,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:20,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:20,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:20,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-14 01:08:20,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:20,879 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 67 treesize of output 39 [2025-03-14 01:08:20,924 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-14 01:08:20,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:21,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:08:21,105 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 131 treesize of output 75 [2025-03-14 01:08:21,462 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-14 01:08:21,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108670560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:21,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:21,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-03-14 01:08:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936277744] [2025-03-14 01:08:21,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:21,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-14 01:08:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:21,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-14 01:08:21,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-14 01:08:21,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-14 01:08:21,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 91 transitions, 543 flow. Second operand has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:21,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:21,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-14 01:08:21,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:22,956 INFO L124 PetriNetUnfolderBase]: 1618/2628 cut-off events. [2025-03-14 01:08:22,956 INFO L125 PetriNetUnfolderBase]: For 3717/3717 co-relation queries the response was YES. [2025-03-14 01:08:22,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8545 conditions, 2628 events. 1618/2628 cut-off events. For 3717/3717 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13715 event pairs, 122 based on Foata normal form. 2/2628 useless extension candidates. Maximal degree in co-relation 7995. Up to 1663 conditions per place. [2025-03-14 01:08:22,969 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 139 selfloop transitions, 89 changer transitions 1/235 dead transitions. [2025-03-14 01:08:22,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 235 transitions, 1631 flow [2025-03-14 01:08:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:08:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:08:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 316 transitions. [2025-03-14 01:08:22,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.455988455988456 [2025-03-14 01:08:22,973 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 543 flow. Second operand 21 states and 316 transitions. [2025-03-14 01:08:22,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 235 transitions, 1631 flow [2025-03-14 01:08:22,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 235 transitions, 1469 flow, removed 54 selfloop flow, removed 3 redundant places. [2025-03-14 01:08:22,983 INFO L231 Difference]: Finished difference. Result has 91 places, 150 transitions, 1050 flow [2025-03-14 01:08:22,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1050, PETRI_PLACES=91, PETRI_TRANSITIONS=150} [2025-03-14 01:08:22,984 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 56 predicate places. [2025-03-14 01:08:22,984 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 150 transitions, 1050 flow [2025-03-14 01:08:22,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:22,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:22,984 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, 1, 1] [2025-03-14 01:08:22,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:08:23,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:23,185 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-14 01:08:23,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:23,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1745271629, now seen corresponding path program 3 times [2025-03-14 01:08:23,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:23,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777594477] [2025-03-14 01:08:23,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:23,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:23,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:23,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:23,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:08:23,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:23,572 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-14 01:08:23,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:23,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777594477] [2025-03-14 01:08:23,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777594477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:23,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307914714] [2025-03-14 01:08:23,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:23,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:23,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:23,574 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-14 01:08:23,575 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-14 01:08:23,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:23,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:23,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:08:23,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:23,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-14 01:08:23,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:23,669 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-14 01:08:23,847 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 59 treesize of output 35 [2025-03-14 01:08:23,900 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-14 01:08:23,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:25,390 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 217 treesize of output 195 [2025-03-14 01:08:25,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:08:25,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 296 treesize of output 278 [2025-03-14 01:08:29,124 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 183 treesize of output 167 [2025-03-14 01:08:29,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:08:29,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 219 [2025-03-14 01:08:30,219 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 106 treesize of output 96 [2025-03-14 01:08:30,227 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:08:30,228 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 125 treesize of output 115 [2025-03-14 01:08:30,501 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-14 01:08:30,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307914714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:30,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:30,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2025-03-14 01:08:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372382813] [2025-03-14 01:08:30,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:30,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:08:30,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:30,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:08:30,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:08:30,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-14 01:08:30,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 150 transitions, 1050 flow. Second operand has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 23 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:30,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:30,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-14 01:08:30,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:33,231 INFO L124 PetriNetUnfolderBase]: 3278/5291 cut-off events. [2025-03-14 01:08:33,232 INFO L125 PetriNetUnfolderBase]: For 13147/13167 co-relation queries the response was YES. [2025-03-14 01:08:33,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19951 conditions, 5291 events. 3278/5291 cut-off events. For 13147/13167 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 31209 event pairs, 247 based on Foata normal form. 20/5309 useless extension candidates. Maximal degree in co-relation 18814. Up to 2428 conditions per place. [2025-03-14 01:08:33,277 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 223 selfloop transitions, 187 changer transitions 2/418 dead transitions. [2025-03-14 01:08:33,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 418 transitions, 3345 flow [2025-03-14 01:08:33,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 01:08:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 01:08:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 523 transitions. [2025-03-14 01:08:33,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4661319073083779 [2025-03-14 01:08:33,279 INFO L175 Difference]: Start difference. First operand has 91 places, 150 transitions, 1050 flow. Second operand 34 states and 523 transitions. [2025-03-14 01:08:33,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 418 transitions, 3345 flow [2025-03-14 01:08:33,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 418 transitions, 3332 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-14 01:08:33,310 INFO L231 Difference]: Finished difference. Result has 134 places, 262 transitions, 2433 flow [2025-03-14 01:08:33,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2433, PETRI_PLACES=134, PETRI_TRANSITIONS=262} [2025-03-14 01:08:33,311 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 99 predicate places. [2025-03-14 01:08:33,311 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 262 transitions, 2433 flow [2025-03-14 01:08:33,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 23 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:33,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:33,312 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, 1, 1] [2025-03-14 01:08:33,318 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-14 01:08:33,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:33,513 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-14 01:08:33,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:33,513 INFO L85 PathProgramCache]: Analyzing trace with hash -998669659, now seen corresponding path program 4 times [2025-03-14 01:08:33,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:33,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901541885] [2025-03-14 01:08:33,513 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:08:33,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:33,520 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:33,529 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:33,529 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:08:33,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:33,895 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-14 01:08:33,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901541885] [2025-03-14 01:08:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901541885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726164218] [2025-03-14 01:08:33,896 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:08:33,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:33,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:33,899 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-14 01:08:33,901 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-14 01:08:33,939 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:33,958 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:33,958 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:08:33,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:33,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:08:33,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:34,132 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 59 treesize of output 35 [2025-03-14 01:08:34,178 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-14 01:08:34,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:34,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:08:34,337 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 123 treesize of output 75 [2025-03-14 01:08:34,633 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-14 01:08:34,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726164218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:34,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:34,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2025-03-14 01:08:34,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598830540] [2025-03-14 01:08:34,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:34,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 01:08:34,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:34,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 01:08:34,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2025-03-14 01:08:34,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:08:34,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 262 transitions, 2433 flow. Second operand has 26 states, 26 states have (on average 8.653846153846153) internal successors, (225), 26 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:34,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:34,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:08:34,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:35,688 INFO L124 PetriNetUnfolderBase]: 5173/8073 cut-off events. [2025-03-14 01:08:35,688 INFO L125 PetriNetUnfolderBase]: For 36051/36103 co-relation queries the response was YES. [2025-03-14 01:08:35,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35998 conditions, 8073 events. 5173/8073 cut-off events. For 36051/36103 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 49389 event pairs, 780 based on Foata normal form. 13/8083 useless extension candidates. Maximal degree in co-relation 34077. Up to 6034 conditions per place. [2025-03-14 01:08:35,764 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 294 selfloop transitions, 196 changer transitions 1/496 dead transitions. [2025-03-14 01:08:35,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 496 transitions, 5464 flow [2025-03-14 01:08:35,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 01:08:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 01:08:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 192 transitions. [2025-03-14 01:08:35,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2025-03-14 01:08:35,766 INFO L175 Difference]: Start difference. First operand has 134 places, 262 transitions, 2433 flow. Second operand 15 states and 192 transitions. [2025-03-14 01:08:35,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 496 transitions, 5464 flow [2025-03-14 01:08:35,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 496 transitions, 5136 flow, removed 106 selfloop flow, removed 12 redundant places. [2025-03-14 01:08:35,893 INFO L231 Difference]: Finished difference. Result has 145 places, 410 transitions, 4431 flow [2025-03-14 01:08:35,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4431, PETRI_PLACES=145, PETRI_TRANSITIONS=410} [2025-03-14 01:08:35,894 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 110 predicate places. [2025-03-14 01:08:35,894 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 410 transitions, 4431 flow [2025-03-14 01:08:35,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.653846153846153) internal successors, (225), 26 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:35,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:35,895 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, 1, 1] [2025-03-14 01:08:35,903 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-14 01:08:36,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:36,096 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-14 01:08:36,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash -231077975, now seen corresponding path program 5 times [2025-03-14 01:08:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201611866] [2025-03-14 01:08:36,097 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:36,113 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:36,137 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:36,137 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:36,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:36,868 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-14 01:08:36,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:36,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201611866] [2025-03-14 01:08:36,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201611866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:36,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404204130] [2025-03-14 01:08:36,868 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:36,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:36,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:36,870 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-14 01:08:36,872 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-14 01:08:36,909 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:36,925 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:36,926 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:36,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:36,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-14 01:08:36,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:37,193 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 59 treesize of output 35 [2025-03-14 01:08:37,255 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-14 01:08:37,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:37,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:08:37,418 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 123 treesize of output 75 [2025-03-14 01:08:37,784 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-14 01:08:37,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404204130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:37,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:37,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 29 [2025-03-14 01:08:37,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254353029] [2025-03-14 01:08:37,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:37,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 01:08:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:37,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 01:08:37,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-03-14 01:08:37,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-14 01:08:37,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 410 transitions, 4431 flow. Second operand has 30 states, 30 states have (on average 7.5) internal successors, (225), 30 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:37,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:37,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-14 01:08:37,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:39,823 INFO L124 PetriNetUnfolderBase]: 10095/14619 cut-off events. [2025-03-14 01:08:39,823 INFO L125 PetriNetUnfolderBase]: For 75043/75784 co-relation queries the response was YES. [2025-03-14 01:08:39,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70425 conditions, 14619 events. 10095/14619 cut-off events. For 75043/75784 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 84711 event pairs, 1052 based on Foata normal form. 604/15176 useless extension candidates. Maximal degree in co-relation 69008. Up to 8996 conditions per place. [2025-03-14 01:08:39,971 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 340 selfloop transitions, 415 changer transitions 4/762 dead transitions. [2025-03-14 01:08:39,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 762 transitions, 9298 flow [2025-03-14 01:08:39,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 01:08:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 01:08:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 306 transitions. [2025-03-14 01:08:39,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4214876033057851 [2025-03-14 01:08:39,973 INFO L175 Difference]: Start difference. First operand has 145 places, 410 transitions, 4431 flow. Second operand 22 states and 306 transitions. [2025-03-14 01:08:39,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 762 transitions, 9298 flow [2025-03-14 01:08:40,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 762 transitions, 9045 flow, removed 105 selfloop flow, removed 2 redundant places. [2025-03-14 01:08:40,337 INFO L231 Difference]: Finished difference. Result has 173 places, 643 transitions, 8574 flow [2025-03-14 01:08:40,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4290, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8574, PETRI_PLACES=173, PETRI_TRANSITIONS=643} [2025-03-14 01:08:40,338 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 138 predicate places. [2025-03-14 01:08:40,338 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 643 transitions, 8574 flow [2025-03-14 01:08:40,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.5) internal successors, (225), 30 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:40,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:40,339 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, 1, 1] [2025-03-14 01:08:40,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 01:08:40,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:40,540 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-14 01:08:40,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash 886717827, now seen corresponding path program 6 times [2025-03-14 01:08:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:40,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123763038] [2025-03-14 01:08:40,541 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:08:40,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:40,551 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:40,561 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-14 01:08:40,561 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:08:40,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:40,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:40,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123763038] [2025-03-14 01:08:40,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123763038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:40,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:40,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 01:08:40,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459818113] [2025-03-14 01:08:40,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:40,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:08:40,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:40,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:08:40,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:08:40,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-14 01:08:40,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 643 transitions, 8574 flow. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:40,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:40,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-14 01:08:40,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:43,541 INFO L124 PetriNetUnfolderBase]: 12102/17384 cut-off events. [2025-03-14 01:08:43,541 INFO L125 PetriNetUnfolderBase]: For 125290/126146 co-relation queries the response was YES. [2025-03-14 01:08:43,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98269 conditions, 17384 events. 12102/17384 cut-off events. For 125290/126146 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 102281 event pairs, 996 based on Foata normal form. 791/18134 useless extension candidates. Maximal degree in co-relation 98024. Up to 9544 conditions per place. [2025-03-14 01:08:43,669 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 406 selfloop transitions, 784 changer transitions 1/1194 dead transitions. [2025-03-14 01:08:43,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1194 transitions, 17558 flow [2025-03-14 01:08:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 01:08:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 01:08:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 375 transitions. [2025-03-14 01:08:43,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39184952978056425 [2025-03-14 01:08:43,670 INFO L175 Difference]: Start difference. First operand has 173 places, 643 transitions, 8574 flow. Second operand 29 states and 375 transitions. [2025-03-14 01:08:43,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1194 transitions, 17558 flow [2025-03-14 01:08:44,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1194 transitions, 17193 flow, removed 132 selfloop flow, removed 8 redundant places. [2025-03-14 01:08:44,218 INFO L231 Difference]: Finished difference. Result has 207 places, 1076 transitions, 17061 flow [2025-03-14 01:08:44,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8347, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=386, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=17061, PETRI_PLACES=207, PETRI_TRANSITIONS=1076} [2025-03-14 01:08:44,219 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 172 predicate places. [2025-03-14 01:08:44,219 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 1076 transitions, 17061 flow [2025-03-14 01:08:44,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:44,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:44,219 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, 1, 1] [2025-03-14 01:08:44,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:08:44,219 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-14 01:08:44,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash -345265887, now seen corresponding path program 7 times [2025-03-14 01:08:44,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:44,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416403090] [2025-03-14 01:08:44,220 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:44,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:08:44,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:44,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:44,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:44,972 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-14 01:08:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416403090] [2025-03-14 01:08:44,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416403090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373105738] [2025-03-14 01:08:44,973 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:44,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:44,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:44,986 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-14 01:08:44,987 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-14 01:08:45,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:08:45,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:45,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:45,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:45,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-14 01:08:45,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:45,091 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-14 01:08:45,386 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 59 treesize of output 35 [2025-03-14 01:08:45,477 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-14 01:08:45,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:47,618 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 106 treesize of output 96 [2025-03-14 01:08:47,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:08:47,625 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 125 treesize of output 119 [2025-03-14 01:08:47,786 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 183 treesize of output 167 [2025-03-14 01:08:47,795 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-03-14 01:08:47,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 1 [2025-03-14 01:08:47,799 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 217 treesize of output 195 [2025-03-14 01:08:47,806 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-03-14 01:08:47,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 296 treesize of output 1 [2025-03-14 01:08:47,832 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-14 01:08:47,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373105738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:47,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:47,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2025-03-14 01:08:47,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925861366] [2025-03-14 01:08:47,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:47,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 01:08:47,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:47,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 01:08:47,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-03-14 01:08:47,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:08:47,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 1076 transitions, 17061 flow. Second operand has 26 states, 26 states have (on average 8.76923076923077) internal successors, (228), 26 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:47,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:47,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:08:47,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:51,556 INFO L124 PetriNetUnfolderBase]: 11253/16520 cut-off events. [2025-03-14 01:08:51,556 INFO L125 PetriNetUnfolderBase]: For 174759/176370 co-relation queries the response was YES. [2025-03-14 01:08:51,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109746 conditions, 16520 events. 11253/16520 cut-off events. For 174759/176370 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 101642 event pairs, 822 based on Foata normal form. 1164/17505 useless extension candidates. Maximal degree in co-relation 109455. Up to 10143 conditions per place. [2025-03-14 01:08:51,708 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 613 selfloop transitions, 598 changer transitions 2/1236 dead transitions. [2025-03-14 01:08:51,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1236 transitions, 20876 flow [2025-03-14 01:08:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 01:08:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 01:08:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 332 transitions. [2025-03-14 01:08:51,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4573002754820937 [2025-03-14 01:08:51,709 INFO L175 Difference]: Start difference. First operand has 207 places, 1076 transitions, 17061 flow. Second operand 22 states and 332 transitions. [2025-03-14 01:08:51,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 1236 transitions, 20876 flow [2025-03-14 01:08:53,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 1236 transitions, 19954 flow, removed 458 selfloop flow, removed 2 redundant places. [2025-03-14 01:08:53,041 INFO L231 Difference]: Finished difference. Result has 228 places, 1122 transitions, 18379 flow [2025-03-14 01:08:53,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=16215, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1076, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=556, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=18379, PETRI_PLACES=228, PETRI_TRANSITIONS=1122} [2025-03-14 01:08:53,045 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 193 predicate places. [2025-03-14 01:08:53,045 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 1122 transitions, 18379 flow [2025-03-14 01:08:53,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.76923076923077) internal successors, (228), 26 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:53,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:53,047 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:53,058 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-14 01:08:53,249 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-14 01:08:53,249 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-14 01:08:53,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2134599543, now seen corresponding path program 8 times [2025-03-14 01:08:53,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:53,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323104737] [2025-03-14 01:08:53,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:53,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:53,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:08:53,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:08:53,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:53,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:53,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323104737] [2025-03-14 01:08:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323104737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007832527] [2025-03-14 01:08:53,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:53,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:53,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:53,335 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-14 01:08:53,337 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-14 01:08:53,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:08:53,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:08:53,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:53,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:53,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 01:08:53,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:53,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007832527] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:53,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-14 01:08:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206799142] [2025-03-14 01:08:53,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:53,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:08:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:53,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:08:53,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:08:53,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-14 01:08:53,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 1122 transitions, 18379 flow. Second operand has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:53,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:53,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-14 01:08:53,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:58,261 INFO L124 PetriNetUnfolderBase]: 16304/23820 cut-off events. [2025-03-14 01:08:58,261 INFO L125 PetriNetUnfolderBase]: For 249993/251395 co-relation queries the response was YES. [2025-03-14 01:08:58,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153156 conditions, 23820 events. 16304/23820 cut-off events. For 249993/251395 co-relation queries the response was YES. Maximal size of possible extension queue 1206. Compared 152681 event pairs, 2778 based on Foata normal form. 1009/24714 useless extension candidates. Maximal degree in co-relation 151196. Up to 8021 conditions per place. [2025-03-14 01:08:58,729 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 1711 selfloop transitions, 185 changer transitions 2/1919 dead transitions. [2025-03-14 01:08:58,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 1919 transitions, 33145 flow [2025-03-14 01:08:58,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 01:08:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 01:08:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 219 transitions. [2025-03-14 01:08:58,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2025-03-14 01:08:58,730 INFO L175 Difference]: Start difference. First operand has 228 places, 1122 transitions, 18379 flow. Second operand 14 states and 219 transitions. [2025-03-14 01:08:58,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 1919 transitions, 33145 flow [2025-03-14 01:09:00,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 1919 transitions, 32732 flow, removed 78 selfloop flow, removed 11 redundant places. [2025-03-14 01:09:00,697 INFO L231 Difference]: Finished difference. Result has 236 places, 1231 transitions, 19810 flow [2025-03-14 01:09:00,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=17913, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1030, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=19810, PETRI_PLACES=236, PETRI_TRANSITIONS=1231} [2025-03-14 01:09:00,698 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 201 predicate places. [2025-03-14 01:09:00,698 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 1231 transitions, 19810 flow [2025-03-14 01:09:00,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:00,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:00,699 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:00,704 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-14 01:09:00,899 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-14 01:09:00,899 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-14 01:09:00,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1884228951, now seen corresponding path program 9 times [2025-03-14 01:09:00,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:00,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544681982] [2025-03-14 01:09:00,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:09:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:00,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:09:00,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:09:00,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:09:00,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:00,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:00,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544681982] [2025-03-14 01:09:00,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544681982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:00,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369176692] [2025-03-14 01:09:00,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:09:00,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:00,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:00,965 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-14 01:09:00,973 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-14 01:09:01,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:09:01,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:09:01,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:09:01,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:01,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:09:01,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:01,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:09:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:01,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369176692] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:01,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:09:01,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-14 01:09:01,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781977448] [2025-03-14 01:09:01,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:01,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:09:01,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:01,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:09:01,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:09:01,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:09:01,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1231 transitions, 19810 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:01,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:01,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:09:01,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:05,448 INFO L124 PetriNetUnfolderBase]: 15118/22256 cut-off events. [2025-03-14 01:09:05,448 INFO L125 PetriNetUnfolderBase]: For 264246/266114 co-relation queries the response was YES. [2025-03-14 01:09:05,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156413 conditions, 22256 events. 15118/22256 cut-off events. For 264246/266114 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 143647 event pairs, 2081 based on Foata normal form. 1475/23649 useless extension candidates. Maximal degree in co-relation 154382. Up to 8144 conditions per place. [2025-03-14 01:09:05,744 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 1490 selfloop transitions, 98 changer transitions 0/1647 dead transitions. [2025-03-14 01:09:05,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 1647 transitions, 28861 flow [2025-03-14 01:09:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:09:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:09:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-03-14 01:09:05,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-14 01:09:05,746 INFO L175 Difference]: Start difference. First operand has 236 places, 1231 transitions, 19810 flow. Second operand 8 states and 144 transitions. [2025-03-14 01:09:05,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 1647 transitions, 28861 flow [2025-03-14 01:09:07,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 1647 transitions, 28606 flow, removed 124 selfloop flow, removed 3 redundant places. [2025-03-14 01:09:07,732 INFO L231 Difference]: Finished difference. Result has 242 places, 1245 transitions, 20128 flow [2025-03-14 01:09:07,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=19466, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=20128, PETRI_PLACES=242, PETRI_TRANSITIONS=1245} [2025-03-14 01:09:07,734 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 207 predicate places. [2025-03-14 01:09:07,734 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 1245 transitions, 20128 flow [2025-03-14 01:09:07,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:07,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:07,735 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:07,742 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-14 01:09:07,937 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-14 01:09:07,937 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-14 01:09:07,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash 339548657, now seen corresponding path program 10 times [2025-03-14 01:09:07,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541896634] [2025-03-14 01:09:07,940 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:09:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:07,945 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-14 01:09:07,951 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-14 01:09:07,951 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:09:07,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:08,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:08,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541896634] [2025-03-14 01:09:08,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541896634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:08,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062334166] [2025-03-14 01:09:08,023 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:09:08,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:08,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:08,025 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-14 01:09:08,045 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-14 01:09:08,144 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-14 01:09:08,167 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-14 01:09:08,167 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:09:08,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:08,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:09:08,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:08,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:09:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:08,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062334166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:09:08,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:09:08,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-14 01:09:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793267991] [2025-03-14 01:09:08,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:09:08,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 01:09:08,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:08,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 01:09:08,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:09:08,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:09:08,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 1245 transitions, 20128 flow. Second operand has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:08,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:08,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:09:08,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:14,318 INFO L124 PetriNetUnfolderBase]: 21669/31342 cut-off events. [2025-03-14 01:09:14,318 INFO L125 PetriNetUnfolderBase]: For 374056/374056 co-relation queries the response was YES. [2025-03-14 01:09:14,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216520 conditions, 31342 events. 21669/31342 cut-off events. For 374056/374056 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 200842 event pairs, 2398 based on Foata normal form. 14/31356 useless extension candidates. Maximal degree in co-relation 214265. Up to 9689 conditions per place. [2025-03-14 01:09:15,068 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 2289 selfloop transitions, 512 changer transitions 1/2803 dead transitions. [2025-03-14 01:09:15,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 2803 transitions, 50133 flow [2025-03-14 01:09:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:09:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:09:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 261 transitions. [2025-03-14 01:09:15,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41626794258373206 [2025-03-14 01:09:15,070 INFO L175 Difference]: Start difference. First operand has 242 places, 1245 transitions, 20128 flow. Second operand 19 states and 261 transitions. [2025-03-14 01:09:15,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 2803 transitions, 50133 flow [2025-03-14 01:09:18,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 2803 transitions, 50078 flow, removed 25 selfloop flow, removed 2 redundant places. [2025-03-14 01:09:18,179 INFO L231 Difference]: Finished difference. Result has 272 places, 1563 transitions, 26878 flow [2025-03-14 01:09:18,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=20117, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=985, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=26878, PETRI_PLACES=272, PETRI_TRANSITIONS=1563} [2025-03-14 01:09:18,180 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 237 predicate places. [2025-03-14 01:09:18,180 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 1563 transitions, 26878 flow [2025-03-14 01:09:18,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:18,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:18,181 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:18,186 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-14 01:09:18,382 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-14 01:09:18,382 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-14 01:09:18,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:18,383 INFO L85 PathProgramCache]: Analyzing trace with hash 114886501, now seen corresponding path program 11 times [2025-03-14 01:09:18,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:18,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700806305] [2025-03-14 01:09:18,383 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:09:18,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:18,387 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-14 01:09:18,390 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:09:18,390 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:09:18,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:18,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:18,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700806305] [2025-03-14 01:09:18,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700806305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:18,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640092257] [2025-03-14 01:09:18,431 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:09:18,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:18,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:18,434 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-14 01:09:18,435 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-14 01:09:18,473 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-14 01:09:18,486 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:09:18,486 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:09:18,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:18,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:09:18,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:18,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:09:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640092257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:09:18,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:09:18,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-14 01:09:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752787333] [2025-03-14 01:09:18,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:09:18,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 01:09:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:18,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 01:09:18,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:09:18,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:09:18,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 1563 transitions, 26878 flow. Second operand has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:18,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:18,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:09:18,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:23,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L71-->L70-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_59| v_~A~0.base_113) (+ v_~A~0.offset_113 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~min3~0_82 .cse0) (< .cse0 v_~min3~0_83)) (and (= v_~min3~0_83 v_~min3~0_82) (<= v_~min3~0_83 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_113, ~A~0.offset=v_~A~0.offset_113, #memory_int#1=|v_#memory_int#1_59|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7, ~min3~0=v_~min3~0_83} OutVars{~A~0.base=v_~A~0.base_113, ~A~0.offset=v_~A~0.offset_113, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_59|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7, ~min3~0=v_~min3~0_82} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7, ~min3~0][1212], [Black: 1027#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 917#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1029#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))), Black: 847#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1023#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))), Black: 1031#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread3Thread1of1ForFork2_~i~2 0)), 842#true, Black: 995#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (= ~M~0 0))), Black: 1019#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1259#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0)), Black: 1264#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))) (< 1 ~N~0)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1281#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))) (< 1 ~N~0)) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1262#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))))), Black: 1267#(or (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0))), Black: 1271#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1266#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0))), Black: 1273#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1263#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0)))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1269#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1285#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (< 1 ~N~0)) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1265#(and (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (< 1 ~N~0))), Black: 1261#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0)))), 1907#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 1041#true, Black: 48#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 2084#(and (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 613#true, Black: 1938#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 2088#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 2092#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 11#L94-1true, Black: 2094#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= 2 ~N~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1958#(and (<= 2 ~N~0) (<= ~M~0 0)), 2163#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 1538#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 2102#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 811#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 2098#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 809#(and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)))), Black: 1902#(<= ~M~0 0), Black: 827#(and (= ~min2~0 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2086#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 813#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))), Black: 2082#(and (<= thread2Thread1of1ForFork0_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 817#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 1948#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0)), Black: 2090#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 795#(and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))))) (or (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0)) (or (and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0)) (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)))))), Black: 1901#(<= thread2Thread1of1ForFork0_~i~1 0), Black: 829#(and (= ~min2~0 0) (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 619#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 753#(and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))))) (or (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))), Black: 825#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)))), Black: 821#(and (= ~min2~0 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 803#(and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 7#L46true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~M~0 0)), Black: 420#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min1~0 0) (and (not (= (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= (select (select |#memory_int#1| ~A~0.base) 0) 0))) (or (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= ~min3~0 0) (= ~M~0 0)), Black: 584#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 416#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 602#(and (= ~min2~0 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), Black: 415#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0)), Black: 419#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min1~0 0) (and (not (= (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= (select (select |#memory_int#1| ~A~0.base) 0) 0))) (or (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1895#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1726#(<= 2 ~N~0), 1722#true, 1316#true, Black: 406#(and (= ~min2~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~min3~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 382#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 347#(and (or (and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))))), Black: 380#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1534#(<= 2 ~N~0), Black: 1707#(and (<= 2 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1535#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= 2 ~N~0)), Black: 1593#(and (<= 2 ~N~0) (<= ~M~0 0)), 412#true, Black: 1711#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= 2 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1715#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), 1256#true, Black: 200#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 61#(<= 1 ~N~0), Black: 1228#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 1 ~N~0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1234#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2) (= ~M~0 0)), Black: 1119#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1053#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))), Black: 1244#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1238#(and (= ~A~0.offset 0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (and (= ~min2~0 0) (or (and (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) ~min1~0) (<= (+ ~min3~0 1) 0)) (and (= ~min1~0 0) (<= 0 ~min3~0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0))))) (< 1 ~N~0)) (or (< 0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))) (= thread1Thread1of1ForFork1_~i~0 0)), 29#L59true, Black: 1242#(and (or (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (or (< 1 ~N~0) (< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (and (= ~min2~0 0) (or (and (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) ~min1~0) (<= (+ ~min3~0 1) 0)) (and (= ~min1~0 0) (<= 0 ~min3~0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0)))))) (= ~A~0.offset 0) (or (< 0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))) (= thread1Thread1of1ForFork1_~i~0 0)), 203#true, 34#L70-3true, Black: 1527#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))), Black: 1523#(and (= ~min2~0 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= thread1Thread1of1ForFork1_~i~0 0) (= ~min3~0 ~min1~0))]) [2025-03-14 01:09:23,718 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-14 01:09:23,718 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-14 01:09:23,718 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-14 01:09:23,718 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-14 01:09:24,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L71-->L70-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_59| v_~A~0.base_113) (+ v_~A~0.offset_113 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~min3~0_82 .cse0) (< .cse0 v_~min3~0_83)) (and (= v_~min3~0_83 v_~min3~0_82) (<= v_~min3~0_83 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_113, ~A~0.offset=v_~A~0.offset_113, #memory_int#1=|v_#memory_int#1_59|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7, ~min3~0=v_~min3~0_83} OutVars{~A~0.base=v_~A~0.base_113, ~A~0.offset=v_~A~0.offset_113, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_59|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7, ~min3~0=v_~min3~0_82} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7, ~min3~0][1212], [Black: 1027#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 917#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1029#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))), Black: 847#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1023#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))), Black: 1031#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread3Thread1of1ForFork2_~i~2 0)), 842#true, Black: 995#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (= ~M~0 0))), Black: 1019#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1259#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0)), Black: 1264#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))) (< 1 ~N~0)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1281#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))) (< 1 ~N~0)) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1262#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))))), Black: 1267#(or (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0))), Black: 1271#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1266#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0))), Black: 1273#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1263#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0)))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1269#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1285#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (< 1 ~N~0)) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1265#(and (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (< 1 ~N~0))), Black: 1261#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0)))), 1907#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 1041#true, Black: 48#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), 613#true, Black: 2084#(and (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1938#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 2088#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 2092#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 2094#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= 2 ~N~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 2163#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), Black: 1958#(and (<= 2 ~N~0) (<= ~M~0 0)), 1538#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 2102#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 811#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 2098#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 809#(and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)))), Black: 1902#(<= ~M~0 0), Black: 827#(and (= ~min2~0 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2086#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 813#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))), Black: 2082#(and (<= thread2Thread1of1ForFork0_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 817#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 1948#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0)), Black: 2090#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 795#(and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))))) (or (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0)) (or (and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0)) (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)))))), Black: 829#(and (= ~min2~0 0) (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1901#(<= thread2Thread1of1ForFork0_~i~1 0), Black: 619#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 753#(and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))))) (or (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))), Black: 825#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)))), Black: 821#(and (= ~min2~0 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 803#(and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 7#L46true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~M~0 0)), Black: 420#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min1~0 0) (and (not (= (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= (select (select |#memory_int#1| ~A~0.base) 0) 0))) (or (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= ~min3~0 0) (= ~M~0 0)), Black: 584#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 416#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 602#(and (= ~min2~0 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), Black: 415#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0)), Black: 419#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min1~0 0) (and (not (= (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= (select (select |#memory_int#1| ~A~0.base) 0) 0))) (or (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1895#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1726#(<= 2 ~N~0), 1722#true, 1316#true, Black: 406#(and (= ~min2~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~min3~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 382#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 347#(and (or (and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))))), Black: 380#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (<= ~N~0 1) (= ~M~0 0)), 26#L95true, Black: 1534#(<= 2 ~N~0), Black: 1707#(and (<= 2 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1535#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= 2 ~N~0)), Black: 1593#(and (<= 2 ~N~0) (<= ~M~0 0)), 412#true, Black: 1711#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= 2 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1715#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), 1256#true, Black: 200#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 61#(<= 1 ~N~0), Black: 1228#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 1 ~N~0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1234#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2) (= ~M~0 0)), Black: 1119#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1053#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))), Black: 1244#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1238#(and (= ~A~0.offset 0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (and (= ~min2~0 0) (or (and (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) ~min1~0) (<= (+ ~min3~0 1) 0)) (and (= ~min1~0 0) (<= 0 ~min3~0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0))))) (< 1 ~N~0)) (or (< 0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1242#(and (or (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (or (< 1 ~N~0) (< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (and (= ~min2~0 0) (or (and (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) ~min1~0) (<= (+ ~min3~0 1) 0)) (and (= ~min1~0 0) (<= 0 ~min3~0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0)))))) (= ~A~0.offset 0) (or (< 0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))) (= thread1Thread1of1ForFork1_~i~0 0)), 29#L59true, 203#true, 34#L70-3true, Black: 1527#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))), Black: 1523#(and (= ~min2~0 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= thread1Thread1of1ForFork1_~i~0 0) (= ~min3~0 ~min1~0))]) [2025-03-14 01:09:24,083 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-14 01:09:24,083 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-14 01:09:24,083 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-14 01:09:24,083 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-14 01:09:24,291 INFO L124 PetriNetUnfolderBase]: 14715/22340 cut-off events. [2025-03-14 01:09:24,291 INFO L125 PetriNetUnfolderBase]: For 378479/380110 co-relation queries the response was YES. [2025-03-14 01:09:24,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172483 conditions, 22340 events. 14715/22340 cut-off events. For 378479/380110 co-relation queries the response was YES. Maximal size of possible extension queue 1176. Compared 152792 event pairs, 3043 based on Foata normal form. 1642/23830 useless extension candidates. Maximal degree in co-relation 170766. Up to 8191 conditions per place.