./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-sum.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 c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:51:47,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:51:47,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:51:47,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:51:47,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:51:47,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:51:47,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:51:47,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:51:47,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:51:47,310 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:51:47,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:51:47,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:51:47,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:51:47,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:51:47,311 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:51:47,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:51:47,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:51:47,311 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:51:47,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:51:47,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:51:47,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:51:47,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:51:47,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:51:47,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:51:47,312 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:51:47,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:51:47,312 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:51:47,312 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:51:47,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:51:47,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:51:47,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:51:47,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:51:47,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:51:47,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:51:47,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:51:47,313 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:51:47,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:51:47,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:51:47,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:51:47,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:51:47,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:51:47,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:51:47,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:51:47,314 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 -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2025-03-13 21:51:47,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:51:47,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:51:47,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:51:47,553 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:51:47,553 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:51:47,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-03-13 21:51:48,727 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962a67c17/3da51e434844450d8b683951ae434df6/FLAG6e1899c0d [2025-03-13 21:51:48,923 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:51:48,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-03-13 21:51:48,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962a67c17/3da51e434844450d8b683951ae434df6/FLAG6e1899c0d [2025-03-13 21:51:48,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962a67c17/3da51e434844450d8b683951ae434df6 [2025-03-13 21:51:48,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:51:48,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:51:48,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:51:48,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:51:48,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:51:48,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:51:48" (1/1) ... [2025-03-13 21:51:48,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c31941c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:48, skipping insertion in model container [2025-03-13 21:51:48,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:51:48" (1/1) ... [2025-03-13 21:51:48,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:51:49,085 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-three-array-sum.wvr.c[2730,2743] [2025-03-13 21:51:49,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:51:49,100 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:51:49,111 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-three-array-sum.wvr.c[2730,2743] [2025-03-13 21:51:49,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:51:49,121 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:51:49,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49 WrapperNode [2025-03-13 21:51:49,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:51:49,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:51:49,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:51:49,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:51:49,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (1/1) ... [2025-03-13 21:51:49,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (1/1) ... [2025-03-13 21:51:49,141 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 129 [2025-03-13 21:51:49,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:51:49,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:51:49,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:51:49,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:51:49,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (1/1) ... [2025-03-13 21:51:49,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (1/1) ... [2025-03-13 21:51:49,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (1/1) ... [2025-03-13 21:51:49,160 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-13 21:51:49,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (1/1) ... [2025-03-13 21:51:49,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (1/1) ... [2025-03-13 21:51:49,164 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (1/1) ... [2025-03-13 21:51:49,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (1/1) ... [2025-03-13 21:51:49,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (1/1) ... [2025-03-13 21:51:49,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (1/1) ... [2025-03-13 21:51:49,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:51:49,168 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:51:49,168 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:51:49,168 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:51:49,169 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (1/1) ... [2025-03-13 21:51:49,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:51:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:49,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:51:49,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:51:49,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:51:49,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:51:49,204 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:51:49,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:51:49,204 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:51:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:51:49,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:51:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:51:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:51:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:51:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:51:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:51:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:51:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:51:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:51:49,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:51:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:51:49,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:51:49,206 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:51:49,274 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:51:49,275 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:51:49,521 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:51:49,522 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:51:49,522 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:51:49,704 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:51:49,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:51:49 BoogieIcfgContainer [2025-03-13 21:51:49,705 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:51:49,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:51:49,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:51:49,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:51:49,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:51:48" (1/3) ... [2025-03-13 21:51:49,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7380597c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:51:49, skipping insertion in model container [2025-03-13 21:51:49,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:49" (2/3) ... [2025-03-13 21:51:49,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7380597c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:51:49, skipping insertion in model container [2025-03-13 21:51:49,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:51:49" (3/3) ... [2025-03-13 21:51:49,711 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-03-13 21:51:49,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:51:49,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-13 21:51:49,722 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:51:49,767 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:51:49,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 99 flow [2025-03-13 21:51:49,824 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2025-03-13 21:51:49,826 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:51:49,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 7/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-03-13 21:51:49,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 39 transitions, 99 flow [2025-03-13 21:51:49,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 35 transitions, 88 flow [2025-03-13 21:51:49,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:51:49,852 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;@30e920c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:51:49,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:51:49,885 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:51:49,885 INFO L124 PetriNetUnfolderBase]: 7/34 cut-off events. [2025-03-13 21:51:49,885 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:51:49,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:49,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:49,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:49,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:49,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1556676095, now seen corresponding path program 1 times [2025-03-13 21:51:49,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:49,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525938344] [2025-03-13 21:51:49,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:49,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:49,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:51:50,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:50,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:50,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:50,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:50,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525938344] [2025-03-13 21:51:50,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525938344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:51:50,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:51:50,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:51:50,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035120055] [2025-03-13 21:51:50,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:50,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:51:50,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:50,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:51:50,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:51:50,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-13 21:51:50,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:50,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:50,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-13 21:51:50,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:50,710 INFO L124 PetriNetUnfolderBase]: 776/1207 cut-off events. [2025-03-13 21:51:50,711 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-13 21:51:50,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2370 conditions, 1207 events. 776/1207 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5259 event pairs, 226 based on Foata normal form. 1/1066 useless extension candidates. Maximal degree in co-relation 2013. Up to 641 conditions per place. [2025-03-13 21:51:50,721 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 44 selfloop transitions, 3 changer transitions 1/54 dead transitions. [2025-03-13 21:51:50,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 237 flow [2025-03-13 21:51:50,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:51:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:51:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-13 21:51:50,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6495726495726496 [2025-03-13 21:51:50,732 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 88 flow. Second operand 3 states and 76 transitions. [2025-03-13 21:51:50,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 237 flow [2025-03-13 21:51:50,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 215 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:51:50,741 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 95 flow [2025-03-13 21:51:50,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=35, PETRI_TRANSITIONS=37} [2025-03-13 21:51:50,745 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2025-03-13 21:51:50,745 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 95 flow [2025-03-13 21:51:50,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:50,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:50,745 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-13 21:51:50,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:51:50,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:50,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2051011479, now seen corresponding path program 1 times [2025-03-13 21:51:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:50,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113985316] [2025-03-13 21:51:50,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:50,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:51:50,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:51:50,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:50,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:50,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:50,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113985316] [2025-03-13 21:51:50,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113985316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:51:50,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:51:50,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:51:50,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116867196] [2025-03-13 21:51:50,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:50,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:51:50,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:50,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:51:50,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:51:50,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-13 21:51:50,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:50,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:50,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-13 21:51:50,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:51,229 INFO L124 PetriNetUnfolderBase]: 1314/2173 cut-off events. [2025-03-13 21:51:51,229 INFO L125 PetriNetUnfolderBase]: For 283/283 co-relation queries the response was YES. [2025-03-13 21:51:51,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4346 conditions, 2173 events. 1314/2173 cut-off events. For 283/283 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11316 event pairs, 723 based on Foata normal form. 74/2158 useless extension candidates. Maximal degree in co-relation 1853. Up to 1011 conditions per place. [2025-03-13 21:51:51,242 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 64 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2025-03-13 21:51:51,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 82 transitions, 357 flow [2025-03-13 21:51:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:51:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:51:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-13 21:51:51,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2025-03-13 21:51:51,244 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 95 flow. Second operand 6 states and 129 transitions. [2025-03-13 21:51:51,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 82 transitions, 357 flow [2025-03-13 21:51:51,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 82 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:51:51,247 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 176 flow [2025-03-13 21:51:51,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=43, PETRI_TRANSITIONS=47} [2025-03-13 21:51:51,247 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-03-13 21:51:51,248 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 176 flow [2025-03-13 21:51:51,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:51,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:51,248 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] [2025-03-13 21:51:51,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:51:51,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:51,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1418014365, now seen corresponding path program 1 times [2025-03-13 21:51:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:51,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477418047] [2025-03-13 21:51:51,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:51,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:51,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:51:51,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:51:51,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:51,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:51,384 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-13 21:51:51,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:51,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477418047] [2025-03-13 21:51:51,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477418047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:51,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814017326] [2025-03-13 21:51:51,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:51,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:51,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:51,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:51:51,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:51:51,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:51:51,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:51:51,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:51,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:51,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:51:51,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:51,540 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-13 21:51:51,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:51:51,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814017326] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:51,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:51:51,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-13 21:51:51,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078975474] [2025-03-13 21:51:51,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:51,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:51:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:51,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:51:51,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:51:51,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-13 21:51:51,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:51,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:51,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-13 21:51:51,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:52,027 INFO L124 PetriNetUnfolderBase]: 2629/4125 cut-off events. [2025-03-13 21:51:52,027 INFO L125 PetriNetUnfolderBase]: For 2228/2228 co-relation queries the response was YES. [2025-03-13 21:51:52,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9545 conditions, 4125 events. 2629/4125 cut-off events. For 2228/2228 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 22588 event pairs, 1015 based on Foata normal form. 0/3794 useless extension candidates. Maximal degree in co-relation 4278. Up to 1459 conditions per place. [2025-03-13 21:51:52,057 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 87 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2025-03-13 21:51:52,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 100 transitions, 536 flow [2025-03-13 21:51:52,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:51:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:51:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-13 21:51:52,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2025-03-13 21:51:52,062 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 176 flow. Second operand 6 states and 129 transitions. [2025-03-13 21:51:52,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 100 transitions, 536 flow [2025-03-13 21:51:52,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 536 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:51:52,067 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 224 flow [2025-03-13 21:51:52,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2025-03-13 21:51:52,068 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-03-13 21:51:52,068 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 224 flow [2025-03-13 21:51:52,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:52,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:52,068 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] [2025-03-13 21:51:52,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:51:52,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:52,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:52,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash 865666442, now seen corresponding path program 1 times [2025-03-13 21:51:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:52,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128542952] [2025-03-13 21:51:52,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:52,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:51:52,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:51:52,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:52,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:52,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:52,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128542952] [2025-03-13 21:51:52,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128542952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:51:52,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:51:52,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:51:52,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027166631] [2025-03-13 21:51:52,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:52,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:51:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:52,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:51:52,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:51:52,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-13 21:51:52,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:52,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:52,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-13 21:51:52,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:52,722 INFO L124 PetriNetUnfolderBase]: 1547/2446 cut-off events. [2025-03-13 21:51:52,722 INFO L125 PetriNetUnfolderBase]: For 1983/1983 co-relation queries the response was YES. [2025-03-13 21:51:52,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6396 conditions, 2446 events. 1547/2446 cut-off events. For 1983/1983 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11623 event pairs, 924 based on Foata normal form. 0/2298 useless extension candidates. Maximal degree in co-relation 4334. Up to 1490 conditions per place. [2025-03-13 21:51:52,735 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 29 selfloop transitions, 6 changer transitions 37/78 dead transitions. [2025-03-13 21:51:52,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 458 flow [2025-03-13 21:51:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:51:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:51:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2025-03-13 21:51:52,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4829059829059829 [2025-03-13 21:51:52,737 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 224 flow. Second operand 6 states and 113 transitions. [2025-03-13 21:51:52,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 458 flow [2025-03-13 21:51:52,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 458 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:51:52,742 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 177 flow [2025-03-13 21:51:52,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2025-03-13 21:51:52,743 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-03-13 21:51:52,743 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 177 flow [2025-03-13 21:51:52,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:52,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:52,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:52,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:51:52,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:52,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:52,745 INFO L85 PathProgramCache]: Analyzing trace with hash -344603372, now seen corresponding path program 1 times [2025-03-13 21:51:52,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:52,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996697431] [2025-03-13 21:51:52,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:52,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:51:52,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:51:52,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:52,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:52,861 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-13 21:51:52,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996697431] [2025-03-13 21:51:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996697431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782630963] [2025-03-13 21:51:52,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:52,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:52,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:52,864 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:51:52,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:51:52,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:51:52,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:51:52,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:52,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:52,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:51:52,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:53,006 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-13 21:51:53,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:51:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782630963] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:53,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:51:53,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-13 21:51:53,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6235304] [2025-03-13 21:51:53,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:53,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:51:53,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:53,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:51:53,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:51:53,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-13 21:51:53,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:53,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:53,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-13 21:51:53,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:53,220 INFO L124 PetriNetUnfolderBase]: 1082/1732 cut-off events. [2025-03-13 21:51:53,220 INFO L125 PetriNetUnfolderBase]: For 1355/1355 co-relation queries the response was YES. [2025-03-13 21:51:53,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4494 conditions, 1732 events. 1082/1732 cut-off events. For 1355/1355 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7967 event pairs, 290 based on Foata normal form. 72/1709 useless extension candidates. Maximal degree in co-relation 4471. Up to 891 conditions per place. [2025-03-13 21:51:53,230 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 42 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-03-13 21:51:53,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 321 flow [2025-03-13 21:51:53,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:51:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:51:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-03-13 21:51:53,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4256410256410256 [2025-03-13 21:51:53,232 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 177 flow. Second operand 5 states and 83 transitions. [2025-03-13 21:51:53,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 321 flow [2025-03-13 21:51:53,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 270 flow, removed 15 selfloop flow, removed 10 redundant places. [2025-03-13 21:51:53,237 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 161 flow [2025-03-13 21:51:53,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-03-13 21:51:53,238 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2025-03-13 21:51:53,239 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 161 flow [2025-03-13 21:51:53,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:53,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:53,239 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, 1, 1, 1, 1] [2025-03-13 21:51:53,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:51:53,440 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-13 21:51:53,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:53,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash -104869571, now seen corresponding path program 1 times [2025-03-13 21:51:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:53,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100616917] [2025-03-13 21:51:53,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:53,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:53,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:51:53,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:51:53,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:53,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:53,571 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-13 21:51:53,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:53,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100616917] [2025-03-13 21:51:53,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100616917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:53,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428009154] [2025-03-13 21:51:53,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:53,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:53,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:53,574 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:51:53,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:51:53,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:51:53,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:51:53,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:53,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:53,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:51:53,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:53,691 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-13 21:51:53,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:51:53,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428009154] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:53,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:51:53,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-13 21:51:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998826428] [2025-03-13 21:51:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:53,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:51:53,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:53,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:51:53,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:51:53,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-13 21:51:53,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:53,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:53,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-13 21:51:53,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:53,864 INFO L124 PetriNetUnfolderBase]: 826/1331 cut-off events. [2025-03-13 21:51:53,864 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2025-03-13 21:51:53,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3369 conditions, 1331 events. 826/1331 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5983 event pairs, 410 based on Foata normal form. 82/1366 useless extension candidates. Maximal degree in co-relation 3326. Up to 872 conditions per place. [2025-03-13 21:51:53,870 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 45 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2025-03-13 21:51:53,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 319 flow [2025-03-13 21:51:53,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:51:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:51:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-03-13 21:51:53,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-13 21:51:53,872 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 161 flow. Second operand 5 states and 91 transitions. [2025-03-13 21:51:53,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 319 flow [2025-03-13 21:51:53,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 311 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:51:53,874 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 176 flow [2025-03-13 21:51:53,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2025-03-13 21:51:53,874 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-03-13 21:51:53,874 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 176 flow [2025-03-13 21:51:53,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:53,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:53,875 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, 1, 1, 1, 1, 1] [2025-03-13 21:51:53,880 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-13 21:51:54,075 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-13 21:51:54,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:54,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:54,076 INFO L85 PathProgramCache]: Analyzing trace with hash -959277375, now seen corresponding path program 1 times [2025-03-13 21:51:54,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:54,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528760387] [2025-03-13 21:51:54,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:54,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:54,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:51:54,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:51:54,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:54,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:54,980 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-13 21:51:54,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528760387] [2025-03-13 21:51:54,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528760387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913094972] [2025-03-13 21:51:54,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:54,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:54,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:54,986 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:51:54,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:51:55,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:51:55,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:51:55,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:55,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:55,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-13 21:51:55,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:55,324 INFO L349 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-03-13 21:51:55,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2025-03-13 21:51:56,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:51:56,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 499 [2025-03-13 21:52:00,617 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-13 21:52:00,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:12,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:12,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 83 [2025-03-13 21:52:14,903 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-13 21:52:14,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913094972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:14,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:14,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 26 [2025-03-13 21:52:14,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740942206] [2025-03-13 21:52:14,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:14,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-13 21:52:14,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:14,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-13 21:52:14,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=596, Unknown=2, NotChecked=0, Total=702 [2025-03-13 21:52:18,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:52:22,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 21:52:22,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-13 21:52:22,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 176 flow. Second operand has 27 states, 27 states have (on average 10.444444444444445) internal successors, (282), 27 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:52:22,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:22,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-13 21:52:22,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:24,954 INFO L124 PetriNetUnfolderBase]: 2493/3878 cut-off events. [2025-03-13 21:52:24,954 INFO L125 PetriNetUnfolderBase]: For 3708/3724 co-relation queries the response was YES. [2025-03-13 21:52:24,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10643 conditions, 3878 events. 2493/3878 cut-off events. For 3708/3724 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 19175 event pairs, 72 based on Foata normal form. 1/3757 useless extension candidates. Maximal degree in co-relation 10598. Up to 1636 conditions per place. [2025-03-13 21:52:24,972 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 160 selfloop transitions, 47 changer transitions 1/212 dead transitions. [2025-03-13 21:52:24,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 212 transitions, 1213 flow [2025-03-13 21:52:24,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:52:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:52:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 323 transitions. [2025-03-13 21:52:24,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4601139601139601 [2025-03-13 21:52:24,973 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 176 flow. Second operand 18 states and 323 transitions. [2025-03-13 21:52:24,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 212 transitions, 1213 flow [2025-03-13 21:52:24,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 212 transitions, 1193 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-13 21:52:24,978 INFO L231 Difference]: Finished difference. Result has 75 places, 88 transitions, 568 flow [2025-03-13 21:52:24,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=568, PETRI_PLACES=75, PETRI_TRANSITIONS=88} [2025-03-13 21:52:24,978 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 37 predicate places. [2025-03-13 21:52:24,978 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 88 transitions, 568 flow [2025-03-13 21:52:24,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.444444444444445) internal successors, (282), 27 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:52:24,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:24,979 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, 1, 1, 1, 1, 1] [2025-03-13 21:52:24,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:52:25,183 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-13 21:52:25,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:52:25,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:25,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2119404803, now seen corresponding path program 2 times [2025-03-13 21:52:25,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:25,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233704780] [2025-03-13 21:52:25,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:52:25,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:25,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-13 21:52:25,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:52:25,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:25,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:26,137 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-13 21:52:26,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:26,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233704780] [2025-03-13 21:52:26,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233704780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:26,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700771340] [2025-03-13 21:52:26,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:52:26,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:26,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:26,139 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:52:26,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:52:26,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-13 21:52:26,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:52:26,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:26,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:26,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-13 21:52:26,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:26,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-13 21:52:26,273 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-13 21:52:26,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-13 21:52:26,339 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-13 21:52:26,339 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 16 treesize of output 18 [2025-03-13 21:52:26,524 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:52:26,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-03-13 21:52:26,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:26,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2025-03-13 21:52:26,962 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-13 21:52:26,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:27,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:27,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 316 treesize of output 296 [2025-03-13 21:52:28,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2025-03-13 21:52:28,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:28,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 75 [2025-03-13 21:52:28,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 37 [2025-03-13 21:52:28,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 73 treesize of output 61 [2025-03-13 21:52:28,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 306 treesize of output 254 [2025-03-13 21:52:28,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 39 [2025-03-13 21:52:28,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 87 treesize of output 71 [2025-03-13 21:52:29,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2025-03-13 21:52:29,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 65 treesize of output 53 [2025-03-13 21:52:30,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2025-03-13 21:52:30,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 65 treesize of output 53 [2025-03-13 21:52:30,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 97 treesize of output 81 [2025-03-13 21:52:30,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 129 treesize of output 105 [2025-03-13 21:52:43,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 39 [2025-03-13 21:52:43,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 87 treesize of output 71 [2025-03-13 21:52:44,577 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-13 21:52:44,584 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-13 21:52:44,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 73 treesize of output 61 [2025-03-13 21:52:44,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 306 treesize of output 254 [2025-03-13 21:52:45,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2025-03-13 21:52:45,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 65 treesize of output 53 [2025-03-13 21:52:45,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2025-03-13 21:52:45,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 57 [2025-03-13 21:52:46,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 39 [2025-03-13 21:52:46,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 87 treesize of output 71 [2025-03-13 21:52:46,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 39 [2025-03-13 21:52:46,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 87 treesize of output 71 [2025-03-13 21:52:47,829 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-13 21:52:47,853 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-13 21:52:47,863 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-13 21:52:48,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2025-03-13 21:52:48,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 65 treesize of output 53 [2025-03-13 21:52:48,698 INFO L349 Elim1Store]: treesize reduction 40, result has 34.4 percent of original size [2025-03-13 21:52:48,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 59 [2025-03-13 21:52:51,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:51,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 133 [2025-03-13 21:52:52,222 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:52:52,223 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 47 treesize of output 35 [2025-03-13 21:52:52,408 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:52:52,408 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 73 treesize of output 53 [2025-03-13 21:52:56,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:56,849 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 68 treesize of output 60 [2025-03-13 21:52:57,846 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:52:57,847 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 22 treesize of output 19 [2025-03-13 21:52:57,871 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:52:57,871 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 47 treesize of output 35 [2025-03-13 21:53:02,017 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:53:02,017 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 22 treesize of output 1 [2025-03-13 21:53:02,029 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:53:02,029 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 47 treesize of output 1 [2025-03-13 21:53:02,039 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-13 21:53:02,039 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 22 treesize of output 1 [2025-03-13 21:53:02,060 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:53:02,060 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 47 treesize of output 35 [2025-03-13 21:53:06,329 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:53:06,329 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 73 treesize of output 53 [2025-03-13 21:53:15,691 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:53:15,692 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 97 treesize of output 69 [2025-03-13 21:53:17,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 39 [2025-03-13 21:53:17,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 87 treesize of output 71