./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-max-array.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 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:43:23,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:43:23,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:43:23,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:43:23,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:43:23,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:43:23,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:43:23,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:43:23,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:43:23,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:43:23,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:43:23,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:43:23,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:43:23,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:43:23,375 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:43:23,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:43:23,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:43:23,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:43:23,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:43:23,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:43:23,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:43:23,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:43:23,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:43:23,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:43:23,376 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:43:23,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:43:23,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:43:23,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:43:23,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:43:23,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:43:23,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:43:23,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:43:23,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:43:23,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:43:23,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:43:23,377 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:43:23,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:43:23,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:43:23,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:43:23,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:43:23,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:43:23,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:43:23,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:43:23,378 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 -> 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 [2025-03-17 06:43:23,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:43:23,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:43:23,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:43:23,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:43:23,602 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:43:23,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2025-03-17 06:43:24,734 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf145000/33cba6c9c1714c30ba75d198d589ff70/FLAG38f1c3f32 [2025-03-17 06:43:24,967 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:43:24,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2025-03-17 06:43:24,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf145000/33cba6c9c1714c30ba75d198d589ff70/FLAG38f1c3f32 [2025-03-17 06:43:25,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf145000/33cba6c9c1714c30ba75d198d589ff70 [2025-03-17 06:43:25,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:43:25,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:43:25,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:43:25,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:43:25,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:43:25,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d995cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25, skipping insertion in model container [2025-03-17 06:43:25,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:43:25,433 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-max-array.wvr.c[2592,2605] [2025-03-17 06:43:25,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:43:25,450 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:43:25,469 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-max-array.wvr.c[2592,2605] [2025-03-17 06:43:25,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:43:25,487 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:43:25,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25 WrapperNode [2025-03-17 06:43:25,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:43:25,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:43:25,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:43:25,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:43:25,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,515 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-03-17 06:43:25,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:43:25,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:43:25,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:43:25,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:43:25,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,543 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-17 06:43:25,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:43:25,561 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:43:25,561 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:43:25,561 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:43:25,562 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (1/1) ... [2025-03-17 06:43:25,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:43:25,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:43:25,587 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-17 06:43:25,592 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-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 06:43:25,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 06:43:25,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 06:43:25,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:43:25,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:43:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:43:25,609 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:43:25,693 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:43:25,694 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:43:25,887 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:43:25,887 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:43:26,007 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:43:26,007 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:43:26,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:43:26 BoogieIcfgContainer [2025-03-17 06:43:26,008 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:43:26,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:43:26,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:43:26,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:43:26,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:43:25" (1/3) ... [2025-03-17 06:43:26,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588acf9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:43:26, skipping insertion in model container [2025-03-17 06:43:26,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:43:25" (2/3) ... [2025-03-17 06:43:26,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588acf9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:43:26, skipping insertion in model container [2025-03-17 06:43:26,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:43:26" (3/3) ... [2025-03-17 06:43:26,014 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2025-03-17 06:43:26,024 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:43:26,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-max-array.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-17 06:43:26,026 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:43:26,071 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 06:43:26,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2025-03-17 06:43:26,123 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-17 06:43:26,126 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 06:43:26,128 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-17 06:43:26,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2025-03-17 06:43:26,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-03-17 06:43:26,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:43:26,153 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;@2a95c1cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:43:26,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 06:43:26,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:43:26,166 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-17 06:43:26,168 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 06:43:26,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:26,169 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-17 06:43:26,169 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-17 06:43:26,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:26,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1979131608, now seen corresponding path program 1 times [2025-03-17 06:43:26,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:26,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343582398] [2025-03-17 06:43:26,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:43:26,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:26,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 06:43:26,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 06:43:26,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:26,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:26,451 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-17 06:43:26,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:26,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343582398] [2025-03-17 06:43:26,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343582398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:43:26,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:43:26,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:43:26,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512363243] [2025-03-17 06:43:26,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:43:26,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:43:26,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:26,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:43:26,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:43:26,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 06:43:26,497 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-17 06:43:26,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:26,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 06:43:26,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:26,712 INFO L124 PetriNetUnfolderBase]: 617/954 cut-off events. [2025-03-17 06:43:26,712 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-17 06:43:26,716 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 3786 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-17 06:43:26,725 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-03-17 06:43:26,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2025-03-17 06:43:26,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:43:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:43:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-17 06:43:26,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-03-17 06:43:26,736 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2025-03-17 06:43:26,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2025-03-17 06:43:26,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 06:43:26,744 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2025-03-17 06:43:26,745 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-17 06:43:26,749 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-03-17 06:43:26,749 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2025-03-17 06:43:26,749 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-17 06:43:26,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:26,749 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-17 06:43:26,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:43:26,750 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-17 06:43:26,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash 413226038, now seen corresponding path program 1 times [2025-03-17 06:43:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823237803] [2025-03-17 06:43:26,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:43:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:26,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 06:43:26,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 06:43:26,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:26,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:26,913 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-17 06:43:26,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:26,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823237803] [2025-03-17 06:43:26,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823237803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:43:26,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:43:26,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:43:26,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230714844] [2025-03-17 06:43:26,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:43:26,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:43:26,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:26,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:43:26,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:43:26,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 06:43:26,922 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-17 06:43:26,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:26,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 06:43:26,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:27,058 INFO L124 PetriNetUnfolderBase]: 617/965 cut-off events. [2025-03-17 06:43:27,059 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2025-03-17 06:43:27,061 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 4084 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-17 06:43:27,066 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-17 06:43:27,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 150 flow [2025-03-17 06:43:27,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:43:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:43:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-17 06:43:27,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-17 06:43:27,069 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 3 states and 48 transitions. [2025-03-17 06:43:27,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 150 flow [2025-03-17 06:43:27,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:43:27,071 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 98 flow [2025-03-17 06:43:27,072 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-17 06:43:27,072 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-03-17 06:43:27,072 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 98 flow [2025-03-17 06:43:27,073 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-17 06:43:27,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:27,073 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-17 06:43:27,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:43:27,073 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-17 06:43:27,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:27,074 INFO L85 PathProgramCache]: Analyzing trace with hash 116750022, now seen corresponding path program 1 times [2025-03-17 06:43:27,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:27,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317927453] [2025-03-17 06:43:27,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:43:27,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:27,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:43:27,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:43:27,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:27,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:27,172 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-17 06:43:27,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:27,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317927453] [2025-03-17 06:43:27,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317927453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:43:27,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:43:27,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:43:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609375324] [2025-03-17 06:43:27,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:43:27,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:43:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:27,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:43:27,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:43:27,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:43:27,182 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-17 06:43:27,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:27,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:43:27,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:27,332 INFO L124 PetriNetUnfolderBase]: 790/1161 cut-off events. [2025-03-17 06:43:27,332 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-03-17 06:43:27,334 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 4573 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-17 06:43:27,338 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-03-17 06:43:27,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 224 flow [2025-03-17 06:43:27,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:43:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:43:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-17 06:43:27,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-03-17 06:43:27,340 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 98 flow. Second operand 4 states and 63 transitions. [2025-03-17 06:43:27,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 224 flow [2025-03-17 06:43:27,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 218 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 06:43:27,342 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 113 flow [2025-03-17 06:43:27,343 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-17 06:43:27,344 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-17 06:43:27,344 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 113 flow [2025-03-17 06:43:27,344 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-17 06:43:27,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:27,345 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-17 06:43:27,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:43:27,345 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-17 06:43:27,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash 380540752, now seen corresponding path program 1 times [2025-03-17 06:43:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:27,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223152418] [2025-03-17 06:43:27,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:43:27,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:27,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:43:27,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:43:27,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:27,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:27,528 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-17 06:43:27,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:27,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223152418] [2025-03-17 06:43:27,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223152418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:27,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252968834] [2025-03-17 06:43:27,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:43:27,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:43:27,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:43:27,533 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-17 06:43:27,534 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-17 06:43:27,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:43:27,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:43:27,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:27,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:27,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:43:27,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:43:27,683 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-17 06:43:27,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:43:27,721 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-17 06:43:27,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252968834] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:27,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:43:27,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-17 06:43:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598978369] [2025-03-17 06:43:27,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:43:27,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:43:27,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:27,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:43:27,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:43:27,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:43:27,731 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-17 06:43:27,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:27,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:43:27,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:27,848 INFO L124 PetriNetUnfolderBase]: 855/1295 cut-off events. [2025-03-17 06:43:27,848 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2025-03-17 06:43:27,850 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-17 06:43:27,854 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-03-17 06:43:27,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 257 flow [2025-03-17 06:43:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:43:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 06:43:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-03-17 06:43:27,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-17 06:43:27,856 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 113 flow. Second operand 5 states and 72 transitions. [2025-03-17 06:43:27,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 257 flow [2025-03-17 06:43:27,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:43:27,858 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 132 flow [2025-03-17 06:43:27,858 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-17 06:43:27,859 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-17 06:43:27,859 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 132 flow [2025-03-17 06:43:27,859 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-17 06:43:27,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:27,859 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-17 06:43:27,866 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-17 06:43:28,064 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-17 06:43:28,065 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-17 06:43:28,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:28,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1625612328, now seen corresponding path program 1 times [2025-03-17 06:43:28,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:28,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965942284] [2025-03-17 06:43:28,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:43:28,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:28,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:43:28,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:28,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:28,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:28,615 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-17 06:43:28,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:28,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965942284] [2025-03-17 06:43:28,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965942284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:28,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818894591] [2025-03-17 06:43:28,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:43:28,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:43:28,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:43:28,619 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-17 06:43:28,621 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-17 06:43:28,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:43:28,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:28,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:28,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:28,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 06:43:28,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:43:28,742 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-17 06:43:28,940 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 55 treesize of output 31 [2025-03-17 06:43:29,027 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-17 06:43:29,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:43:29,856 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 117 treesize of output 105 [2025-03-17 06:43:29,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:43:29,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2025-03-17 06:43:30,566 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 93 treesize of output 85 [2025-03-17 06:43:30,590 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-17 06:43:30,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2025-03-17 06:43:30,902 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-17 06:43:30,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818894591] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:43:30,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:43:30,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-03-17 06:43:30,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132606940] [2025-03-17 06:43:30,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:43:30,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 06:43:30,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:30,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 06:43:30,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-03-17 06:43:31,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:43:31,013 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-17 06:43:31,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:31,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:43:31,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:32,533 INFO L124 PetriNetUnfolderBase]: 1841/2761 cut-off events. [2025-03-17 06:43:32,533 INFO L125 PetriNetUnfolderBase]: For 1721/1721 co-relation queries the response was YES. [2025-03-17 06:43:32,537 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 134. Compared 12699 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-17 06:43:32,545 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 57 changer transitions 1/199 dead transitions. [2025-03-17 06:43:32,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1067 flow [2025-03-17 06:43:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 06:43:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 06:43:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 321 transitions. [2025-03-17 06:43:32,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2025-03-17 06:43:32,549 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 132 flow. Second operand 21 states and 321 transitions. [2025-03-17 06:43:32,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1067 flow [2025-03-17 06:43:32,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 199 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:43:32,556 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 543 flow [2025-03-17 06:43:32,556 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-17 06:43:32,558 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-03-17 06:43:32,558 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 543 flow [2025-03-17 06:43:32,558 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-17 06:43:32,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:32,558 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-17 06:43:32,565 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-17 06:43:32,762 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-17 06:43:32,762 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-17 06:43:32,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1300411264, now seen corresponding path program 2 times [2025-03-17 06:43:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:32,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069936060] [2025-03-17 06:43:32,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:43:32,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:32,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 06:43:32,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:32,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:43:32,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:33,157 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-17 06:43:33,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:33,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069936060] [2025-03-17 06:43:33,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069936060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:33,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043921987] [2025-03-17 06:43:33,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:43:33,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:43:33,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:43:33,160 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-17 06:43:33,162 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-17 06:43:33,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 06:43:33,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:33,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:43:33,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:33,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 06:43:33,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:43:33,242 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-17 06:43:33,392 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 54 treesize of output 30 [2025-03-17 06:43:33,437 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-17 06:43:33,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:43:33,966 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 117 treesize of output 105 [2025-03-17 06:43:33,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:43:33,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2025-03-17 06:43:34,460 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 93 treesize of output 85 [2025-03-17 06:43:34,481 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-17 06:43:34,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2025-03-17 06:43:34,725 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-17 06:43:34,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043921987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:43:34,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:43:34,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-03-17 06:43:34,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475274463] [2025-03-17 06:43:34,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:43:34,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 06:43:34,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:34,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 06:43:34,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-03-17 06:43:34,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 06:43:34,835 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-17 06:43:34,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:34,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 06:43:34,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:36,084 INFO L124 PetriNetUnfolderBase]: 2050/3333 cut-off events. [2025-03-17 06:43:36,084 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2025-03-17 06:43:36,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10794 conditions, 3333 events. 2050/3333 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18097 event pairs, 124 based on Foata normal form. 3/3334 useless extension candidates. Maximal degree in co-relation 10232. Up to 1815 conditions per place. [2025-03-17 06:43:36,110 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 193 selfloop transitions, 121 changer transitions 2/322 dead transitions. [2025-03-17 06:43:36,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 322 transitions, 2167 flow [2025-03-17 06:43:36,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 06:43:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-17 06:43:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 474 transitions. [2025-03-17 06:43:36,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4633431085043988 [2025-03-17 06:43:36,115 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 543 flow. Second operand 31 states and 474 transitions. [2025-03-17 06:43:36,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 322 transitions, 2167 flow [2025-03-17 06:43:36,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 322 transitions, 1959 flow, removed 77 selfloop flow, removed 3 redundant places. [2025-03-17 06:43:36,138 INFO L231 Difference]: Finished difference. Result has 105 places, 182 transitions, 1307 flow [2025-03-17 06:43:36,138 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=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1307, PETRI_PLACES=105, PETRI_TRANSITIONS=182} [2025-03-17 06:43:36,138 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2025-03-17 06:43:36,140 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 182 transitions, 1307 flow [2025-03-17 06:43:36,140 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-17 06:43:36,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:36,140 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-17 06:43:36,148 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-17 06:43:36,341 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-17 06:43:36,341 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-17 06:43:36,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1331844146, now seen corresponding path program 3 times [2025-03-17 06:43:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:36,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517645457] [2025-03-17 06:43:36,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:43:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:36,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-17 06:43:36,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:36,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:43:36,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:36,648 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-17 06:43:36,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:36,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517645457] [2025-03-17 06:43:36,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517645457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:36,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910237365] [2025-03-17 06:43:36,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:43:36,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:43:36,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:43:36,650 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-17 06:43:36,651 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-17 06:43:36,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-17 06:43:36,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:36,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:43:36,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:36,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 06:43:36,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:43:36,840 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 55 treesize of output 31 [2025-03-17 06:43:36,870 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-17 06:43:36,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:43:36,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:43:36,927 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 89 treesize of output 49 [2025-03-17 06:43:37,027 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-17 06:43:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910237365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:43:37,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:43:37,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2025-03-17 06:43:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144280290] [2025-03-17 06:43:37,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:43:37,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 06:43:37,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:37,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 06:43:37,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-17 06:43:37,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 06:43:37,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 182 transitions, 1307 flow. Second operand has 22 states, 22 states have (on average 9.681818181818182) internal successors, (213), 22 states have internal predecessors, (213), 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-17 06:43:37,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:37,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 06:43:37,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:38,000 INFO L124 PetriNetUnfolderBase]: 2937/4769 cut-off events. [2025-03-17 06:43:38,000 INFO L125 PetriNetUnfolderBase]: For 14204/14224 co-relation queries the response was YES. [2025-03-17 06:43:38,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18565 conditions, 4769 events. 2937/4769 cut-off events. For 14204/14224 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 28158 event pairs, 400 based on Foata normal form. 19/4784 useless extension candidates. Maximal degree in co-relation 17983. Up to 3122 conditions per place. [2025-03-17 06:43:38,034 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 219 selfloop transitions, 104 changer transitions 1/330 dead transitions. [2025-03-17 06:43:38,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 330 transitions, 2821 flow [2025-03-17 06:43:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 06:43:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 06:43:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 323 transitions. [2025-03-17 06:43:38,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44490358126721763 [2025-03-17 06:43:38,036 INFO L175 Difference]: Start difference. First operand has 105 places, 182 transitions, 1307 flow. Second operand 22 states and 323 transitions. [2025-03-17 06:43:38,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 330 transitions, 2821 flow [2025-03-17 06:43:38,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 330 transitions, 2688 flow, removed 64 selfloop flow, removed 2 redundant places. [2025-03-17 06:43:38,063 INFO L231 Difference]: Finished difference. Result has 129 places, 243 transitions, 1954 flow [2025-03-17 06:43:38,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1954, PETRI_PLACES=129, PETRI_TRANSITIONS=243} [2025-03-17 06:43:38,064 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 94 predicate places. [2025-03-17 06:43:38,064 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 243 transitions, 1954 flow [2025-03-17 06:43:38,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.681818181818182) internal successors, (213), 22 states have internal predecessors, (213), 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-17 06:43:38,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:38,064 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-17 06:43:38,073 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-17 06:43:38,265 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-17 06:43:38,265 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-17 06:43:38,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash 565926660, now seen corresponding path program 4 times [2025-03-17 06:43:38,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:38,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399143493] [2025-03-17 06:43:38,266 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:43:38,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:38,271 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-17 06:43:38,280 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:38,280 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:43:38,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:38,579 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-17 06:43:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:38,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399143493] [2025-03-17 06:43:38,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399143493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:38,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084182780] [2025-03-17 06:43:38,580 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:43:38,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:43:38,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:43:38,582 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-17 06:43:38,583 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-17 06:43:38,618 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-17 06:43:38,633 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:38,633 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:43:38,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:38,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 06:43:38,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:43:38,779 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 55 treesize of output 31 [2025-03-17 06:43:38,816 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-17 06:43:38,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:43:38,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:43:38,862 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 89 treesize of output 49 [2025-03-17 06:43:38,966 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-17 06:43:38,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084182780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:43:38,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:43:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 24 [2025-03-17 06:43:38,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916664991] [2025-03-17 06:43:38,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:43:38,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 06:43:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:38,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 06:43:38,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2025-03-17 06:43:39,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:43:39,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 243 transitions, 1954 flow. Second operand has 25 states, 25 states have (on average 8.52) internal successors, (213), 25 states have internal predecessors, (213), 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-17 06:43:39,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:39,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:43:39,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:39,876 INFO L124 PetriNetUnfolderBase]: 4642/7254 cut-off events. [2025-03-17 06:43:39,876 INFO L125 PetriNetUnfolderBase]: For 24829/24845 co-relation queries the response was YES. [2025-03-17 06:43:39,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30315 conditions, 7254 events. 4642/7254 cut-off events. For 24829/24845 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 43868 event pairs, 677 based on Foata normal form. 13/7265 useless extension candidates. Maximal degree in co-relation 29437. Up to 5406 conditions per place. [2025-03-17 06:43:39,913 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 266 selfloop transitions, 194 changer transitions 1/466 dead transitions. [2025-03-17 06:43:39,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 466 transitions, 4565 flow [2025-03-17 06:43:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:43:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 06:43:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 192 transitions. [2025-03-17 06:43:39,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2025-03-17 06:43:39,915 INFO L175 Difference]: Start difference. First operand has 129 places, 243 transitions, 1954 flow. Second operand 15 states and 192 transitions. [2025-03-17 06:43:39,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 466 transitions, 4565 flow [2025-03-17 06:43:39,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 466 transitions, 4431 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-03-17 06:43:39,973 INFO L231 Difference]: Finished difference. Result has 140 places, 386 transitions, 3893 flow [2025-03-17 06:43:39,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3893, PETRI_PLACES=140, PETRI_TRANSITIONS=386} [2025-03-17 06:43:39,974 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 105 predicate places. [2025-03-17 06:43:39,974 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 386 transitions, 3893 flow [2025-03-17 06:43:39,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.52) internal successors, (213), 25 states have internal predecessors, (213), 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-17 06:43:39,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:39,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:43:39,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 06:43:40,174 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-17 06:43:40,175 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-17 06:43:40,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:40,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1890032000, now seen corresponding path program 5 times [2025-03-17 06:43:40,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:40,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919388511] [2025-03-17 06:43:40,175 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:43:40,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:40,180 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 06:43:40,188 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:40,188 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:43:40,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:40,558 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-17 06:43:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919388511] [2025-03-17 06:43:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919388511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061540675] [2025-03-17 06:43:40,559 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:43:40,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:43:40,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:43:40,560 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-17 06:43:40,562 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-17 06:43:40,596 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 06:43:40,612 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:40,612 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:43:40,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:40,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 06:43:40,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:43:40,636 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-17 06:43:40,745 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 54 treesize of output 30 [2025-03-17 06:43:40,798 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-17 06:43:40,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:43:41,260 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 66 treesize of output 58 [2025-03-17 06:43:41,268 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 06:43:41,268 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 100 treesize of output 79 [2025-03-17 06:43:41,299 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 53 treesize of output 47 [2025-03-17 06:43:41,305 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 06:43:41,305 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 64 treesize of output 54 [2025-03-17 06:43:41,385 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 69 treesize of output 61 [2025-03-17 06:43:41,392 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 06:43:41,392 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 83 treesize of output 75 [2025-03-17 06:43:41,473 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-17 06:43:41,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061540675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:43:41,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:43:41,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 22 [2025-03-17 06:43:41,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467835493] [2025-03-17 06:43:41,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:43:41,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 06:43:41,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:41,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 06:43:41,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-03-17 06:43:41,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:43:41,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 386 transitions, 3893 flow. Second operand has 23 states, 23 states have (on average 8.695652173913043) internal successors, (200), 23 states have internal predecessors, (200), 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-17 06:43:41,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:41,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:43:41,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:43,759 INFO L124 PetriNetUnfolderBase]: 5562/8828 cut-off events. [2025-03-17 06:43:43,760 INFO L125 PetriNetUnfolderBase]: For 41142/41174 co-relation queries the response was YES. [2025-03-17 06:43:43,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41569 conditions, 8828 events. 5562/8828 cut-off events. For 41142/41174 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 56080 event pairs, 806 based on Foata normal form. 12/8838 useless extension candidates. Maximal degree in co-relation 40903. Up to 5025 conditions per place. [2025-03-17 06:43:43,833 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 318 selfloop transitions, 328 changer transitions 1/652 dead transitions. [2025-03-17 06:43:43,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 652 transitions, 7318 flow [2025-03-17 06:43:43,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 06:43:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-17 06:43:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 462 transitions. [2025-03-17 06:43:43,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-17 06:43:43,835 INFO L175 Difference]: Start difference. First operand has 140 places, 386 transitions, 3893 flow. Second operand 33 states and 462 transitions. [2025-03-17 06:43:43,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 652 transitions, 7318 flow [2025-03-17 06:43:43,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 652 transitions, 7157 flow, removed 53 selfloop flow, removed 2 redundant places. [2025-03-17 06:43:43,942 INFO L231 Difference]: Finished difference. Result has 184 places, 523 transitions, 6330 flow [2025-03-17 06:43:43,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3774, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=6330, PETRI_PLACES=184, PETRI_TRANSITIONS=523} [2025-03-17 06:43:43,942 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 149 predicate places. [2025-03-17 06:43:43,942 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 523 transitions, 6330 flow [2025-03-17 06:43:43,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.695652173913043) internal successors, (200), 23 states have internal predecessors, (200), 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-17 06:43:43,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:43,943 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-17 06:43:43,950 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-17 06:43:44,148 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-17 06:43:44,148 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-17 06:43:44,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:44,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2037868248, now seen corresponding path program 6 times [2025-03-17 06:43:44,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:44,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177778690] [2025-03-17 06:43:44,149 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 06:43:44,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:44,154 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-17 06:43:44,159 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-17 06:43:44,162 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 06:43:44,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:44,462 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-17 06:43:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177778690] [2025-03-17 06:43:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177778690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:43:44,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:43:44,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:43:44,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734044185] [2025-03-17 06:43:44,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:43:44,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:43:44,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:44,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:43:44,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:43:44,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-17 06:43:44,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 523 transitions, 6330 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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-17 06:43:44,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:44,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-17 06:43:44,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:46,265 INFO L124 PetriNetUnfolderBase]: 10387/15001 cut-off events. [2025-03-17 06:43:46,265 INFO L125 PetriNetUnfolderBase]: For 89744/90426 co-relation queries the response was YES. [2025-03-17 06:43:46,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76648 conditions, 15001 events. 10387/15001 cut-off events. For 89744/90426 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 87089 event pairs, 1222 based on Foata normal form. 612/15574 useless extension candidates. Maximal degree in co-relation 75473. Up to 9975 conditions per place. [2025-03-17 06:43:46,403 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 400 selfloop transitions, 476 changer transitions 1/880 dead transitions. [2025-03-17 06:43:46,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 880 transitions, 12130 flow [2025-03-17 06:43:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:43:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 06:43:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 206 transitions. [2025-03-17 06:43:46,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4161616161616162 [2025-03-17 06:43:46,404 INFO L175 Difference]: Start difference. First operand has 184 places, 523 transitions, 6330 flow. Second operand 15 states and 206 transitions. [2025-03-17 06:43:46,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 880 transitions, 12130 flow [2025-03-17 06:43:46,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 880 transitions, 11523 flow, removed 254 selfloop flow, removed 9 redundant places. [2025-03-17 06:43:46,828 INFO L231 Difference]: Finished difference. Result has 198 places, 790 transitions, 11199 flow [2025-03-17 06:43:46,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5922, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=11199, PETRI_PLACES=198, PETRI_TRANSITIONS=790} [2025-03-17 06:43:46,831 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 163 predicate places. [2025-03-17 06:43:46,831 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 790 transitions, 11199 flow [2025-03-17 06:43:46,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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-17 06:43:46,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:46,831 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-17 06:43:46,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:43:46,831 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-17 06:43:46,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 920428136, now seen corresponding path program 7 times [2025-03-17 06:43:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:46,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957197354] [2025-03-17 06:43:46,836 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 06:43:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:46,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:43:46,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:46,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:46,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:47,385 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-17 06:43:47,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:47,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957197354] [2025-03-17 06:43:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957197354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:47,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061828925] [2025-03-17 06:43:47,386 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 06:43:47,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:43:47,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:43:47,388 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-17 06:43:47,391 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-17 06:43:47,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:43:47,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:43:47,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:43:47,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:47,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 06:43:47,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:43:47,465 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-17 06:43:47,595 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 55 treesize of output 31 [2025-03-17 06:43:47,636 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-17 06:43:47,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:43:48,061 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 66 treesize of output 58 [2025-03-17 06:43:48,069 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 06:43:48,069 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 100 treesize of output 79 [2025-03-17 06:43:48,144 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 53 treesize of output 47 [2025-03-17 06:43:48,151 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 06:43:48,151 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 64 treesize of output 54 [2025-03-17 06:43:48,213 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 69 treesize of output 61 [2025-03-17 06:43:48,220 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 06:43:48,220 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 83 treesize of output 75 [2025-03-17 06:43:48,305 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-17 06:43:48,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061828925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:43:48,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:43:48,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2025-03-17 06:43:48,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917068490] [2025-03-17 06:43:48,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:43:48,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 06:43:48,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:48,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 06:43:48,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-03-17 06:43:48,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:43:48,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 790 transitions, 11199 flow. Second operand has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 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-17 06:43:48,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:48,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:43:48,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:50,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L47-->L46-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_51| v_~A~0.base_63) (+ v_~A~0.offset_63 (* v_thread1Thread1of1ForFork1_~i~0_7 4))))) (or (and (< v_~max1~0_29 .cse0) (= v_~max1~0_28 .cse0)) (and (= |v_thread1Thread1of1ForFork1_#t~mem2_2| |v_thread1Thread1of1ForFork1_#t~mem2_1|) (= v_~max1~0_29 v_~max1~0_28) (<= .cse0 v_~max1~0_29)))) InVars {~max1~0=v_~max1~0_29, ~A~0.base=v_~A~0.base_63, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, ~A~0.offset=v_~A~0.offset_63, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_1|, #memory_int#1=|v_#memory_int#1_51|} OutVars{~max1~0=v_~max1~0_28, ~A~0.base=v_~A~0.base_63, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_63, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_2|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, #memory_int#1=|v_#memory_int#1_51|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2][259], [Black: 909#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1022#(and (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1020#(and (or (and (= ~max2~0 0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= 1 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= thread3Thread1of1ForFork2_~i~2 0) (or (= ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1014#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1028#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0)), Black: 989#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (= ~max2~0 ~max1~0) (= ~M~0 0))), Black: 1016#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1026#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~max2~0 ~max1~0)), Black: 1289#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1295#(and (= ~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1279#(and (= ~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0)), Black: 1297#(and (or (= ~max2~0 0) (< 0 ~N~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1283#(= ~max2~0 ~max1~0), Black: 1281#(and (or (= ~max2~0 ~max1~0) (< 1 ~N~0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (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))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1287#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), 21#L46-3true, Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 637#true, 1307#true, Black: 52#(<= (+ ~M~0 1) ~N~0), 12#L71true, 11#L94-1true, Black: 709#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 826#(and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max1~0 0) (< 0 ~max1~0))), Black: 645#(and (= (select (select |#memory_int#1| ~A~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~A~0.offset 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 0) (= ~max2~0 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (<= 1 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)))))), Black: 643#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 646#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), 1038#true, 1273#true, 834#true, 29#L59true, Black: 1236#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1224#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1218#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1238#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), 203#true, Black: 1048#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1250#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 1226#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 1232#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (or (and (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 1230#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~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))) ~max1~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)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1228#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (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 (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~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))) ~max1~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)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))), Black: 422#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~M~0 0)), Black: 1222#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 414#true, 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|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1234#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 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|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1220#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1258#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (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) (+ ~max1~0 1)))), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 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|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 596#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~max1~0))]) [2025-03-17 06:43:50,574 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-17 06:43:50,574 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-17 06:43:50,574 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-17 06:43:50,574 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-17 06:43:50,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L59-->L58-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_59| v_~A~0.base_83) (+ (* v_thread2Thread1of1ForFork0_~i~1_7 4) v_~A~0.offset_83)))) (or (and (< v_~max2~0_62 .cse0) (= v_~max2~0_61 .cse0)) (and (= v_~max2~0_62 v_~max2~0_61) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|) (<= .cse0 v_~max2~0_62)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7, ~A~0.base=v_~A~0.base_83, ~A~0.offset=v_~A~0.offset_83, #memory_int#1=|v_#memory_int#1_59|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|, ~max2~0=v_~max2~0_62} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7, ~A~0.base=v_~A~0.base_83, ~A~0.offset=v_~A~0.offset_83, ~max2~0=v_~max2~0_61, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_2|, #memory_int#1=|v_#memory_int#1_59|} AuxVars[] AssignedVars[~max2~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][260], [Black: 909#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1022#(and (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1020#(and (or (and (= ~max2~0 0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= 1 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= thread3Thread1of1ForFork2_~i~2 0) (or (= ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1014#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1028#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0)), Black: 989#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (= ~max2~0 ~max1~0) (= ~M~0 0))), Black: 1016#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1026#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~max2~0 ~max1~0)), Black: 1289#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1295#(and (= ~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1279#(and (= ~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0)), Black: 1297#(and (or (= ~max2~0 0) (< 0 ~N~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1283#(= ~max2~0 ~max1~0), Black: 1281#(and (or (= ~max2~0 ~max1~0) (< 1 ~N~0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (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))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1287#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 9#L47true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 637#true, 1307#true, Black: 52#(<= (+ ~M~0 1) ~N~0), 12#L71true, 11#L94-1true, Black: 709#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 826#(and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max1~0 0) (< 0 ~max1~0))), Black: 645#(and (= (select (select |#memory_int#1| ~A~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~A~0.offset 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 0) (= ~max2~0 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (<= 1 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)))))), Black: 643#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 646#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), 1038#true, 1273#true, 834#true, 19#L58-3true, Black: 1236#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1224#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1218#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1238#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), 203#true, Black: 1048#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1250#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 1226#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 1232#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (or (and (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 1230#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~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))) ~max1~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)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1228#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (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 (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~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))) ~max1~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)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))), Black: 422#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~M~0 0)), Black: 1222#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 414#true, 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|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1234#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 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|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1220#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1258#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (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) (+ ~max1~0 1)))), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 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|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 596#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~max1~0))]) [2025-03-17 06:43:50,575 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-17 06:43:50,575 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-17 06:43:50,575 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-17 06:43:50,575 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-17 06:43:50,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L71-->L70-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_55| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~max2~0_49 .cse0) (< v_~max2~0_50 .cse0)) (and (<= .cse0 v_~max2~0_50) (= v_~max2~0_49 v_~max2~0_50) (= |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_71, ~A~0.offset=v_~A~0.offset_71, #memory_int#1=|v_#memory_int#1_55|, ~max2~0=v_~max2~0_50, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, ~max2~0=v_~max2~0_49, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_55|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7][583], [Black: 909#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1022#(and (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1020#(and (or (and (= ~max2~0 0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= 1 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= thread3Thread1of1ForFork2_~i~2 0) (or (= ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1014#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1028#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0)), Black: 989#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (= ~max2~0 ~max1~0) (= ~M~0 0))), Black: 1016#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1026#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~max2~0 ~max1~0)), Black: 1289#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1295#(and (= ~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1279#(and (= ~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0)), Black: 1297#(and (or (= ~max2~0 0) (< 0 ~N~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1283#(= ~max2~0 ~max1~0), Black: 1281#(and (or (= ~max2~0 ~max1~0) (< 1 ~N~0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (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))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1287#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 9#L47true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 637#true, 1307#true, Black: 52#(<= (+ ~M~0 1) ~N~0), 11#L94-1true, Black: 709#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 826#(and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max1~0 0) (< 0 ~max1~0))), Black: 645#(and (= (select (select |#memory_int#1| ~A~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~A~0.offset 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 0) (= ~max2~0 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (<= 1 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)))))), Black: 643#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 646#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), 1038#true, 1273#true, 834#true, 29#L59true, Black: 1236#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1224#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1218#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1238#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), 203#true, Black: 1048#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1250#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 1226#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), 34#L70-3true, Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 1232#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (or (and (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 1230#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~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))) ~max1~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)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1228#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (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 (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~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))) ~max1~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)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))), Black: 422#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~M~0 0)), Black: 1222#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 414#true, 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|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1234#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 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|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1220#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1258#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (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) (+ ~max1~0 1)))), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 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|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 596#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~max1~0))]) [2025-03-17 06:43:50,575 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-17 06:43:50,576 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-17 06:43:50,576 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-17 06:43:50,576 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-17 06:43:50,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L47-->L46-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_51| v_~A~0.base_63) (+ v_~A~0.offset_63 (* v_thread1Thread1of1ForFork1_~i~0_7 4))))) (or (and (< v_~max1~0_29 .cse0) (= v_~max1~0_28 .cse0)) (and (= |v_thread1Thread1of1ForFork1_#t~mem2_2| |v_thread1Thread1of1ForFork1_#t~mem2_1|) (= v_~max1~0_29 v_~max1~0_28) (<= .cse0 v_~max1~0_29)))) InVars {~max1~0=v_~max1~0_29, ~A~0.base=v_~A~0.base_63, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, ~A~0.offset=v_~A~0.offset_63, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_1|, #memory_int#1=|v_#memory_int#1_51|} OutVars{~max1~0=v_~max1~0_28, ~A~0.base=v_~A~0.base_63, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_63, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_2|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, #memory_int#1=|v_#memory_int#1_51|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2][259], [Black: 909#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1022#(and (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1020#(and (or (and (= ~max2~0 0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= 1 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= thread3Thread1of1ForFork2_~i~2 0) (or (= ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1014#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1028#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0)), Black: 989#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (= ~max2~0 ~max1~0) (= ~M~0 0))), Black: 1016#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1026#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~max2~0 ~max1~0)), Black: 1289#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1295#(and (= ~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1279#(and (= ~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0)), Black: 1297#(and (or (= ~max2~0 0) (< 0 ~N~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1283#(= ~max2~0 ~max1~0), Black: 1281#(and (or (= ~max2~0 ~max1~0) (< 1 ~N~0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (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))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1287#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), 21#L46-3true, Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 25#L95true, 637#true, 1307#true, Black: 52#(<= (+ ~M~0 1) ~N~0), 12#L71true, Black: 709#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 826#(and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max1~0 0) (< 0 ~max1~0))), Black: 645#(and (= (select (select |#memory_int#1| ~A~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~A~0.offset 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 0) (= ~max2~0 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (<= 1 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)))))), Black: 643#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 646#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), 1038#true, 1273#true, 834#true, 29#L59true, Black: 1236#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1224#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1218#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1238#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), 203#true, Black: 1048#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1250#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 1226#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 1232#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (or (and (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 1230#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~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))) ~max1~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)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1228#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (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 (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~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))) ~max1~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)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))), Black: 422#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~M~0 0)), Black: 1222#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 414#true, 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|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1234#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 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|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1220#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 1258#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (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) (+ ~max1~0 1)))), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 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|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 596#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~max1~0))]) [2025-03-17 06:43:50,803 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-17 06:43:50,803 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-17 06:43:50,804 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-17 06:43:50,804 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-17 06:43:50,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([342] L59-->L58-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_59| v_~A~0.base_83) (+ (* v_thread2Thread1of1ForFork0_~i~1_7 4) v_~A~0.offset_83)))) (or (and (< v_~max2~0_62 .cse0) (= v_~max2~0_61 .cse0)) (and (= v_~max2~0_62 v_~max2~0_61) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|) (<= .cse0 v_~max2~0_62)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7, ~A~0.base=v_~A~0.base_83, ~A~0.offset=v_~A~0.offset_83, #memory_int#1=|v_#memory_int#1_59|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|, ~max2~0=v_~max2~0_62} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7, ~A~0.base=v_~A~0.base_83, ~A~0.offset=v_~A~0.offset_83, ~max2~0=v_~max2~0_61, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_2|, #memory_int#1=|v_#memory_int#1_59|} AuxVars[] AssignedVars[~max2~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5][260], [Black: 909#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1022#(and (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1020#(and (or (and (= ~max2~0 0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= 1 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= thread3Thread1of1ForFork2_~i~2 0) (or (= ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1014#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1028#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0)), Black: 989#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (= ~max2~0 ~max1~0) (= ~M~0 0))), Black: 1016#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1026#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~max2~0 ~max1~0)), Black: 1289#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1295#(and (= ~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1279#(and (= ~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0)), Black: 1297#(and (or (= ~max2~0 0) (< 0 ~N~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1283#(= ~max2~0 ~max1~0), Black: 1281#(and (or (= ~max2~0 ~max1~0) (< 1 ~N~0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (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))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1287#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 9#L47true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 25#L95true, 637#true, 1307#true, Black: 52#(<= (+ ~M~0 1) ~N~0), 12#L71true, Black: 709#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 826#(and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max1~0 0) (< 0 ~max1~0))), Black: 645#(and (= (select (select |#memory_int#1| ~A~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~A~0.offset 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 0) (= ~max2~0 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (<= 1 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)))))), Black: 643#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 646#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), 1038#true, 1273#true, 19#L58-3true, 834#true, Black: 1236#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1224#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1218#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1238#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), 203#true, Black: 1048#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1250#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 1226#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 1232#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (or (and (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 1230#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~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))) ~max1~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)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1228#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (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 (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~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))) ~max1~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)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))), Black: 422#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~M~0 0)), Black: 1222#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 414#true, 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|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1234#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 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|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1220#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1258#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (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) (+ ~max1~0 1)))), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 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|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 596#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~max1~0))]) [2025-03-17 06:43:50,804 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-17 06:43:50,804 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-17 06:43:50,804 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-17 06:43:50,804 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-17 06:43:50,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L71-->L70-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_55| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~max2~0_49 .cse0) (< v_~max2~0_50 .cse0)) (and (<= .cse0 v_~max2~0_50) (= v_~max2~0_49 v_~max2~0_50) (= |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_71, ~A~0.offset=v_~A~0.offset_71, #memory_int#1=|v_#memory_int#1_55|, ~max2~0=v_~max2~0_50, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, ~max2~0=v_~max2~0_49, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_55|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7][583], [Black: 909#(or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))), Black: 1022#(and (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1020#(and (or (and (= ~max2~0 0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= 1 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= thread3Thread1of1ForFork2_~i~2 0) (or (= ~A~0.offset 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1014#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1028#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 ~max1~0)), Black: 989#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (= ~max2~0 ~max1~0) (= ~M~0 0))), Black: 1016#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1026#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (and (= ~max1~0 ~A~0.offset) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1282#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~max2~0 ~max1~0)), Black: 1289#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1295#(and (= ~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1279#(and (= ~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0)), Black: 1297#(and (or (= ~max2~0 0) (< 0 ~N~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) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~max2~0 0)) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 1)) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1283#(= ~max2~0 ~max1~0), Black: 1281#(and (or (= ~max2~0 ~max1~0) (< 1 ~N~0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (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))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1287#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 9#L47true, Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 25#L95true, 637#true, 1307#true, Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 709#(or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))), Black: 826#(and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max1~0 0) (< 0 ~max1~0))), Black: 645#(and (= (select (select |#memory_int#1| ~A~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (= ~A~0.offset 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)) 0) (= ~max2~0 0)) (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (<= 1 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4)))))), Black: 643#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 646#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), 1038#true, 1273#true, 834#true, 29#L59true, Black: 1236#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1224#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), Black: 1218#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1238#(and (<= 0 ~M~0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 0))), 203#true, Black: 1048#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1250#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (= thread1Thread1of1ForFork1_~i~0 0) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 1226#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), 34#L70-3true, Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 1232#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (or (and (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)) (= ~max1~0 0) (or (< 0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 1230#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~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))) ~max1~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)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1228#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (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 (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~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))) ~max1~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)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ ~max1~0 1)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))), Black: 422#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= ~M~0 0)), Black: 1222#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 414#true, 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|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1234#(and (<= 0 ~M~0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< 0 ~M~0) (= thread3Thread1of1ForFork2_~i~2 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|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1220#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1258#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (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) (+ ~max1~0 1)))), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 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 (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 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|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (or (< 0 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 0)) (= ~A~0.offset 0) (= ~max2~0 0) (or (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< (select (select |#memory_int#1| ~A~0.base) 0) 1)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 596#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~max1~0))]) [2025-03-17 06:43:50,804 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-17 06:43:50,804 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-17 06:43:50,804 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-17 06:43:50,804 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-17 06:43:50,980 INFO L124 PetriNetUnfolderBase]: 9254/13680 cut-off events. [2025-03-17 06:43:50,980 INFO L125 PetriNetUnfolderBase]: For 116676/117976 co-relation queries the response was YES. [2025-03-17 06:43:51,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82007 conditions, 13680 events. 9254/13680 cut-off events. For 116676/117976 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 82076 event pairs, 1127 based on Foata normal form. 1156/14729 useless extension candidates. Maximal degree in co-relation 81165. Up to 8901 conditions per place. [2025-03-17 06:43:51,089 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 476 selfloop transitions, 448 changer transitions 2/934 dead transitions. [2025-03-17 06:43:51,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 934 transitions, 14152 flow [2025-03-17 06:43:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 06:43:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-17 06:43:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 346 transitions. [2025-03-17 06:43:51,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45586297760210803 [2025-03-17 06:43:51,092 INFO L175 Difference]: Start difference. First operand has 198 places, 790 transitions, 11199 flow. Second operand 23 states and 346 transitions. [2025-03-17 06:43:51,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 934 transitions, 14152 flow [2025-03-17 06:43:51,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 934 transitions, 14035 flow, removed 41 selfloop flow, removed 3 redundant places. [2025-03-17 06:43:51,770 INFO L231 Difference]: Finished difference. Result has 219 places, 830 transitions, 12762 flow [2025-03-17 06:43:51,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=11088, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=412, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=12762, PETRI_PLACES=219, PETRI_TRANSITIONS=830} [2025-03-17 06:43:51,772 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 184 predicate places. [2025-03-17 06:43:51,772 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 830 transitions, 12762 flow [2025-03-17 06:43:51,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 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-17 06:43:51,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:51,773 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-17 06:43:51,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 06:43:51,977 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-17 06:43:51,978 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-17 06:43:51,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:51,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1761182114, now seen corresponding path program 8 times [2025-03-17 06:43:51,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:51,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971341726] [2025-03-17 06:43:51,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:43:51,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:51,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 06:43:52,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:43:52,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:43:52,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:43:52,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:52,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971341726] [2025-03-17 06:43:52,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971341726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:52,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598714616] [2025-03-17 06:43:52,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:43:52,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:43:52,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:43:52,336 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-17 06:43:52,338 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-17 06:43:52,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 06:43:52,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:43:52,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:43:52,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:52,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:43:52,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:43:52,696 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-17 06:43:52,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:43:52,927 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-17 06:43:52,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598714616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:43:52,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:43:52,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-17 06:43:52,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268140363] [2025-03-17 06:43:52,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:43:52,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 06:43:52,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:52,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 06:43:52,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:43:53,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-17 06:43:53,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 830 transitions, 12762 flow. Second operand has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 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-17 06:43:53,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:53,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-17 06:43:53,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:43:56,096 INFO L124 PetriNetUnfolderBase]: 12914/18871 cut-off events. [2025-03-17 06:43:56,096 INFO L125 PetriNetUnfolderBase]: For 192504/193626 co-relation queries the response was YES. [2025-03-17 06:43:56,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115800 conditions, 18871 events. 12914/18871 cut-off events. For 192504/193626 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 116876 event pairs, 2703 based on Foata normal form. 1006/19774 useless extension candidates. Maximal degree in co-relation 114557. Up to 6324 conditions per place. [2025-03-17 06:43:56,281 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 1275 selfloop transitions, 110 changer transitions 0/1391 dead transitions. [2025-03-17 06:43:56,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 1391 transitions, 23473 flow [2025-03-17 06:43:56,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:43:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 06:43:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 219 transitions. [2025-03-17 06:43:56,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2025-03-17 06:43:56,282 INFO L175 Difference]: Start difference. First operand has 219 places, 830 transitions, 12762 flow. Second operand 14 states and 219 transitions. [2025-03-17 06:43:56,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 1391 transitions, 23473 flow [2025-03-17 06:43:57,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 1391 transitions, 23028 flow, removed 94 selfloop flow, removed 11 redundant places. [2025-03-17 06:43:57,452 INFO L231 Difference]: Finished difference. Result has 227 places, 875 transitions, 13247 flow [2025-03-17 06:43:57,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=12387, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13247, PETRI_PLACES=227, PETRI_TRANSITIONS=875} [2025-03-17 06:43:57,452 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 192 predicate places. [2025-03-17 06:43:57,452 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 875 transitions, 13247 flow [2025-03-17 06:43:57,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 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-17 06:43:57,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:43:57,453 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-17 06:43:57,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 06:43:57,653 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-17 06:43:57,655 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-17 06:43:57,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:43:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1657839660, now seen corresponding path program 9 times [2025-03-17 06:43:57,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:43:57,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898767799] [2025-03-17 06:43:57,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:43:57,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:43:57,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-17 06:43:57,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:43:57,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:43:57,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:43:57,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:43:57,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898767799] [2025-03-17 06:43:57,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898767799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:57,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911581576] [2025-03-17 06:43:57,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:43:57,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:43:57,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:43:57,723 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-17 06:43:57,725 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-17 06:43:57,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-17 06:43:57,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:43:57,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:43:57,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:43:57,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:43:57,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:43:57,829 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-17 06:43:57,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:43:57,873 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-17 06:43:57,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911581576] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:43:57,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:43:57,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-17 06:43:57,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171020074] [2025-03-17 06:43:57,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:43:57,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:43:57,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:43:57,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:43:57,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:43:57,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:43:57,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 875 transitions, 13247 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-17 06:43:57,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:43:57,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:43:57,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:44:00,380 INFO L124 PetriNetUnfolderBase]: 11588/17335 cut-off events. [2025-03-17 06:44:00,380 INFO L125 PetriNetUnfolderBase]: For 191416/193055 co-relation queries the response was YES. [2025-03-17 06:44:00,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115809 conditions, 17335 events. 11588/17335 cut-off events. For 191416/193055 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 111220 event pairs, 1992 based on Foata normal form. 1199/18442 useless extension candidates. Maximal degree in co-relation 114896. Up to 5756 conditions per place. [2025-03-17 06:44:00,555 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 1009 selfloop transitions, 77 changer transitions 0/1109 dead transitions. [2025-03-17 06:44:00,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1109 transitions, 18777 flow [2025-03-17 06:44:00,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:44:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:44:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-03-17 06:44:00,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-17 06:44:00,556 INFO L175 Difference]: Start difference. First operand has 227 places, 875 transitions, 13247 flow. Second operand 8 states and 144 transitions. [2025-03-17 06:44:00,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 1109 transitions, 18777 flow [2025-03-17 06:44:01,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 1109 transitions, 18624 flow, removed 73 selfloop flow, removed 3 redundant places. [2025-03-17 06:44:01,738 INFO L231 Difference]: Finished difference. Result has 234 places, 877 transitions, 13405 flow [2025-03-17 06:44:01,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=13042, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=867, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13405, PETRI_PLACES=234, PETRI_TRANSITIONS=877} [2025-03-17 06:44:01,740 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 199 predicate places. [2025-03-17 06:44:01,740 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 877 transitions, 13405 flow [2025-03-17 06:44:01,740 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-17 06:44:01,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:44:01,740 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-17 06:44:01,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 06:44:01,941 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-17 06:44:01,942 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-17 06:44:01,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:44:01,942 INFO L85 PathProgramCache]: Analyzing trace with hash -484103150, now seen corresponding path program 10 times [2025-03-17 06:44:01,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:44:01,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349999334] [2025-03-17 06:44:01,942 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:44:01,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:44:01,954 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-17 06:44:01,959 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-17 06:44:01,959 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 06:44:01,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:02,024 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-17 06:44:02,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:44:02,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349999334] [2025-03-17 06:44:02,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349999334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:44:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827462848] [2025-03-17 06:44:02,026 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:44:02,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:44:02,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:44:02,028 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-17 06:44:02,030 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-17 06:44:02,074 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-17 06:44:02,087 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-17 06:44:02,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 06:44:02,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:02,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:44:02,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:44:02,282 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-17 06:44:02,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:44:02,326 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-17 06:44:02,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827462848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:44:02,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:44:02,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-17 06:44:02,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356607183] [2025-03-17 06:44:02,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:44:02,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:44:02,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:44:02,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:44:02,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:44:02,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-17 06:44:02,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 877 transitions, 13405 flow. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:44:02,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:44:02,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-17 06:44:02,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:44:06,930 INFO L124 PetriNetUnfolderBase]: 18724/27131 cut-off events. [2025-03-17 06:44:06,931 INFO L125 PetriNetUnfolderBase]: For 306722/306722 co-relation queries the response was YES. [2025-03-17 06:44:07,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177950 conditions, 27131 events. 18724/27131 cut-off events. For 306722/306722 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 170673 event pairs, 2631 based on Foata normal form. 14/27145 useless extension candidates. Maximal degree in co-relation 176715. Up to 7853 conditions per place. [2025-03-17 06:44:07,209 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 1736 selfloop transitions, 370 changer transitions 0/2107 dead transitions. [2025-03-17 06:44:07,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2107 transitions, 36097 flow [2025-03-17 06:44:07,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 06:44:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-17 06:44:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 261 transitions. [2025-03-17 06:44:07,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41626794258373206 [2025-03-17 06:44:07,210 INFO L175 Difference]: Start difference. First operand has 234 places, 877 transitions, 13405 flow. Second operand 19 states and 261 transitions. [2025-03-17 06:44:07,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 2107 transitions, 36097 flow [2025-03-17 06:44:09,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 2107 transitions, 35592 flow, removed 51 selfloop flow, removed 3 redundant places. [2025-03-17 06:44:09,216 INFO L231 Difference]: Finished difference. Result has 263 places, 1116 transitions, 18481 flow [2025-03-17 06:44:09,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=13244, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=877, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=18481, PETRI_PLACES=263, PETRI_TRANSITIONS=1116} [2025-03-17 06:44:09,217 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 228 predicate places. [2025-03-17 06:44:09,217 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 1116 transitions, 18481 flow [2025-03-17 06:44:09,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:44:09,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:44:09,217 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-17 06:44:09,223 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-17 06:44:09,418 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-17 06:44:09,418 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-17 06:44:09,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:44:09,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1438717286, now seen corresponding path program 11 times [2025-03-17 06:44:09,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:44:09,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870437431] [2025-03-17 06:44:09,418 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:44:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:44:09,422 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 06:44:09,428 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 06:44:09,428 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:44:09,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:09,472 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-17 06:44:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:44:09,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870437431] [2025-03-17 06:44:09,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870437431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:44:09,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920542755] [2025-03-17 06:44:09,473 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:44:09,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:44:09,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:44:09,475 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-17 06:44:09,477 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-17 06:44:09,516 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 06:44:09,530 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 06:44:09,530 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:44:09,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:09,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:44:09,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:44:09,582 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-17 06:44:09,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:44:09,632 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-17 06:44:09,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920542755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:44:09,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:44:09,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 06:44:09,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731587969] [2025-03-17 06:44:09,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:44:09,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:44:09,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:44:09,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:44:09,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:44:09,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:44:09,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1116 transitions, 18481 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-17 06:44:09,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:44:09,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:44:09,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:44:13,609 INFO L124 PetriNetUnfolderBase]: 11754/18144 cut-off events. [2025-03-17 06:44:13,609 INFO L125 PetriNetUnfolderBase]: For 298381/299935 co-relation queries the response was YES. [2025-03-17 06:44:13,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137264 conditions, 18144 events. 11754/18144 cut-off events. For 298381/299935 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 124120 event pairs, 3170 based on Foata normal form. 1211/19198 useless extension candidates. Maximal degree in co-relation 136186. Up to 7195 conditions per place. [2025-03-17 06:44:13,765 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 994 selfloop transitions, 89 changer transitions 0/1141 dead transitions. [2025-03-17 06:44:13,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1141 transitions, 20737 flow [2025-03-17 06:44:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:44:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 06:44:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-03-17 06:44:13,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-17 06:44:13,766 INFO L175 Difference]: Start difference. First operand has 263 places, 1116 transitions, 18481 flow. Second operand 7 states and 121 transitions. [2025-03-17 06:44:13,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1141 transitions, 20737 flow [2025-03-17 06:44:15,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 1141 transitions, 20506 flow, removed 114 selfloop flow, removed 1 redundant places. [2025-03-17 06:44:15,561 INFO L231 Difference]: Finished difference. Result has 269 places, 972 transitions, 16177 flow [2025-03-17 06:44:15,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=15914, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=971, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=16177, PETRI_PLACES=269, PETRI_TRANSITIONS=972} [2025-03-17 06:44:15,562 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 234 predicate places. [2025-03-17 06:44:15,562 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 972 transitions, 16177 flow [2025-03-17 06:44:15,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-17 06:44:15,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:44:15,562 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, 1, 1, 1] [2025-03-17 06:44:15,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 06:44:15,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 06:44:15,763 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:44:15,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:44:15,763 INFO L85 PathProgramCache]: Analyzing trace with hash -606958121, now seen corresponding path program 1 times [2025-03-17 06:44:15,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:44:15,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184547734] [2025-03-17 06:44:15,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:44:15,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:44:15,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 06:44:15,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 06:44:15,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:44:15,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:15,817 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-17 06:44:15,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:44:15,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184547734] [2025-03-17 06:44:15,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184547734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:44:15,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986219053] [2025-03-17 06:44:15,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:44:15,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:44:15,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:44:15,820 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:44:15,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 06:44:15,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 06:44:15,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 06:44:15,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:44:15,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:15,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:44:15,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:44:15,914 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-17 06:44:15,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:44:15,949 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-17 06:44:15,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986219053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:44:15,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:44:15,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 06:44:15,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261919522] [2025-03-17 06:44:15,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:44:15,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:44:15,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:44:15,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:44:15,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:44:15,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:44:15,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 972 transitions, 16177 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 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-17 06:44:15,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:44:15,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:44:15,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:44:18,022 INFO L124 PetriNetUnfolderBase]: 7291/11585 cut-off events. [2025-03-17 06:44:18,022 INFO L125 PetriNetUnfolderBase]: For 197801/199185 co-relation queries the response was YES. [2025-03-17 06:44:18,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88254 conditions, 11585 events. 7291/11585 cut-off events. For 197801/199185 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 77596 event pairs, 2790 based on Foata normal form. 687/12100 useless extension candidates. Maximal degree in co-relation 88118. Up to 6638 conditions per place. [2025-03-17 06:44:18,117 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 707 selfloop transitions, 28 changer transitions 0/804 dead transitions. [2025-03-17 06:44:18,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 804 transitions, 15211 flow [2025-03-17 06:44:18,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:44:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 06:44:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-17 06:44:18,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2025-03-17 06:44:18,118 INFO L175 Difference]: Start difference. First operand has 269 places, 972 transitions, 16177 flow. Second operand 6 states and 98 transitions. [2025-03-17 06:44:18,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 804 transitions, 15211 flow [2025-03-17 06:44:19,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 804 transitions, 14798 flow, removed 123 selfloop flow, removed 10 redundant places. [2025-03-17 06:44:19,165 INFO L231 Difference]: Finished difference. Result has 255 places, 712 transitions, 12095 flow [2025-03-17 06:44:19,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=12011, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12095, PETRI_PLACES=255, PETRI_TRANSITIONS=712} [2025-03-17 06:44:19,166 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 220 predicate places. [2025-03-17 06:44:19,166 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 712 transitions, 12095 flow [2025-03-17 06:44:19,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 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-17 06:44:19,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:44:19,166 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-17 06:44:19,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 06:44:19,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 06:44:19,367 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:44:19,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:44:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1613080208, now seen corresponding path program 12 times [2025-03-17 06:44:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:44:19,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174614417] [2025-03-17 06:44:19,367 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 06:44:19,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:44:19,371 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-03-17 06:44:19,374 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 06:44:19,374 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-17 06:44:19,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 06:44:19,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:44:19,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174614417] [2025-03-17 06:44:19,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174614417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:44:19,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:44:19,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:44:19,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298952628] [2025-03-17 06:44:19,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:44:19,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:44:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:44:19,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:44:19,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:44:19,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-17 06:44:19,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 712 transitions, 12095 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-17 06:44:19,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:44:19,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-17 06:44:19,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:44:22,118 INFO L124 PetriNetUnfolderBase]: 10273/15496 cut-off events. [2025-03-17 06:44:22,118 INFO L125 PetriNetUnfolderBase]: For 224690/225063 co-relation queries the response was YES. [2025-03-17 06:44:22,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113273 conditions, 15496 events. 10273/15496 cut-off events. For 224690/225063 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 97131 event pairs, 1427 based on Foata normal form. 244/15727 useless extension candidates. Maximal degree in co-relation 112350. Up to 5656 conditions per place. [2025-03-17 06:44:22,303 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 730 selfloop transitions, 145 changer transitions 25/903 dead transitions. [2025-03-17 06:44:22,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 903 transitions, 16599 flow [2025-03-17 06:44:22,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:44:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 06:44:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2025-03-17 06:44:22,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2025-03-17 06:44:22,304 INFO L175 Difference]: Start difference. First operand has 255 places, 712 transitions, 12095 flow. Second operand 8 states and 133 transitions. [2025-03-17 06:44:22,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 903 transitions, 16599 flow [2025-03-17 06:44:23,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 903 transitions, 16375 flow, removed 46 selfloop flow, removed 7 redundant places. [2025-03-17 06:44:23,846 INFO L231 Difference]: Finished difference. Result has 259 places, 713 transitions, 12424 flow [2025-03-17 06:44:23,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=11995, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12424, PETRI_PLACES=259, PETRI_TRANSITIONS=713} [2025-03-17 06:44:23,846 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 224 predicate places. [2025-03-17 06:44:23,846 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 713 transitions, 12424 flow [2025-03-17 06:44:23,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-17 06:44:23,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:44:23,847 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-17 06:44:23,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 06:44:23,847 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:44:23,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:44:23,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1642131354, now seen corresponding path program 13 times [2025-03-17 06:44:23,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:44:23,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415437265] [2025-03-17 06:44:23,847 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 06:44:23,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:44:23,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 06:44:23,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 06:44:23,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:44:23,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:44:23,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:44:23,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415437265] [2025-03-17 06:44:23,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415437265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:44:23,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410386891] [2025-03-17 06:44:23,913 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 06:44:23,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:44:23,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:44:23,930 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:44:23,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 06:44:23,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 06:44:23,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 06:44:23,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:44:23,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:23,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 06:44:23,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:44:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:44:24,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:44:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:44:24,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410386891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:44:24,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:44:24,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 06:44:24,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551448316] [2025-03-17 06:44:24,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:44:24,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:44:24,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:44:24,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:44:24,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:44:24,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 06:44:24,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 713 transitions, 12424 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-17 06:44:24,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:44:24,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 06:44:24,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:44:25,971 INFO L124 PetriNetUnfolderBase]: 7466/11628 cut-off events. [2025-03-17 06:44:25,971 INFO L125 PetriNetUnfolderBase]: For 194167/194943 co-relation queries the response was YES. [2025-03-17 06:44:26,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87095 conditions, 11628 events. 7466/11628 cut-off events. For 194167/194943 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 74602 event pairs, 2882 based on Foata normal form. 903/12421 useless extension candidates. Maximal degree in co-relation 86395. Up to 8299 conditions per place. [2025-03-17 06:44:26,070 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 407 selfloop transitions, 3 changer transitions 285/708 dead transitions. [2025-03-17 06:44:26,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 708 transitions, 13618 flow [2025-03-17 06:44:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:44:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 06:44:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-03-17 06:44:26,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-17 06:44:26,071 INFO L175 Difference]: Start difference. First operand has 259 places, 713 transitions, 12424 flow. Second operand 7 states and 110 transitions. [2025-03-17 06:44:26,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 708 transitions, 13618 flow [2025-03-17 06:44:27,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 708 transitions, 13279 flow, removed 23 selfloop flow, removed 7 redundant places. [2025-03-17 06:44:27,096 INFO L231 Difference]: Finished difference. Result has 257 places, 423 transitions, 6759 flow [2025-03-17 06:44:27,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10991, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6759, PETRI_PLACES=257, PETRI_TRANSITIONS=423} [2025-03-17 06:44:27,096 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 222 predicate places. [2025-03-17 06:44:27,097 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 423 transitions, 6759 flow [2025-03-17 06:44:27,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-17 06:44:27,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:44:27,097 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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] [2025-03-17 06:44:27,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 06:44:27,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 06:44:27,301 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:44:27,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:44:27,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1741249556, now seen corresponding path program 14 times [2025-03-17 06:44:27,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:44:27,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180202597] [2025-03-17 06:44:27,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:44:27,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:44:27,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 06:44:27,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:44:27,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:44:27,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:44:27,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:44:27,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180202597] [2025-03-17 06:44:27,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180202597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:44:27,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184411060] [2025-03-17 06:44:27,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:44:27,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:44:27,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:44:27,370 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:44:27,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 06:44:27,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 06:44:27,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:44:27,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 06:44:27,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:27,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:44:27,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:44:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:44:27,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:44:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 06:44:27,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184411060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:44:27,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:44:27,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-17 06:44:27,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213820138] [2025-03-17 06:44:27,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:44:27,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 06:44:27,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:44:27,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 06:44:27,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:44:27,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-17 06:44:27,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 423 transitions, 6759 flow. Second operand has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 states have internal predecessors, (132), 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-17 06:44:27,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:44:27,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-17 06:44:27,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:44:35,099 INFO L124 PetriNetUnfolderBase]: 24150/34348 cut-off events. [2025-03-17 06:44:35,099 INFO L125 PetriNetUnfolderBase]: For 467901/467901 co-relation queries the response was YES. [2025-03-17 06:44:35,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247732 conditions, 34348 events. 24150/34348 cut-off events. For 467901/467901 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 200818 event pairs, 318 based on Foata normal form. 58/34406 useless extension candidates. Maximal degree in co-relation 247646. Up to 14182 conditions per place. [2025-03-17 06:44:35,451 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 1544 selfloop transitions, 864 changer transitions 0/2409 dead transitions. [2025-03-17 06:44:35,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 2409 transitions, 37257 flow [2025-03-17 06:44:35,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-03-17 06:44:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2025-03-17 06:44:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 1685 transitions. [2025-03-17 06:44:35,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3897756187832524 [2025-03-17 06:44:35,454 INFO L175 Difference]: Start difference. First operand has 257 places, 423 transitions, 6759 flow. Second operand 131 states and 1685 transitions. [2025-03-17 06:44:35,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 2409 transitions, 37257 flow [2025-03-17 06:44:37,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 2409 transitions, 34115 flow, removed 1064 selfloop flow, removed 29 redundant places. [2025-03-17 06:44:37,492 INFO L231 Difference]: Finished difference. Result has 382 places, 1197 transitions, 18305 flow [2025-03-17 06:44:37,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6013, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=131, PETRI_FLOW=18305, PETRI_PLACES=382, PETRI_TRANSITIONS=1197} [2025-03-17 06:44:37,493 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 347 predicate places. [2025-03-17 06:44:37,493 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 1197 transitions, 18305 flow [2025-03-17 06:44:37,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 states have internal predecessors, (132), 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-17 06:44:37,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:44:37,493 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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] [2025-03-17 06:44:37,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 06:44:37,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:44:37,694 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-17 06:44:37,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:44:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1499032248, now seen corresponding path program 15 times [2025-03-17 06:44:37,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:44:37,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995307067] [2025-03-17 06:44:37,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:44:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:44:37,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-03-17 06:44:37,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:44:37,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:44:37,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 06:44:37,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:44:37,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995307067] [2025-03-17 06:44:37,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995307067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:44:37,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271799284] [2025-03-17 06:44:37,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:44:37,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:44:37,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:44:37,770 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:44:37,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 06:44:37,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-03-17 06:44:37,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 06:44:37,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 06:44:37,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:44:37,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:44:37,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:44:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 06:44:37,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:44:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 06:44:37,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271799284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:44:37,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:44:37,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-17 06:44:37,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71564734] [2025-03-17 06:44:37,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:44:37,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 06:44:37,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:44:37,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 06:44:37,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-17 06:44:37,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-17 06:44:37,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1197 transitions, 18305 flow. Second operand has 20 states, 20 states have (on average 7.45) internal successors, (149), 20 states have internal predecessors, (149), 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-17 06:44:37,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:44:37,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-17 06:44:37,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand